1995 entries checked

Fixed formatting of README.md files.

Some typo fixes.

All entries work well.

Added some try commands.

1995/cdua/README.md

@@ -21,6 +21,9 @@ assistance!
 
 	./cdua
 
+NOTE: on modern systems this might be hard to see it solve it in running time as
+it goes so quickly but it will still show the result after execution.
+
 ## Judges' comments
 
 This could be used as the basis of an a-maze-ing screen exerciser.

1995/dodsond1/README.md

@@ -10,20 +10,29 @@
 
         make all
 
-### To run
+## To run:
 
-	./dodsond1 < some.text
+	./dodsond1 < text_file
 
-## Judges' comment
+## Try:
 
-    You might consider givig the following input:
+
+	./dodsond1 < README.md
+
+## Judges' comments:
+
+You might consider giving the following input:
 
 	 ... a male (who) gets very, very frustrated sitting in a chair all
 	 the time because males are biologically driven to go out and hunt
 	 giraffes.
 		-- Adjunct Professor Newt Gingrich, Reinhardt College, 1/7/95
 
-## Author's comments
+... which can be done like:
+
+	./dodsond1 < try.this.txt
+
+## Author's comments:
 
 Istha ogrampra akesta Englishwa extta aswa inputwa andwa
 anslatestra itwa intowa Igpa Atinla.

1995/dodsond1/try.this.txt

@@ -0,0 +1,6 @@
+         ... a male (who) gets very, very frustrated sitting in a chair all
+         the time because males are biologically driven to go out and hunt
+         giraffes.
+                -- Adjunct Professor Newt Gingrich, Reinhardt College, 1/7/95
+
+

1995/dodsond2/README.md

@@ -10,20 +10,21 @@
 
         make all
 
-### To run
+### To run:
 
 	  ./dodsond2
 
-## Judges' comments
+
+## Judges' comments:
 
 An amazing entry!
 
 The official chef enjoyed solving the maze, which she did on the first
 attempt.
 
-## Author's comments
+## Author's comments:
 
-    Interactive 3D Maze
+### Interactive 3D Maze
 
 Step into a randomly generated 3D maze and try to get out alive!
 Use the vi movement keys (hjkl) to move on a level, and u or d

1995/esde/README.md

@@ -9,31 +9,33 @@
 
         make all
 
-### To run
+### To run:
 
 	./esde data-file word
 
 where data-file contains lines of < 255 chars in length.
 
-## Judges' comments
 
-    Try: 
+## Try: 
 
 	./esde esde.data Johanson
 	./esde esde.data2 read
-	./esde esde.hint date
+	./esde README.md date
+
+
+## Judges' comments:
 
 When reading the source be careful to distinguish between variable
 names and library functions.  
 
-    If you still don't know what it does, try:
+If you still don't know what it does, try
+[https://en.wikipedia.org/wiki/Soundex](https://en.wikipedia.org/wiki/Soundex).
 
-	http://avian.dars.muohio.edu/~kaelbesa/soundex.html
-	http://avian.dars.muohio.edu/~kaelbesa/coder.html
 
 ## Author's comments
 
-    0) what this program does.
+### what this program does:
+
 This program searches in the file words which have the same Soundex code
 like the given word, and print out lines with these words.
 
@@ -42,15 +44,14 @@
 Soundex code begins with the first letter of the word followed by a
 three-digit code. There is the algorithm:
 
-       a) Every letter in the word change by a digit (excluding the first
+0. Every letter in the word change by a digit (excluding the first letter).
-          letter).
+1. Replace all pairs of the same code by single code (ex. R011235 -> R01235).
-       b) Replace all pairs of the same code by single code
+2. Remove all 0-codes (ex. R01235 -> R1235).
-          (ex. R011235 -> R01235).
+3. If length of code is > 4, get only first 4 codes (ex. R1235 -> R123).
-       c) Remove all 0-codes (ex. R01235 -> R1235).
+4. If length of code is < 4, add zeros (ex. T12 -> T120).
-       d) If lenght of code is > 4, get only first 4 codes (ex. R1235 -> R123).
+
-       e) If lenght of code is < 4, add zeros (ex. T12 -> T120).
+These are the codes:
 
-       There is the codes:
       0  =  A, E, H, I, O, U, W, Y
       1  =  B, P, F, V
       2  =  C, S, G, J, K, Q, X, Z
@@ -59,6 +60,7 @@
       5  =  M, N
       6  =  R
 
-    1) information about an info file.
+### information about an info file:
-       An info file should be a text file consisting of lines (max. 256 bytes
+
+An info file should be a text file consisting of lines of text (max. 256 bytes
 in each line).

1995/garry/README.md

@@ -9,23 +9,29 @@
 
         make all
 
-### To run
+## To run:
+
+
+	./garry <input_file >output_file
+
+## Try:
 
 	./garry.test.sh
 
+	./garry < README.md
+
 ## Judges' comments
 
 In general, try:
 
-	./garry <input_file >output_file
 
 While it may not have been the intention of the submitter, the
-    judges noted that the C pre-processed version (with the #includes
+judges noted that the C pre-processed version (with the `#include`s
 left intact) looked very much like a rat "dropping core".  See
-    garry.cpp and judge for yourself!
+`garry.cpp` and judge for yourself!
 
 The author was kind enough to provide a less obfuscated version of
-    the source called garry.fmt.c.
+the source called `garry.fmt.c`.
 
 ## Author's comments
 
@@ -49,7 +55,7 @@
 	My Home-Directory is: $HOME$
 	I'm using the path: $PATH$
 
-    Unknown  Env-variables  or  misformed  expressions  are ignored and kept
+Unknown  Env-variables  or  malformed  expressions  are ignored and kept
 intact.
 
 Additionally,   the   filter   replaces  escaped  octal  values  in  the

1995/heathbar/README.md

@@ -10,11 +10,18 @@
 
         make all
 
-### To run
+## To run:
+
+	./heathbar num num
+
+where num is a non-negative number.
+
+## Try:
 
 	./heathbar 4253 2281
 
-## Judges' comments
+
+## Judges' comments:
 
 The main reason we liked this entry was mainly because the main
 effect of the source was self documenting!  :-)
@@ -43,7 +50,7 @@
 with unfamiliar variable names.
 
 Also, I've looked at some past winning entries of your contest, and
-    if you don't mind a little constructive criticsm, some of them are
+if you don't mind a little constructive criticism, some of them are
 kind-of hard to figure out. I didn't want my program to fall into
 the same trap, so I went out of my way to write self-documenting
 code.  Anyone who so much as glances at my program will immediately

1995/leo/README.md

@@ -9,12 +9,28 @@
 
         make all
 
-### To run
+## To run:
+
+
+	./leo [ deep ] [ right ] [ Variable ] [ cycle [ freq ] ]
+
+See the author's information below on these details.
+
+## Try:
 
 	./leo 1 | cat - /dev/tty | gs -
+
    	./leo 37 80 | cat - /dev/tty | gs -
 
-## Judges' comments
+If you don't have gs or an equivalent postscript viewer, try:
+
+	echo "" | ./leo 1 > foo.ps
+
+and send foo.ps to your local postscript printer or open it in an appropriate
+application (e.g. GIMP).
+
+
+## Judges' comments:
 
 Press return after each image is drawn.
 
@@ -25,18 +41,13 @@
 the image is drawn, so we added element 106 which acts as an input
 buffer.
 
-    If you don't have gs or an equivalent postscript viewer, try:
-
-	echo "" | leo 1 > foo.ps
-
-    and send foo.ps to your local postscript printer.
-
 To qualify for a category specially for yourself in  the Geek code, 
-    find out the all the secret switches that the author doesn't divulge !
+find out all the secret switches that the author doesn't divulge !
 (All  switches are single characters on the command line - anything that's
  not a number is a candidate)
 
-## Author's comments
+
+## Author's comments:
 
 The usage is:
 
@@ -83,8 +94,10 @@
                             __ / \ __
                               |   |
 
+
+Step 4:
                                 .
-    Step 4:                  \./ \./
+                             \./ \./
                            \__|   |__/
                            /   \./   \
                                 |
@@ -153,15 +166,15 @@ The lines marked by I show the places where "simultaneity" is significant.
 
 To watch it repeatedly (as a screen saver), use:
     
-	leo 2 | cat - /dev/tty | gs -
+	./leo 2 | cat - /dev/tty | gs -
 
 The command line:
 
-	leo Variable 1 | cat - /dev/tty | gs -
+	./leo Variable 1 | cat - /dev/tty | gs -
 
 This draws the same as above. Try:
     
-	leo Variable 1 1 | cat - /dev/tty | gs -
+	./leo Variable 1 1 | cat - /dev/tty | gs -
 
 what happened to the picture? Increase `freq' and watch the changes.
 
@@ -170,7 +183,8 @@ The lines marked by I show the places where "simultaneity" is significant.
 but there is a secret switch to suppress looping : useful
 if you want to pipe the output to a printer.
 
-    uudecode the spoiler below if you really want to know.
+`uudecode` the spoiler below if you really want to know.
+
 begin 664 spoiler1
 M*%1H92!C;VQO;B J:7,J('1H92!S96-R970@<W=I=&-H("T@=&AE('-P86-E
 =(&)E9F]R92!I="!I<R!N;W0@82!M:7-T86ME*0II
@@ -181,7 +195,7 @@ end
 as far as it is > 1. To figure out what difference
 `cycle' makes when `Variable' is not used, try
 
-	leo Variable 37 80 | cat - /dev/tty | gs -
+	./leo Variable 37 80 | cat - /dev/tty | gs -
 
 and other values of `cycle'; smaller values usually require
 smaller values of `freq' for the patterns to be non-trivial

1995/makarios/README.md

@@ -10,7 +10,7 @@
 
         make all
 
-### To run
+### To run:
 
 	./makarios
 
@@ -24,4 +24,4 @@
 This program takes no arguments. It emits the base 8 representation
 of prime palindromes (palindromic in base 8, of course).
 
-    ^_^
+`^_^`

1995/savastio/README.md

@@ -10,17 +10,20 @@
 
         make all
 
-### To run
+## To run:
 
 	./savastio
+	# enter a number such as 100
 
-	NOTE: enter a number (such as 100).
+## Try:
 
-## Judges' comments
+	echo 42 | ./savastio
+
+## Judges' comments:
 
 I know an l when I see a 1.
 
-## Author's comments
+## Author's comments:
 
 This program is an infinite-precision factorial calculator.  It will
 compute the factorial of any number entered to an infinite degree of
@@ -44,7 +47,7 @@
 
 Long integers must be at least 4 bytes.
 
-    Features:
+### Features
 
 In order to prevent the user from wasting too much time computing
 useless factorials, the maximum factorial that can be computed is

1995/schnitzi/README.md

@@ -10,13 +10,19 @@
 
         make all
 
-### To run
+## To run:
 
+	./schnitzi num
+
+## Try:
 	./schnitzi 24
 	./schnitzi 18
 	./schnitzi 30
 
-## Judges' comments
+NOTE: as the author warns do not use too high a number! If you wish to ignore
+the warning it is an exercise to determine how high is too high. :-)
+
+## Judges' comments:
 
 Sometimes a core dump is a feature, not a bug!
 

1995/spinellis/README.md

@@ -10,14 +10,14 @@
 
         make all
 
-### To run
+### To run:
 
 	./spinellis < spinellis.c
 
 ## Judges' comments
 
 
-    While code does not abuse the rules, its output surely does!
+While the code does not abuse the rules, its output surely does!
 
 P.S. Does the source have any spelling errors?
 

1995/vanschnitz/README.md

@@ -11,22 +11,24 @@
 
         make all
 
-### To run
+## To run:
 
 	./vanschnitz
 
-## Judges' comments
+## Try:
 
-    To use:
+    make clobber all LEVEL=6
+    ./vanschnitz
 
-	make clobber all LEVEL=8
+## Judges' comments:
 
-    Warning: Values of LEVEL>8 have been known to cause compilers
+Warning: in the past, values of LEVEL>8 have been known to cause compilers (and
-    (and in one case a system) to crash during compilation.
+in one case a system) to crash during compilation. We tested it in 2023 on a
+MacBook Pro with the M1 chip and found that LEVEL > 6 caused problems.
 
 For a bad/slow time try LEVEL=15.
 
-## Author's comments
+## Authors' comments:
 
 A classic problem in computer science is known as the Towers
 of Hanoi.  It involves a set of different-sized disks mounted
@@ -63,10 +65,10 @@
 The resulting program that the compiler generates simply
 prints out the answer.  Did I say "simply"?  Actually, the
 whole resulting program consists of a single printf statement,
-    consisting of a massive string constant of length 35*(2^n-1),
+consisting of a massive string constant of length `35*(2^n-1)`,
-    followed by 3*(2^n-1) integers which get formatted into the
+followed by `3*(2^n-1)` integers which get formatted into the
 string.  For our n=14 run, this adds up to a string constant
-    of length 573405, followed by 49149 integers delimeted by
+of length 573405, followed by 49149 integers delimited by
 commas.  (Generating the string constant depends on the
 ANSI C feature in which adjacent character strings are
 catenated; a version that does not use this feature has been