'comments' -> 'remarks' in all README.md files

As in

    sgit -e 's/\([Aa]uthor.*\)comments/\1remarks/g' -e 's/\([Jj]udge.*\)comments/\1remarks/g' '*README.md'

1995/README.md

@@ -4,7 +4,7 @@
 Look at the README.md file for the given winner for information
 on how to compile the winner and how to run the winning program.
 Look at the winning source and try to figure how it does what it does!
-You may then wish to look at the Author's comments for even more details.
+You may then wish to look at the Author's remarks for even more details.
 
 The IOCCC has an official home page:
 

1995/cdua/README.md

@@ -27,11 +27,11 @@ NOTE: sometimes the program needs you to press enter a second time to continue
 solving the maze. See [bugs.md](/bugs.md) for more details.
 
 
-## Judges' comments
+## Judges' remarks
 
 This could be used as the basis of an a-maze-ing screen exerciser.
 
-## Author's comments
+## Author's remarks
 
 A program that generates a maze, and then solves it, all this being
 seen by the user.  Some highlights of obfuscation are: 3 steps

1995/dodsond1/README.md

@@ -19,7 +19,7 @@
 
 	./dodsond1 < README.md
 
-## Judges' comments:
+## Judges' remarks:
 
 You might consider giving the following input:
 
@@ -32,7 +32,7 @@ You might consider giving the following input:
 
 	./dodsond1 < try.this.txt
 
-## Author's comments:
+## Author's remarks:
 
 Istha ogrampra akesta Englishwa extta aswa inputwa andwa
 anslatestra itwa intowa Igpa Atinla.

1995/dodsond2/README.md

@@ -15,14 +15,14 @@
 	  ./dodsond2
 
 
-## Judges' comments:
+## Judges' remarks:
 
 An amazing entry!
 
 The official chef enjoyed solving the maze, which she did on the first
 attempt.
 
-## Author's comments:
+## Author's remarks:
 
 ### Interactive 3D Maze
 

1995/esde/README.md

@@ -23,7 +23,7 @@ where data-file contains lines of < 255 chars in length.
 	./esde README.md date
 
 
-## Judges' comments:
+## Judges' remarks:
 
 When reading the source be careful to distinguish between variable
 names and library functions.  
@@ -32,7 +32,7 @@ If you still don't know what it does, try
 [https://en.wikipedia.org/wiki/Soundex](https://en.wikipedia.org/wiki/Soundex).
 
 
-## Author's comments
+## Author's remarks
 
 ### what this program does:
 

1995/garry/README.md

@@ -20,7 +20,7 @@
 
 	./garry < README.md
 
-## Judges' comments
+## Judges' remarks
 
 In general, try:
 
@@ -33,7 +33,7 @@ left intact) looked very much like a rat "dropping core".  See
 The author was kind enough to provide a less obfuscated version of
 the source called `garry.fmt.c`.
 
-## Author's comments
+## Author's remarks
 
 This  program is a file filter, designed to do environment-expansion and
 incorporating  the  ability  to  create  binary from escaped data in the

1995/heathbar/README.md

@@ -21,12 +21,12 @@ where num is a non-negative number.
 	./heathbar 4253 2281
 
 
-## Judges' comments:
+## Judges' remarks:
 
 The main reason we liked this entry was mainly because the main
 effect of the source was self documenting!  :-)
 
-## Author's comments
+## Author's remarks
 
 Run this program with two non-negative integer arguments
 (e.g. "prog 1234 999").

1995/leo/README.md

@@ -30,7 +30,7 @@ and send foo.ps to your local postscript printer or open it in an appropriate
 application (e.g. GIMP).
 
 
-## Judges' comments:
+## Judges' remarks:
 
 Press return after each image is drawn.
 
@@ -47,7 +47,7 @@ find out all the secret switches that the author doesn't divulge !
  not a number is a candidate)
 
 
-## Author's comments:
+## Author's remarks:
 
 The usage is:
 

1995/makarios/README.md

@@ -14,12 +14,12 @@
 
 	./makarios
 
-## Judges' comments
+## Judges' remarks
 
 The judges were impressed that such a small program could do so much!
 Can you figure out how it does it?
 
-## Author's comments
+## Author's remarks
 
 This program takes no arguments. It emits the base 8 representation
 of prime palindromes (palindromic in base 8, of course).

1995/savastio/README.md

@@ -19,11 +19,11 @@
 
 	echo 42 | ./savastio
 
-## Judges' comments:
+## Judges' remarks:
 
 I know an l when I see a 1.
 
-## Author's comments:
+## Author's remarks:
 
 This program is an infinite-precision factorial calculator.  It will
 compute the factorial of any number entered to an infinite degree of

1995/schnitzi/README.md

@@ -24,14 +24,14 @@ USA
 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:
+## Judges' remarks:
 
 Sometimes a core dump is a feature, not a bug!
 
 This is one of the better one-liners we have seen in a while.
 Take some time to figure out what it does before you run it!
 
-## Author's comments
+## Author's remarks
 
 Beware, running this program with too high of a number
 amounts to doing a fork bomb on your machine!

1995/spinellis/README.md

@@ -14,14 +14,14 @@
 
 	./spinellis < spinellis.c
 
-## Judges' comments
+## Judges' remarks
 
 
 While the code does not abuse the rules, its output surely does!
 
 P.S. Does the source have any spelling errors?
 
-## Author's comments
+## Author's remarks
 
 96% of the program lines (631 out of the 658) are comment text rendering
 the program readable and understandable.  With the exception of the

1995/vanschnitz/README.md

@@ -20,7 +20,7 @@
     make clobber all LEVEL=6
     ./vanschnitz
 
-## Judges' comments:
+## Judges' remarks:
 
 Warning: in the past, values of LEVEL>8 have been known to cause compilers (and
 in one case a system) to crash during compilation. We tested it in 2023 on a
@@ -28,7 +28,7 @@ MacBook Pro with the M1 chip and found that LEVEL > 6 caused problems.
 
 For a bad/slow time try LEVEL=15.
 
-## Authors' comments:
+## Authors' remarks:
 
 A classic problem in computer science is known as the Towers
 of Hanoi.  It involves a set of different-sized disks mounted