From cb6da2585bc10cb01aec0e48b6dda53e6753e3bd Mon Sep 17 00:00:00 2001
From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com>
Date: Fri, 12 Jul 2024 11:48:19 -0700
Subject: [PATCH] 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.
---
1991/fine/README.md | 10 ++++++++++
1991/fine/index.html | 5 +++++
2 files changed, 15 insertions(+)
diff --git a/1991/fine/README.md b/1991/fine/README.md
index 73254ff84..b74bf76ca 100644
--- a/1991/fine/README.md
+++ b/1991/fine/README.md
@@ -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:
diff --git a/1991/fine/index.html b/1991/fine/index.html
index 17360fbe8..97b88f577 100644
--- a/1991/fine/index.html
+++ b/1991/fine/index.html
@@ -426,6 +426,11 @@ file tricks.
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.
The author wishes to thank J Greely for the last 6 bytes.
Here’s about how it does it: