Add challenge note to 1991/fine

In case someone wants more of a challenge in a subsection of the judges'
remarks it has the notice about trying to figure it out by looking at
the code and only (unless they are not looking for an additional
challenge) if they get stuck should they come back to read the author's
remarks.
This commit is contained in:
Cody Boone Ferguson committed 2024-07-12 11:48:19 -07:00
1 parent 03f32f4b73
commit cb6da2585b
2 files changed
+15

No files matched your search

+10
View File
@@ -44,9 +44,19 @@ How does this program work? Which 3 bytes of C code can be changed
into 2 bytes, allowing the program to still work, but also stripping
the high bit off some input?
### NOTICE to those who wish for a greater challenge:
**If you want a greater challenge, don't read any further**:
just try to understand the program via the source.
If you get stuck, come back and read the author's remarks for additional hints
and information.
## Author's remarks:
The author wishes to thank J Greely for the last 6 bytes.
Here's about how it does it:
+5
View File
@@ -426,6 +426,11 @@ file tricks.</p>
<p>How does this program work? Which 3 bytes of C code can be changed
into 2 bytes, allowing the program to still work, but also stripping
the high bit off some input?</p>
<h3 id="notice-to-those-who-wish-for-a-greater-challenge">NOTICE to those who wish for a greater challenge:</h3>
<p><strong>If you want a greater challenge, don’t read any further</strong>:
just try to understand the program via the source.</p>
<p>If you get stuck, come back and read the author’s remarks for additional hints
and information.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p>The author wishes to thank J Greely for the last 6 bytes.</p>
<p>Here’s about how it does it:</p>