diff --git a/1990/dds/README.md b/1990/dds/README.md index aed7d1651..64962f1c3 100644 --- a/1990/dds/README.md +++ b/1990/dds/README.md @@ -85,8 +85,7 @@ Boolean expressions evaluate to 0 for false and 1 for true. - Free format positioning of tokens on the line. - No space is allowed before the line number. -- Exactly one space is needed between the OLD or SAVE command and\ - the filename. +- Exactly one space is needed between the OLD or SAVE command and the filename. - ALL INPUT MUST BE UPPERCASE. diff --git a/1990/dds/index.html b/1990/dds/index.html index 9c58ca2e2..ea1055be4 100644 --- a/1990/dds/index.html +++ b/1990/dds/index.html @@ -213,8 +213,7 @@ UPPER CASE.

Limits:

diff --git a/1990/jaw/README.md b/1990/jaw/README.md index 3b8f71fed..037a63f4a 100644 --- a/1990/jaw/README.md +++ b/1990/jaw/README.md @@ -64,8 +64,8 @@ directory it is run from. #### Minimal, Universal File Bundling (or, Functional Obfuscation in a Self-Decoding Unix Shell Archive) -James A. Woods\ -Universities Space Research Association\ +James A. Woods
+Universities Space Research Association
NASA Ames Research Center @@ -108,16 +108,15 @@ within a modified Shannon model of communication, the 'shark' effort aims to construct a "shortest program" for source decoding in the Turing-universal Unix environment. ----------------------------------------------- +``` + Oh, the shark has pretty teeth, dear-- + And he shows them pearly white + Just a jackknife has Macheath, dear-- + And he keeps it out of sight. -> Oh, the shark has pretty teeth, dear--\ -> And he shows them pearly white\ -> Just a jackknife has Macheath, dear--\ -> And he keeps it out of sight.\ -> \ -> -- Bertolt Brecht, Threepenny Opera + -- Bertolt Brecht, Threepenny Opera +``` ----------------------------------------------- ### Portability diff --git a/1990/jaw/index.html b/1990/jaw/index.html index a5ea7c6d1..9ca30582a 100644 --- a/1990/jaw/index.html +++ b/1990/jaw/index.html @@ -190,8 +190,8 @@ directory it is run from.

Authors’ remarks:

ABSTRACT

Minimal, Universal File Bundling (or, Functional Obfuscation in a Self-Decoding Unix Shell Archive)

-

James A. Woods
-Universities Space Research Association
+

James A. Woods
+Universities Space Research Association
NASA Ames Research Center

@@ -225,16 +225,12 @@ encoding schemes.

within a modified Shannon model of communication, the ‘shark’ effort aims to construct a “shortest program” for source decoding in the Turing-universal Unix environment.

-
-
-

Oh, the shark has pretty teeth, dear–
-And he shows them pearly white
-Just a jackknife has Macheath, dear–
-And he keeps it out of sight.
-
-– Bertolt Brecht, Threepenny Opera

-
-
+
    Oh, the shark has pretty teeth, dear--
+    And he shows them pearly white
+    Just a jackknife has Macheath, dear--
+    And he keeps it out of sight.
+
+    -- Bertolt Brecht, Threepenny Opera

Portability

We have ported this program to a wide variety of systems. Among these are:

diff --git a/1991/ant/README.md b/1991/ant/README.md index e191767fb..5ba6be350 100644 --- a/1991/ant/README.md +++ b/1991/ant/README.md @@ -138,18 +138,18 @@ screen with long lines. Paging up and down should work correctly, however. ### References: -[Fin80] Craig A. Finseth, "Theory and Practice of Text Editors or\ - A Cookbook For An EMACS", TM-165, MIT Lab. for Computer\ +[Fin80] Craig A. Finseth, "Theory and Practice of Text Editors or
+ A Cookbook For An EMACS", TM-165, MIT Lab. for Computer
Science -[KeP81] Kernighan & Plauger, "Software Tools in Pascal",\ +[KeP81] Kernighan & Plauger, "Software Tools in Pascal",
Addison-Wesley, 81, chapter 6 [Mil86] Eugene W. Myers & Webb Miller, "Row-replacement Algorithms - for Screen Editors", TR 86-19, Dept. of Computer Science,\ + for Screen Editors", TR 86-19, Dept. of Computer Science,
U. of Arizona -[MyM86] Eugene W. Myers & Webb Miller, "A simple row-replacement\ +[MyM86] Eugene W. Myers & Webb Miller, "A simple row-replacement
method", TR 86-28, Dept. of Computer Science, U. of Arizona [Mil87] Webb Miller, "A Software Tools Sampler", Prentice Hall, 87 diff --git a/1991/ant/index.html b/1991/ant/index.html index 06f715986..3854a63b8 100644 --- a/1991/ant/index.html +++ b/1991/ant/index.html @@ -238,15 +238,15 @@ in the same group every so often.

This entry will display a file with long lines, but has trouble scrolling the screen with long lines. Paging up and down should work correctly, however.

References:

-

[Fin80] Craig A. Finseth, “Theory and Practice of Text Editors or
-A Cookbook For An EMACS”, TM-165, MIT Lab. for Computer
+

[Fin80] Craig A. Finseth, “Theory and Practice of Text Editors or
+A Cookbook For An EMACS”, TM-165, MIT Lab. for Computer
Science

-

[KeP81] Kernighan & Plauger, “Software Tools in Pascal”,
+

[KeP81] Kernighan & Plauger, “Software Tools in Pascal”,
Addison-Wesley, 81, chapter 6

[Mil86] Eugene W. Myers & Webb Miller, “Row-replacement Algorithms -for Screen Editors”, TR 86-19, Dept. of Computer Science,
+for Screen Editors”, TR 86-19, Dept. of Computer Science,
U. of Arizona

-

[MyM86] Eugene W. Myers & Webb Miller, “A simple row-replacement
+

[MyM86] Eugene W. Myers & Webb Miller, “A simple row-replacement
method”, TR 86-28, Dept. of Computer Science, U. of Arizona

[Mil87] Webb Miller, “A Software Tools Sampler”, Prentice Hall, 87 ISBN 0-13-822305-X, chapter 5

diff --git a/1991/rince/README.md b/1991/rince/README.md index 3a23a1026..022b71826 100644 --- a/1991/rince/README.md +++ b/1991/rince/README.md @@ -87,15 +87,15 @@ Key to map: ###### | | | /\ /--\ ==| /\ | | Directonal keys ###### Solid Wall | ----|| \/ /\ ||---- (unlock doors of ###### | \/ ==| \--/ \/ the same direction) - |\ + | | << >> Doors. Unlocked by Blank space | << vvvvvv ^^^^^^ >> the above keys. | << >> - |\ + | ___ | o__O\ O__O ^__^ /O__o\ / \ 'Crushable' | \___/ /----\ /----\ \___/ The four sprites for \___/ boulder | _/_\ _/ \_ _/ \_ /_\_ your character :-) - |\ + | ___ uncrushable | /\ Diamonds. They can either be found lying /@@@\ boulder | < > around (if only!) or manufacture by pushing \@@@/ | \/ two 'crushable' rocks together. diff --git a/1991/rince/index.html b/1991/rince/index.html index 408bd5412..e6c11c254 100644 --- a/1991/rince/index.html +++ b/1991/rince/index.html @@ -195,15 +195,15 @@ enjoyment high.

###### | | | /\ /--\ ==| /\ | | Directonal keys ###### Solid Wall | ----|| \/ /\ ||---- (unlock doors of ###### | \/ ==| \--/ \/ the same direction) - |\ + | | << >> Doors. Unlocked by Blank space | << vvvvvv ^^^^^^ >> the above keys. | << >> - |\ + | ___ | o__O\ O__O ^__^ /O__o\ / \ 'Crushable' | \___/ /----\ /----\ \___/ The four sprites for \___/ boulder | _/_\ _/ \_ _/ \_ /_\_ your character :-) - |\ + | ___ uncrushable | /\ Diamonds. They can either be found lying /@@@\ boulder | < > around (if only!) or manufacture by pushing \@@@/ | \/ two 'crushable' rocks together. diff --git a/1991/westley/README.md b/1991/westley/README.md index 217c5c8f9..590999556 100644 --- a/1991/westley/README.md +++ b/1991/westley/README.md @@ -143,16 +143,18 @@ What happens if you make a move already made? Now go try and draw or better yet win (without cheating which is very easy :-) )! Why is win better than draw? Because everyone knows how to draw: -> Professor Falken: Did you ever play tic-tac-toe?\ -> Jennifer Mack: Yeah. Of course.\ -> Falken: But you don't any more.\ -> Jennifer: No.\ -> Falken: Why?\ -> Jennifer: Because it's a boring game. It's always a tie.\ -> Falken: Exactly. There's no way to win. The game itself is pointless. But back -at the [International Obfuscated C Code Contest judges' -room](../../judges.html) they believe that -you can win tic-tac-toe, that there can be acceptable draws. +``` + Professor Falken: Did you ever play tic-tac-toe? + Jennifer Mack: Yeah. Of course. + Falken: But you don't any more. + Jennifer: No. + Falken: Why? + Jennifer: Because it's a boring game. It's always a tie. + Falken: Exactly. There's no way to win. The game itself is pointless. + But back at the International Obfuscated C Code Contest judges' + room they believe that you can win tic-tac-toe, that there can + be acceptable draws. +``` This is supposed to happen. As is written in the [The Jargon File](http://catb.org/jargon/html/F/feature.html): diff --git a/1991/westley/index.html b/1991/westley/index.html index 1bdbc881d..d4782e6aa 100644 --- a/1991/westley/index.html +++ b/1991/westley/index.html @@ -231,18 +231,16 @@ can lose if you cheat. That’s supposed to happen. Can you win any other time?<

What happens if you make a move already made?

Now go try and draw or better yet win (without cheating which is very easy :-) )! Why is win better than draw? Because everyone knows how to draw:

-
-

Professor Falken: Did you ever play tic-tac-toe?
-Jennifer Mack: Yeah. Of course.
-Falken: But you don’t any more.
-Jennifer: No.
-Falken: Why?
-Jennifer: Because it’s a boring game. It’s always a tie.
-Falken: Exactly. There’s no way to win. The game itself is pointless. But back -at the International Obfuscated C Code Contest judges’ -room they believe that -you can win tic-tac-toe, that there can be acceptable draws.

-
+
    Professor Falken: Did you ever play tic-tac-toe?
+    Jennifer Mack: Yeah. Of course.
+    Falken: But you don't any more.
+    Jennifer: No.
+    Falken: Why?
+    Jennifer: Because it's a boring game. It's always a tie.
+    Falken: Exactly. There's no way to win. The game itself is pointless.
+            But back at the International Obfuscated C Code Contest judges'
+            room they believe that you can win tic-tac-toe, that there can
+            be acceptable draws.

This is supposed to happen. As is written in the The Jargon File:

    That's not a bug, that's a feature.
diff --git a/1992/vern/README.md b/1992/vern/README.md index 555ed3be5..601195c1e 100644 --- a/1992/vern/README.md +++ b/1992/vern/README.md @@ -125,7 +125,7 @@ initial source is gloriously difficult to peruse. In particular, the Makefile does: ``` - sed vern.tmp.c ``` diff --git a/1992/vern/index.html b/1992/vern/index.html index e674bfe9c..d3546a20b 100644 --- a/1992/vern/index.html +++ b/1992/vern/index.html @@ -235,7 +235,7 @@ at build time into much-needed text. Without this hack the program wouldn’t pass the character limit. A nice side effect is that the initial source is gloriously difficult to peruse. In particular, the Makefile does:

-
    sed <vern.c 's/{ /(/g;s/} /)/g;s/;       /#define /' | \
+
    sed <vern.c 's/{ /(/g;s/} /)/g;s/;       /#define /' |
         sed 's/}      /=/g;s/{        /i/g' >vern.tmp.c

 
and compiles vern.tmp.c.

 
Second, the rather ho-hum step has been taking of naming each variable
diff --git a/1992/westley/README.md b/1992/westley/README.md
index 4442ffb33..d345c17f5 100644
--- a/1992/westley/README.md
+++ b/1992/westley/README.md
@@ -150,16 +150,18 @@ is reasonably accurate.
 
 ### Here are some cities you might like to try:
 
-- New York	    41   -74\
-- London	    52   0\
-- Moscow	    56   38\
-- New Delhi	    29   77\
-- Sydney	    -34  151
-- Los Angeles	    34   -118
-- Paris		    45   2
-- Rio de Janeiro    -23  -43
-- Beijing	    40   116
-- Tokyo		    36   140
+```
+    New York	     41  -74
+    London	     52   0
+    Moscow	     56   38
+    New Delhi	     29   77
+    Sydney	    -34   151
+    Los Angeles	     34  -118
+    Paris	     45   2
+    Rio de Janeiro  -23  -43
+    Beijing	     40   116
+    Tokyo	     36   140
+```
 
 
 For a domestic (US) version with higher resolution, try:
diff --git a/1992/westley/index.html b/1992/westley/index.html
index c6ef4e232..ad319ca11 100644
--- a/1992/westley/index.html
+++ b/1992/westley/index.html
@@ -236,22 +236,16 @@ blank line. It’s just for show, really.

 be just off the map; this is an unavoidable artifact. The map
 is reasonably accurate.

 
Here are some cities you might like to try:

-
    
-
  • New York 41 -74
    
-
    • 
-
  • London 52 0
    
-
    • 
-
  • Moscow 56 38
    
-
    • 
-
  • New Delhi 29 77
    
-
    • 
-
  • Sydney -34 151
    • 
-
  • Los Angeles 34 -118
    • 
-
  • Paris 45 2
    • 
-
  • Rio de Janeiro -23 -43
    • 
-
  • Beijing 40 116
    • 
-
  • Tokyo 36 140
    • 
-

+
    New York         41  -74
+    London           52   0
+    Moscow           56   38
+    New Delhi        29   77
+    Sydney          -34   151
+    Los Angeles      34  -118
+    Paris            45   2
+    Rio de Janeiro  -23  -43
+    Beijing          40   116
+    Tokyo            36   140

 
For a domestic (US) version with higher resolution, try:

 
    main(l,a,n,d)char**a;{for(d=atoi(a[1])/2*80-atoi(a[2])-2043;
     n="bnaBCOCXdBBHGYdAP[A M E R I C A].AqandkmavX|ELC}BOCd"
diff --git a/1998/schweikh1/README.md b/1998/schweikh1/README.md
index 989619651..e1a18d11c 100644
--- a/1998/schweikh1/README.md
+++ b/1998/schweikh1/README.md
@@ -171,7 +171,7 @@ C compilers.
 
    is rejected by tcc version 4.1.2, the TenDRA compiler:
    ```
-   "t.c", line 3: Error:\
+   "t.c", line 3: Error:

    [ISO 6.8.3.3]: Invalid result for '##' operator in macro 'H'.
    ```
 
diff --git a/1998/schweikh1/index.html b/1998/schweikh1/index.html
index 6229d6e4c..c9dd6ae17 100644
--- a/1998/schweikh1/index.html
+++ b/1998/schweikh1/index.html
@@ -261,7 +261,7 @@ at least one compiler falls over.

 
    #define H(x) <st##x##.h>
     #include H(dio)              /* expands to <stdio.h> */

 
is rejected by tcc version 4.1.2, the TenDRA compiler:
-"t.c", line 3: Error:\    [ISO 6.8.3.3]: Invalid result for '##' operator in macro 'H'.

+"t.c", line 3: Error:<br>    [ISO 6.8.3.3]: Invalid result for '##' operator in macro 'H'.

 
To be honest, I don’t know if the rules for pp-tokens and token
 pasting don’t forbid what I do (and thus tcc is correct in rejecting it).
 In this case, all other compilers I tried are buggy, or the Standard
diff --git a/2004/anonymous/README.md b/2004/anonymous/README.md
index 3b4321339..5d5dd720c 100644
--- a/2004/anonymous/README.md
+++ b/2004/anonymous/README.md
@@ -68,9 +68,11 @@ it. The real text is:
 which when translated from [Black
 Speech](https://www.glyphweb.com/arda/b/blackspeech.html) means:
 
-> [One Ring](https://www.glyphweb.com/arda/o/onering.html) to rule them all, [One
-Ring](https://www.glyphweb.com/arda/o/onering.html) to find them,\
-> [One Ring](https://www.glyphweb.com/arda/o/onering.html) to bring them all and in the darkness bind them.
+```
+    [One Ring](https://www.glyphweb.com/arda/o/onering.html) to rule them all,
+    [One Ring](https://www.glyphweb.com/arda/o/onering.html) to find them,
+    [One Ring](https://www.glyphweb.com/arda/o/onering.html) to bring them all and in the darkness bind them.
+```
 
 
 ## Author's remarks:
diff --git a/2004/anonymous/index.html b/2004/anonymous/index.html
index fb7a2eb1f..445903fa9 100644
--- a/2004/anonymous/index.html
+++ b/2004/anonymous/index.html
@@ -195,11 +195,9 @@ burzum-ishi krimpatul.

which when translated from Black Speech means:

-
-

One Ring to rule them all, One -Ring to find them,
-One Ring to bring them all and in the darkness bind them.

-
+
    [One Ring](https://www.glyphweb.com/arda/o/onering.html) to rule them all,
+    [One Ring](https://www.glyphweb.com/arda/o/onering.html) to find them,
+    [One Ring](https://www.glyphweb.com/arda/o/onering.html) to bring them all and in the darkness bind them.

Author’s remarks:

This program takes a single command line argument, transcribes the argument text into Tolkien’s Elvish letters, and writes the diff --git a/2005/sykes/README.md b/2005/sykes/README.md index e40d55d05..d008a1b82 100644 --- a/2005/sykes/README.md +++ b/2005/sykes/README.md @@ -154,9 +154,14 @@ Supplied also is a short demo program written in ``` Many other old programs will run in this emulator too. Files with a `.PRG` -extension should work. (Look, for instance, here: -,\ -or try this one: )\ +extension should work. Look, for instance, here: + +[http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html](http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html) + +or try this one: + +[http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg](http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg) + The filenames must be upper case in order to be loaded by the emulator. You can save programs too - try diff --git a/2005/sykes/index.html b/2005/sykes/index.html index 1efb2c95b..4422cd369 100644 --- a/2005/sykes/index.html +++ b/2005/sykes/index.html @@ -231,10 +231,11 @@ slower cursor blink, try

    LOAD "DEMO"
     RUN

Many other old programs will run in this emulator too. Files with a .PRG -extension should work. (Look, for instance, here: -http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html,
-or try this one: http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg)
-The filenames must be upper case in order to be loaded by the emulator.

+extension should work. Look, for instance, here:

+

http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html

+

or try this one:

+

http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg

+

The filenames must be upper case in order to be loaded by the emulator.

You can save programs too - try

    10 PRINT "HELLO!"
     SAVE "HELLO"
diff --git a/2006/toledo2/README.md b/2006/toledo2/README.md
index 3c4846b33..471a548b1 100644
--- a/2006/toledo2/README.md
+++ b/2006/toledo2/README.md
@@ -118,9 +118,9 @@ each line:
     RUN
 
     10 FOR A=1 TO 10
-    20 PRINT A\
-    30 NEXT A\
-    LIST\
+    20 PRINT A
+    30 NEXT A
+    LIST
     RUN
 
     10 INPUT A
diff --git a/2006/toledo2/index.html b/2006/toledo2/index.html
index c0b57469b..3c017388f 100644
--- a/2006/toledo2/index.html
+++ b/2006/toledo2/index.html
@@ -218,9 +218,9 @@ each line:

     RUN
 
     10 FOR A=1 TO 10
-    20 PRINT A\
-    30 NEXT A\
-    LIST\
+    20 PRINT A
+    30 NEXT A
+    LIST
     RUN
 
     10 INPUT A
diff --git a/2011/toledo/README.md b/2011/toledo/README.md
index 41ec92921..7b92dbd78 100644
--- a/2011/toledo/README.md
+++ b/2011/toledo/README.md
@@ -110,9 +110,9 @@ extra points.
 
 
 Caveat: You can shoot only 3 bullets at a time.
-\
+
 Trick: You can fire faster if they explode on anything.
-\
+
 Believe it or not, it has strategy!
 
 When only one tank remains on the field, the level will advance.
diff --git a/2011/toledo/index.html b/2011/toledo/index.html
index 51416d8b9..c73b4ff78 100644
--- a/2011/toledo/index.html
+++ b/2011/toledo/index.html
@@ -214,9 +214,9 @@ blue when the view goes inactive.

 
The objective is to chase and destroy the other player’s tank.
 There is also an aqua tank for testing your aim and getting
 extra points.

-
Caveat: You can shoot only 3 bullets at a time.

-Trick: You can fire faster if they explode on anything.

-Believe it or not, it has strategy!

+
Caveat: You can shoot only 3 bullets at a time.

+
Trick: You can fire faster if they explode on anything.

+
Believe it or not, it has strategy!

 
When only one tank remains on the field, the level will advance.
 Don’t forget to destroy the aqua tank.

 
The battleplayground is surrounded by mountains and each level is
diff --git a/2012/endoh2/README.md b/2012/endoh2/README.md
index 5f24cc5ea..295aa608c 100644
--- a/2012/endoh2/README.md
+++ b/2012/endoh2/README.md
@@ -16,7 +16,7 @@
 and:
 
 ``` 
-    ./endoh2 e > e.c\
+    ./endoh2 e > e.c
     gcc -o e e.c
     ./e > 271.c
 ```
diff --git a/2012/endoh2/index.html b/2012/endoh2/index.html
index 1f56c8776..d07967ff2 100644
--- a/2012/endoh2/index.html
+++ b/2012/endoh2/index.html
@@ -157,7 +157,7 @@ Location: JP - Japan
     gcc -o pi pi.c
     ./pi > 314.c

and:

-
    ./endoh2 e > e.c\
+
    ./endoh2 e > e.c
     gcc -o e e.c
     ./e > 271.c

 
…

diff --git a/2012/tromp/README.md b/2012/tromp/README.md
index 0c0931f42..5b8d9666d 100644
--- a/2012/tromp/README.md
+++ b/2012/tromp/README.md
@@ -77,8 +77,11 @@ That's all there is to
 [BLC](https://tromp.github.io/cl/Binary_lambda_calculus.html)!
 
 For example the encoding of lambda term `S = \x \y \z  (x z) (y z)`,
-with [De Bruijn notation](https://en.wikipedia.org/wiki/De_Bruijn_notation) `\ \
-\ (3 1) (2 1)`, is `00 00 00 01 01 1110 10 01 110 10`.
+with [De Bruijn notation](https://en.wikipedia.org/wiki/De_Bruijn_notation):
+
+```
+    \ \ \ (3 1) (2 1)`, is `00 00 00 01 01 1110 10 01 110 10
+```
 
 In the closely related
 [BLC8](https://tromp.github.io/cl/Binary_lambda_calculus.html#BLC8:_byte_sized_I.2FO)
diff --git a/2012/tromp/index.html b/2012/tromp/index.html
index f5d144fb6..3b1acfef4 100644
--- a/2012/tromp/index.html
+++ b/2012/tromp/index.html
@@ -193,7 +193,8 @@ notation) as 1^{n}0.
 That’s all there is to
 BLC!

 
For example the encoding of lambda term S = \x \y \z  (x z) (y z),
-with De Bruijn notation \ \ \ (3 1) (2 1), is 00 00 00 01 01 1110 10 01 110 10.

+with De Bruijn notation:

+
    \ \ \ (3 1) (2 1)`, is `00 00 00 01 01 1110 10 01 110 10

 
In the closely related
 BLC8
 language, I/O is byte oriented, translating between a stream of bytes and a list
diff --git a/2013/robison/README.md b/2013/robison/README.md
index bf300e170..9f6404913 100644
--- a/2013/robison/README.md
+++ b/2013/robison/README.md
@@ -24,16 +24,16 @@
 
 ## Judges' remarks:
 
-Of integers this prog does a lot,\
+Of integers this prog does a lot,

 plus minus, div times (and what not).
 
-And modulus if remainders the needing,\
+And modulus if remainders the needing,

 on standard input percent be feeding.
 
-More than one line can thru give input,\
+More than one line can thru give input,

 when interactive one values more than throughput.
 
-With cut and paste and some time,\
+With cut and paste and some time,

 one can compute M(23209).
 
 
@@ -41,70 +41,70 @@ one can compute M(23209).
 
 ### Oh, The Strings You Can C!
 
-I love the C language; its terseness is tops.\
+I love the C language; its terseness is tops.

 But the thing I abhor is numerical ops!
 
-No shifting, division, remainder, or times.\
-No increment, decrement, or subscripting blech,\
-No addition, subtraction, or bitwise bool glop.\
+No shifting, division, remainder, or times.

+No increment, decrement, or subscripting blech,

+No addition, subtraction, or bitwise bool glop.

 As for pointer arithmetic -- totally yech!
 
-But I do have a pref'rence, for pointer deref'rence.\
-I find NOTS are a bang, and relations a ball.\
-I like calling routines, and recursions in essence.\
+But I do have a pref'rence, for pointer deref'rence.

+I find NOTS are a bang, and relations a ball.

+I like calling routines, and recursions in essence.

 But the thing I like MOST is a string dot h CALL!
 
-With mem copy I copy, and mem set I clear.\
-Take string len of this, and string copy that.\
-From my keyboard I pause, to hear subroutines dear:\
+With mem copy I copy, and mem set I clear.

+Take string len of this, and string copy that.

+From my keyboard I pause, to hear subroutines dear:

 The bark of string chrr, and the purr of string CAT!
 
-One tiny detail that could lead to defeat.\
-From where an arg points: string calls only go forth,\
-So how to go back, to be Turing complete?\
+One tiny detail that could lead to defeat.

+From where an arg points: string calls only go forth,

+So how to go back, to be Turing complete?

 From standard dot H, to the rescue, q SORT!
 
-My fixation might hint at a textual bent.\
-Does my program compose a tattoo for your shin?\
-Play crosswords or translate from Urdu to Tzouby?\
+My fixation might hint at a textual bent.

+Does my program compose a tattoo for your shin?

+Play crosswords or translate from Urdu to Tzouby?

 To give it a whirl, just punch 2 + 2 in.
 
-You can add, do division, and multiply too.\
-Take unary minus and also subtract.\
-Summing hairs of a walrus?  No longer a fuss.\
+You can add, do division, and multiply too.

+Take unary minus and also subtract.

+Summing hairs of a walrus?  No longer a fuss.

 Parenthetical grouping -- no pushing a stack!
 
-Try dividing a [googol](https://en.wikipedia.org/wiki/Googol) by one forty three,\
-Subtract an [octillion](https://en.wikipedia.org/wiki/Names_of_large_numbers) - it's simply divine.\
-To compute a remainder, inscribe a percent.\
+Try dividing a [googol](https://en.wikipedia.org/wiki/Googol) by one forty three,

+Subtract an [octillion](https://en.wikipedia.org/wiki/Names_of_large_numbers) - it's simply divine.

+To compute a remainder, inscribe a percent.

 For the sign of the answer, see C ninety nine!
 
-A hundred and twenty five digits or so,\
-Are the lengthiest figures the program can gnash.\
-Go over that limit, by even a digit:\
+A hundred and twenty five digits or so,

+Are the lengthiest figures the program can gnash.

+Go over that limit, by even a digit:

 Risk incorrect answers, or witness a crash!
 
-Say, say, does it have octal or binary zen?\
-What about duodecimal, ternary, hex?\
-Try the base as an option (of course in base ten)\
+Say, say, does it have octal or binary zen?

+What about duodecimal, ternary, hex?

+Try the base as an option (of course in base ten)

 Any base two to twenty -- for that is the specs.
 
-Use lowercase in trans-decimal radix,\
-Divide *babbage* (in base seventeen) by *cafe* --\
-a nice *fad*, but avoid a division by nix:\
+Use lowercase in trans-decimal radix,

+Divide *babbage* (in base seventeen) by *cafe* --

+a nice *fad*, but avoid a division by nix:

 No errant result, but you could wait all day!
 
-To grok the internals, ask [Queen Cleopatra](https://en.wikipedia.org/wiki/Cleopatra),\
-or [King Tutankhamun](https://en.wikipedia.org/wiki/Tutankhamun); for him it's a romp.\
-Addition by cats, and if given two figures,\
+To grok the internals, ask [Queen Cleopatra](https://en.wikipedia.org/wiki/Cleopatra),

+or [King Tutankhamun](https://en.wikipedia.org/wiki/Tutankhamun); for him it's a romp.

+Addition by cats, and if given two figures,

 to tell which is bigger, sort down and string CMP!
 
-Unlawful subtraction, a grade school infraction,\
-starts at the left and works to the right.\
-Yet more innovation: like [Henry Ford's cars](https://en.wikipedia.org/wiki/Ford_Motor_Company),\
+Unlawful subtraction, a grade school infraction,

+starts at the left and works to the right.

+Yet more innovation: like [Henry Ford's cars](https://en.wikipedia.org/wiki/Ford_Motor_Company),

 With a pound and define, mass production of vars!
 
-The moral is clear, for programmers out there:\
+The moral is clear, for programmers out there:

 With the C lib for strings, you can hack with a flair.
 
 
diff --git a/2013/robison/index.html b/2013/robison/index.html
index b22481e14..c63769b89 100644
--- a/2013/robison/index.html
+++ b/2013/robison/index.html
@@ -160,67 +160,67 @@ Location: US - United States of America
 
Try:

 
    ./try.sh

 
Judges’ remarks:

-
Of integers this prog does a lot,

+
Of integers this prog does a lot,

 plus minus, div times (and what not).

-
And modulus if remainders the needing,

+
And modulus if remainders the needing,

 on standard input percent be feeding.

-
More than one line can thru give input,

+
More than one line can thru give input,

 when interactive one values more than throughput.

-
With cut and paste and some time,

+
With cut and paste and some time,

 one can compute M(23209).

 
Author’s remarks:

 
Oh, The Strings You Can C!

-
I love the C language; its terseness is tops.

+
I love the C language; its terseness is tops.

 But the thing I abhor is numerical ops!

-
No shifting, division, remainder, or times.

-No increment, decrement, or subscripting blech,

-No addition, subtraction, or bitwise bool glop.

+
No shifting, division, remainder, or times.

+No increment, decrement, or subscripting blech,

+No addition, subtraction, or bitwise bool glop.

 As for pointer arithmetic – totally yech!

-
But I do have a pref’rence, for pointer deref’rence.

-I find NOTS are a bang, and relations a ball.

-I like calling routines, and recursions in essence.

+
But I do have a pref’rence, for pointer deref’rence.

+I find NOTS are a bang, and relations a ball.

+I like calling routines, and recursions in essence.

 But the thing I like MOST is a string dot h CALL!

-
With mem copy I copy, and mem set I clear.

-Take string len of this, and string copy that.

-From my keyboard I pause, to hear subroutines dear:

+
With mem copy I copy, and mem set I clear.

+Take string len of this, and string copy that.

+From my keyboard I pause, to hear subroutines dear:

 The bark of string chrr, and the purr of string CAT!

-
One tiny detail that could lead to defeat.

-From where an arg points: string calls only go forth,

-So how to go back, to be Turing complete?

+
One tiny detail that could lead to defeat.

+From where an arg points: string calls only go forth,

+So how to go back, to be Turing complete?

 From standard dot H, to the rescue, q SORT!

-
My fixation might hint at a textual bent.

-Does my program compose a tattoo for your shin?

-Play crosswords or translate from Urdu to Tzouby?

+
My fixation might hint at a textual bent.

+Does my program compose a tattoo for your shin?

+Play crosswords or translate from Urdu to Tzouby?

 To give it a whirl, just punch 2 + 2 in.

-
You can add, do division, and multiply too.

-Take unary minus and also subtract.

-Summing hairs of a walrus? No longer a fuss.

+
You can add, do division, and multiply too.

+Take unary minus and also subtract.

+Summing hairs of a walrus? No longer a fuss.

 Parenthetical grouping – no pushing a stack!

-
Try dividing a googol by one forty three,

-Subtract an octillion - it’s simply divine.

-To compute a remainder, inscribe a percent.

+
Try dividing a googol by one forty three,

+Subtract an octillion - it’s simply divine.

+To compute a remainder, inscribe a percent.

 For the sign of the answer, see C ninety nine!

-
A hundred and twenty five digits or so,

-Are the lengthiest figures the program can gnash.

-Go over that limit, by even a digit:

+
A hundred and twenty five digits or so,

+Are the lengthiest figures the program can gnash.

+Go over that limit, by even a digit:

 Risk incorrect answers, or witness a crash!

-
Say, say, does it have octal or binary zen?

-What about duodecimal, ternary, hex?

-Try the base as an option (of course in base ten)

+
Say, say, does it have octal or binary zen?

+What about duodecimal, ternary, hex?

+Try the base as an option (of course in base ten)

 Any base two to twenty – for that is the specs.

-
Use lowercase in trans-decimal radix,

-Divide babbage (in base seventeen) by cafe –

-a nice fad, but avoid a division by nix:

+
Use lowercase in trans-decimal radix,

+Divide babbage (in base seventeen) by cafe –

+a nice fad, but avoid a division by nix:

 No errant result, but you could wait all day!

-
To grok the internals, ask Queen Cleopatra,

-or King Tutankhamun; for him it’s a romp.

-Addition by cats, and if given two figures,

+
To grok the internals, ask Queen Cleopatra,

+or King Tutankhamun; for him it’s a romp.

+Addition by cats, and if given two figures,

 to tell which is bigger, sort down and string CMP!

-
Unlawful subtraction, a grade school infraction,

-starts at the left and works to the right.

-Yet more innovation: like Henry Ford’s cars,

+
Unlawful subtraction, a grade school infraction,

+starts at the left and works to the right.

+Yet more innovation: like Henry Ford’s cars,

 With a pound and define, mass production of vars!

-
The moral is clear, for programmers out there:

+
The moral is clear, for programmers out there:

 With the C lib for strings, you can hack with a flair.

 
     $ printf 'obase=16;10^100\n' | bc
-    1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F1000000000\
-    0000000000000000
-    $ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 \
-    | less
+    1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000
+    $ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 | less
     [...]
 ```
 
diff --git a/2015/schweikhardt/index.html b/2015/schweikhardt/index.html
index 595696a82..e0df44b8c 100644
--- a/2015/schweikhardt/index.html
+++ b/2015/schweikhardt/index.html
@@ -270,10 +270,8 @@ Fear not,
 bc(1)
 to the rescue:

 
    $ printf 'obase=16;10^100\n' | bc
-    1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F1000000000\
-    0000000000000000
-    $ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 \
-    | less
+    1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000
+    $ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 | less
     [...]

 
Observe how the first 100 iterations melt the zeros to the right. Can you explain
 why?

diff --git a/2018/burton1/README.md b/2018/burton1/README.md
index 1a425fdee..e3a3ebfd2 100644
--- a/2018/burton1/README.md
+++ b/2018/burton1/README.md
@@ -219,13 +219,15 @@ It pre-dates `varargs.h`, and assembly was the only way to gain access to the
 variable argument types.  The first edition _The C Programming Language_, 1978,
 page 71, remarks:
 
-> By the way, there is no entirely satisfactory way to write a portable function
-> that accepts a variable number of arguments, because there is no portable way
-> for the called function to determine how many arguments where actually passed
-> to it in a given call.
-> ...\
-> `printf`, the most common C function with a variable number of arguments,
-> ... is also non-portable and must be modified for different environments.
+```
+    By the way, there is no entirely satisfactory way to write a portable function
+    that accepts a variable number of arguments, because there is no portable way
+    for the called function to determine how many arguments where actually passed
+    to it in a given call.
+    ...
+    `printf`, the most common C function with a variable number of arguments,
+    ... is also non-portable and must be modified for different environments.
+```
 
 It is fascinating to explore the roots of C through the history of the operating
 system it was birthed within.  C is often criticized as a difficult, inscrutable
diff --git a/2018/burton1/index.html b/2018/burton1/index.html
index 591fd231a..ce1d6dfa4 100644
--- a/2018/burton1/index.html
+++ b/2018/burton1/index.html
@@ -298,15 +298,13 @@ shortest code that compiles and runs correctly in Ancient UNIX.

 It pre-dates varargs.h, and assembly was the only way to gain access to the
 variable argument types. The first edition The C Programming Language, 1978,
 page 71, remarks:

-

-
By the way, there is no entirely satisfactory way to write a portable function
-that accepts a variable number of arguments, because there is no portable way
-for the called function to determine how many arguments where actually passed
-to it in a given call.
-…

-printf, the most common C function with a variable number of arguments,
-… is also non-portable and must be modified for different environments.

-

+
    By the way, there is no entirely satisfactory way to write a portable function
+    that accepts a variable number of arguments, because there is no portable way
+    for the called function to determine how many arguments where actually passed
+    to it in a given call.
+    ...
+    `printf`, the most common C function with a variable number of arguments,
+    ... is also non-portable and must be modified for different environments.

 
It is fascinating to explore the roots of C through the history of the operating
 system it was birthed within. C is often criticized as a difficult, inscrutable
 language, but as this contest demonstrates, this is in parody. Shell-gol is
diff --git a/2018/burton2/README.md b/2018/burton2/README.md
index 1e6c5cc2d..e9e9f5062 100644
--- a/2018/burton2/README.md
+++ b/2018/burton2/README.md
@@ -36,45 +36,45 @@ What is this program weighing and how much does it weigh?
 
 ### tac - tokenize and count C and derivative languages:
 
-`tac` computes C program size\
-(obfuscated / otherwise)\
-by splitting code as tokens small,\
-ignoring space, then counting all.\
+`tac` computes C program size

+(obfuscated / otherwise)

+by splitting code as tokens small,

+ignoring space, then counting all.

 
-It tries quite hard to act the same\
-as counting tool of I-OCCC fame.\
-Some bugs were fixed, it's faster too,\
-and does more things, just add some glue!\
+It tries quite hard to act the same

+as counting tool of I-OCCC fame.

+Some bugs were fixed, it's faster too,

+and does more things, just add some glue!

 
-It does far more than print the size:\
-the token part's a better prize!\
-With each upon on a single line,\
-how many things can you design?\
+It does far more than print the size:

+the token part's a better prize!

+With each upon on a single line,

+how many things can you design?

 
-Included is a keyword sorter,\
-de-obfuscator, freq reporter.\
-With code produced as little parts,\
-just add your own creative arts.\
+Included is a keyword sorter,

+de-obfuscator, freq reporter.

+With code produced as little parts,

+just add your own creative arts.

 
-But first you have to figure out\
-the braces part, without a doubt!\
-And then the code - it isn't easy:\
-for as else?  That's rather cheesy!\
+But first you have to figure out

+the braces part, without a doubt!

+And then the code - it isn't easy:

+for as else?  That's rather cheesy!

 
-The rest of it is standard fare:\
-expressions strange, the globals bare,\
-confusing symbols one and oh,\
-and precedence you have to know.\
+The rest of it is standard fare:

+expressions strange, the globals bare,

+confusing symbols one and oh,

+and precedence you have to know.

 
-The keyword list was made external,\
-because of standards change eternal.\
-Thus other languages can now,\
-be counted just like C, somehow!\
+The keyword list was made external,

+because of standards change eternal.

+Thus other languages can now,

+be counted just like C, somehow!

 
-I hope you find this code obscure\
-enough to win, and thus procure\
-a public place for all to see\
-how badly I can butcher C!\
+I hope you find this code obscure

+enough to win, and thus procure

+a public place for all to see

+how badly I can butcher C!

 
 
 ### Said another way....
@@ -270,9 +270,9 @@ language_.  It really is this easy with `tac`:
 
 * I assume you noticed the [braces][2]?
 
-  _Every brace is sacred,\
-  Every brace is great.\
-  If a brace is wasted,\
+  _Every brace is sacred,

+  Every brace is great.

+  If a brace is wasted,

   Clang gets quite irate_.
 
 * Keywords follow the 2010s top five, without the `if`, for interesting flow control.
diff --git a/2018/burton2/index.html b/2018/burton2/index.html
index f7458ad43..ce8c8c4cd 100644
--- a/2018/burton2/index.html
+++ b/2018/burton2/index.html
@@ -164,46 +164,38 @@ Location: US - United States of America
 What is this program weighing and how much does it weigh?

 
Author’s remarks:

 
tac - tokenize and count C and derivative languages:

-
tac computes C program size

-(obfuscated / otherwise)

-by splitting code as tokens small,

-ignoring space, then counting all.

-

-
It tries quite hard to act the same

-as counting tool of I-OCCC fame.

-Some bugs were fixed, it’s faster too,

-and does more things, just add some glue!

-

-
It does far more than print the size:

-the token part’s a better prize!

-With each upon on a single line,

-how many things can you design?

-

-
Included is a keyword sorter,

-de-obfuscator, freq reporter.

-With code produced as little parts,

-just add your own creative arts.

-

-
But first you have to figure out

-the braces part, without a doubt!

-And then the code - it isn’t easy:

-for as else? That’s rather cheesy!

-

-
The rest of it is standard fare:

-expressions strange, the globals bare,

-confusing symbols one and oh,

-and precedence you have to know.

-

-
The keyword list was made external,

-because of standards change eternal.

-Thus other languages can now,

-be counted just like C, somehow!

-

-
I hope you find this code obscure

-enough to win, and thus procure

-a public place for all to see

-how badly I can butcher C!

-

+
tac computes C program size

+(obfuscated / otherwise)

+by splitting code as tokens small,

+ignoring space, then counting all.

+
It tries quite hard to act the same

+as counting tool of I-OCCC fame.

+Some bugs were fixed, it’s faster too,

+and does more things, just add some glue!

+
It does far more than print the size:

+the token part’s a better prize!

+With each upon on a single line,

+how many things can you design?

+
Included is a keyword sorter,

+de-obfuscator, freq reporter.

+With code produced as little parts,

+just add your own creative arts.

+
But first you have to figure out

+the braces part, without a doubt!

+And then the code - it isn’t easy:

+for as else? That’s rather cheesy!

+
The rest of it is standard fare:

+expressions strange, the globals bare,

+confusing symbols one and oh,

+and precedence you have to know.

+
The keyword list was made external,

+because of standards change eternal.

+Thus other languages can now,

+be counted just like C, somehow!

+
I hope you find this code obscure

+enough to win, and thus procure

+a public place for all to see

+how badly I can butcher C!

 
Said another way….

 
tac is the inverse of cat(1): it un-concatenates its input into C tokens,
 writing the token stream to stdout. There are options to suppress the token
@@ -353,9 +345,9 @@ language. It really is this easy with tac:

 
On the question of obfuscation:

 
    
 
  • I assume you noticed the braces?
    
-
    Every brace is sacred,
    
-Every brace is great.
    
-If a brace is wasted,
    
+
    Every brace is sacred,
    
+Every brace is great.
    
+If a brace is wasted,
    
 Clang gets quite irate    .
    • 
 
  • Keywords follow the 2010s top five, without the if, for interesting flow control.
    • 
 
  • Sometimes a for can be an else - inconceivable!
    • 
diff --git a/2018/ferguson/README.md b/2018/ferguson/README.md
index 9d4a1c3a5..73a55c2f9 100644
--- a/2018/ferguson/README.md
+++ b/2018/ferguson/README.md
@@ -223,7 +223,7 @@ monkey; I thought the monkey had it too easy: unlike his limited keyboard I have
 `isprint()` returns non-zero except that only capital letters are included;
 the file [prog.alt.c](prog.alt.c) has a slightly smaller keyboard. There are some
 additional features I have added (including two Easter eggs); amongst others:
-ability to change the target string and maximum length. See\
+ability to change the target string and maximum length. See
 **[How it works](#how)**, **[Hints](#hints)** and **[How to build](#build)** for
 more details.
 
@@ -465,8 +465,8 @@ If you do one of:
 ```
 
 It will search for `MONKEY` in both cases; in other words it's the last one.
-If the string is too long given the value of `S` (see\
-**[How to build](#build)**) it will be truncated.
+If the string is too long given the value of `S` (see **[How to build](#build)**)
+it will be truncated.
 
 If you actually do want to search for a string starting with a `-` you must
 disable further parsing of options by using the `-` option itself; for
@@ -492,7 +492,7 @@ examples of the last set of three above are equivalent i.e. the following two
 are equivalent:
 
 ```
-    -q-\
+    -q-
     -q --
 ```
 
@@ -735,7 +735,7 @@ people. Take the following invocations:
     (1) $ echo test > test
     (2) $ ./weasel test
     (3) $ ./weasel < test
-    (4) $ cat test | ./weasel\
+    (4) $ cat test | ./weasel
     (5) $ < test-strings.txt ./weasel
     (6) $ cat | ./weasel
 ```
@@ -819,7 +819,7 @@ Skip to [Obfuscation](#obfuscation).
 
 There is a type of input error, as I said, that might appear to be a bug. What
 actually is going on though is due to a technicality on how spaces are printed
-and the fact the program does not accept spaces other than a literal space\
+and the fact the program does not accept spaces other than a literal space
 ` `; when a character in the string to be found isn't in the keyboard the
 program prints an error message and then exits (returning 1). But since the
 keyboard doesn't have `'\n'` if you were to type a `'` and send a
diff --git a/2018/ferguson/index.html b/2018/ferguson/index.html
index 648035493..34ea09725 100644
--- a/2018/ferguson/index.html
+++ b/2018/ferguson/index.html
@@ -305,7 +305,7 @@ monkey; I thought the monkey had it too easy: unlike his limited keyboard I have
 isprint() returns non-zero except that only capital letters are included;
 the file prog.alt.c has a slightly smaller keyboard. There are some
 additional features I have added (including two Easter eggs); amongst others:
-ability to change the target string and maximum length. See
    
+ability to change the target string and maximum length. See
 How it works, Hints and How to build for
 more details.
    
 
    In its simplest invocation this program will work its way (using a genetic
@@ -481,8 +481,8 @@ specially by your shell e.g. parentheses. For instance if you just want to find
 
        ./weasel "METHINKS IT IS A" "MONKEY"
     ./weasel METHINKS IT IS A MONKEY
    
 
    It will search for MONKEY in both cases; in other words it’s the last one.
-If the string is too long given the value of S (see
    
-How to build) it will be truncated.
    
+If the string is too long given the value of S (see How to build)
+it will be truncated.
    
 
    If you actually do want to search for a string starting with a - you must
 disable further parsing of options by using the - option itself; for
 example if you were to do any of:
    
@@ -497,7 +497,7 @@ longer parse additional options: only target strings if anything left on the
 command line. Because of the joining of arguments this means that the first two
 examples of the last set of three above are equivalent i.e. the following two
 are equivalent:
    
-
        -q-\
+
        -q-
     -q --
    
 
    As for the caveat I referenced what does the following do?
    
 
        ./weasel -qr 5
    
@@ -660,7 +660,7 @@ people. Take the following invocations:
    
 
        (1) $ echo test > test
     (2) $ ./weasel test
     (3) $ ./weasel < test
-    (4) $ cat test | ./weasel\
+    (4) $ cat test | ./weasel
     (5) $ < test-strings.txt ./weasel
     (6) $ cat | ./weasel
    
 
    Only the first invocation of ./weasel will search for TEST because
@@ -718,7 +718,7 @@ example shows (but the strings will still only be read from the
 
    Skip to Obfuscation.
    
 
    There is a type of input error, as I said, that might appear to be a bug. What
 actually is going on though is due to a technicality on how spaces are printed
-and the fact the program does not accept spaces other than a literal space
    
+and the fact the program does not accept spaces other than a literal space
 ; when a character in the string to be found isn’t in the keyboard the
 program prints an error message and then exits (returning 1). But since the
 keyboard doesn’t have '\n' if you were to type a ' and send a
diff --git a/2018/vokes/README.md b/2018/vokes/README.md
index b314e3fb2..b9de06ea5 100644
--- a/2018/vokes/README.md
+++ b/2018/vokes/README.md
@@ -104,8 +104,7 @@ Limitations](#issues-and-limitations).
 To build:
 
 ```
-    ${CC} -o prog prog.c -std=c11 -O3 \
-        -Wall -Wextra -pedantic -Wno-missing-prototypes
+    ${CC} -o prog prog.c -std=c11 -O3 -Wall -Wextra -pedantic -Wno-missing-prototypes
 ```
 
 `-Wno-missing-prototypes` is necessary because there aren't any
diff --git a/2018/vokes/index.html b/2018/vokes/index.html
index 67819de1b..aa0aae5f8 100644
--- a/2018/vokes/index.html
+++ b/2018/vokes/index.html
@@ -209,8 +209,7 @@ implementation of counting sort, which sorts each group.
    
 Limitations.
    
 
    Building:
    
 
    To build:
    
-
        ${CC} -o prog prog.c -std=c11 -O3 \
-        -Wall -Wextra -pedantic -Wno-missing-prototypes
    
+
        ${CC} -o prog prog.c -std=c11 -O3 -Wall -Wextra -pedantic -Wno-missing-prototypes
    
 
    -Wno-missing-prototypes is necessary because there aren’t any
 prototypes. (They would put the program well over the size limit.)
    
 
    Note: The program can also be built with -std=c99 or -std=c89.
    
diff --git a/2020/ferguson1/README.md b/2020/ferguson1/README.md
index 9692f24f0..1acbe7693 100644
--- a/2020/ferguson1/README.md
+++ b/2020/ferguson1/README.md
@@ -28,48 +28,48 @@ and non-zero).
 
 ### Variables:
 
-* **WAIT**\
+* **WAIT**
    
 	    	positive or negative integer that changes how long to wait for
 		a key press prior to moving again. < 0 blocks which allows
 		for complete control over movement at your own pace. Default
 		231; you can move faster by holding down or rapidly pressing an
 		arrow key.
 
-* **WALLS**\
+* **WALLS**
    
 	        whether the walls are passable or impassable. Default passable,
 		1; 0 makes walls impassable where you die if you hit a wall.
 
-* **EVADE**\
+* **EVADE**
    
 	        how many movements the Snake moves before the bug (well
 		insect; see notes below about why bugs) will move to
 		another location in the field. Default 300; 0 disables.
 
-* **SIZE**\
+* **SIZE**
    
 	        initial size of the Snake. Note that it grows by one per
 		move so at the default 5 it will not initially be 5
 		characters long! < 0 is likely an immediate win.
 
-* **MAXSIZE**\
+* **MAXSIZE**
    
 	        the maximum size the Snake can become before the game is
 		won. < 0 is the maximum size based on terminal dimensions;
 		any other size will be capped based on the terminal
 		dimensions to prevent problems. Note that when **SIZE+GROW >=
 		MAXSIZE** you win _before_ you grow to the full size!
 
-* **GROW**\
+* **GROW**
    
 	        size to grow every time you eat a bug. Default 5; negative
 		values are allowed. 'Negativity' creates for fun gameplay modes with
 		enough creativity. See [gameplay.html](gameplay.html)
 		GitHub) as well as [play.sh](play.sh) for some examples.
 
-* **SHED**\
+* **SHED**
    
 	        every **SHED** movements you will grow (> 0), shrink (< 0) or
 		stay the same length (0) by the **SHEDS** (below) value. Again
 		with creativity you can create some fun gameplay modes.  NOTE:
 		the concept of shedding in this game is a misnomer; see notes
 		below.
 
-* **SHEDS**\
+* **SHEDS**
    
 	        every **SHED** movements will impact what this value means: grow
 		(> 0), shrink (< 0) or not at all (0). Exception: if the snake
 		eats a bug the counter isn't incremented. Again with creativity
@@ -80,7 +80,7 @@ and non-zero).
 		NOTE: the concept of shedding in this game is a misnomer; see
 		notes below.
 
-* **CANNIBAL**\
+* **CANNIBAL**
    
 	        whether you can go through the Snake or not. Default is 0
 		(cannot - die if you try).
 
@@ -160,7 +160,7 @@ Here are some other features of the game:
 
 *   A drawing/practising mode (**WAIT** < 0 makes `timeout()` block).
 
-*   Computer plays the game (**WAIT=0**).\
+*   Computer plays the game (**WAIT=0**).
    
 	- **EPILEPSY/STIMULATION OVERLOAD WARNING** included in the relevant
 	section (this goes for a low **EVADE** value too).
 
diff --git a/2020/ferguson1/index.html b/2020/ferguson1/index.html
index 1347d77f4..1e8b01773 100644
--- a/2020/ferguson1/index.html
+++ b/2020/ferguson1/index.html
@@ -163,41 +163,41 @@ Location: US - United States of America
 and non-zero).
    
 
    Variables:
    
 
      
-
    • WAIT
      
+
    • WAIT
      
 positive or negative integer that changes how long to wait for
 a key press prior to moving again. < 0 blocks which allows
 for complete control over movement at your own pace. Default
 231; you can move faster by holding down or rapidly pressing an
 arrow key.
      • 
-
    • WALLS
      
+
    • WALLS
      
 whether the walls are passable or impassable. Default passable,
 1; 0 makes walls impassable where you die if you hit a wall.
      • 
-
    • EVADE
      
+
    • EVADE
      
 how many movements the Snake moves before the bug (well
 insect; see notes below about why bugs) will move to
 another location in the field. Default 300; 0 disables.
      • 
-
    • SIZE
      
+
    • SIZE
      
 initial size of the Snake. Note that it grows by one per
 move so at the default 5 it will not initially be 5
 characters long! < 0 is likely an immediate win.
      • 
-
    • MAXSIZE
      
+
    • MAXSIZE
      
 the maximum size the Snake can become before the game is
 won. < 0 is the maximum size based on terminal dimensions;
 any other size will be capped based on the terminal
 dimensions to prevent problems. Note that when SIZE+GROW >=
 MAXSIZE you win before you grow to the full size!
      • 
-
    • GROW
      
+
    • GROW
      
 size to grow every time you eat a bug. Default 5; negative
 values are allowed. ‘Negativity’ creates for fun gameplay modes with
 enough creativity. See gameplay.html
 GitHub) as well as play.sh for some examples.
      • 
-
    • SHED
      
+
    • SHED
      
 every SHED movements you will grow (> 0), shrink (< 0) or
 stay the same length (0) by the SHEDS (below) value. Again
 with creativity you can create some fun gameplay modes. NOTE:
 the concept of shedding in this game is a misnomer; see notes
 below.
      • 
-
    • SHEDS
      
+
    • SHEDS
      
 every SHED movements will impact what this value means: grow
 (> 0), shrink (< 0) or not at all (0). Exception: if the snake
 eats a bug the counter isn’t incremented. Again with creativity
@@ -207,7 +207,7 @@ and then it’s a battle of whether you win by SIZE < 0 or
 SIZE >= MAXSIZE. See play.sh for examples.
 NOTE: the concept of shedding in this game is a misnomer; see
 notes below.
      • 
-
    • CANNIBAL
      
+
    • CANNIBAL
      
 whether you can go through the Snake or not. Default is 0
 (cannot - die if you try).
      • 
 
    
@@ -273,8 +273,7 @@ file modify the behaviour of Snake.
    
 
    Here are some other features of the game:
    
 
      
 
    • A drawing/practising mode (WAIT < 0 makes timeout() block).
      • 
-
    • Computer plays the game (WAIT=0).
      
-
      
+
    • Computer plays the game (WAIT=0).
      
 
        
 
      • EPILEPSY/STIMULATION OVERLOAD WARNING included in the relevant
 section (this goes for a low EVADE value too).
        • 
diff --git a/sitemap.xml b/sitemap.xml
index 809d2de44..3b99e83cb 100644
--- a/sitemap.xml
+++ b/sitemap.xml
@@ -34,7 +34,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1984/anonymous/index.html
-    2024-04-16T23:13:32+00:00
+    2024-04-17T06:12:02+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1984/anonymous/Makefile
@@ -46,7 +46,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1984/anonymous/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:11:52+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1984/decot/1984_decot.tar.bz2
@@ -94,7 +94,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1984/index.html
-    2024-04-16T23:13:07+00:00
+    2024-04-17T01:25:33+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1984/laman/1984_laman.tar.bz2
@@ -290,7 +290,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1985/index.html
-    2024-04-16T23:13:08+00:00
+    2024-04-17T01:25:33+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1985/lycklama/1985_lycklama.tar.bz2
@@ -646,7 +646,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1986/index.html
-    2024-04-16T23:13:08+00:00
+    2024-04-17T01:25:34+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1986/Makefile
@@ -894,7 +894,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/index.html
-    2024-04-16T23:13:42+00:00
+    2024-04-17T06:17:30+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/Makefile
@@ -906,7 +906,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:16:39+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/try.sh
@@ -962,7 +962,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1987/index.html
-    2024-04-16T23:13:08+00:00
+    2024-04-17T01:25:34+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1987/korn/1987_korn.tar.bz2
@@ -1222,7 +1222,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1988/index.html
-    2024-04-16T23:13:09+00:00
+    2024-04-17T01:25:35+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1988/isaak/1988_isaak.tar.bz2
@@ -1402,7 +1402,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1988/robison/index.html
-    2024-04-16T23:13:48+00:00
+    2024-04-17T06:21:28+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1988/robison/Makefile
@@ -1414,7 +1414,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1988/robison/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:21:14+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1988/robison/robison.c
@@ -1578,7 +1578,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1989/index.html
-    2024-04-16T23:13:09+00:00
+    2024-04-17T01:25:35+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1989/jar.1/1989_jar.1.tar.bz2
@@ -2090,7 +2090,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/dds/index.html
-    2024-04-16T23:13:56+00:00
+    2024-04-17T07:17:57+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/dds/LANDER.BAS
@@ -2106,7 +2106,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/dds/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:01:22+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/dg/1990_dg.tar.bz2
@@ -2158,7 +2158,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/index.html
-    2024-04-16T23:13:10+00:00
+    2024-04-17T01:25:36+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/1990_jaw.tar.bz2
@@ -2178,7 +2178,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/index.html
-    2024-04-16T23:13:57+00:00
+    2024-04-17T07:17:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/jaw.c
@@ -2198,7 +2198,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:14:21+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/shark.sh
@@ -2498,7 +2498,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/ant/index.html
-    2024-04-16T23:14:00+00:00
+    2024-04-17T07:18:02+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/ant/Makefile
@@ -2510,7 +2510,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/ant/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:02:43+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/brnstnd/1991_brnstnd.tar.bz2
@@ -2814,7 +2814,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/index.html
-    2024-04-16T23:13:10+00:00
+    2024-04-17T01:25:36+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/Makefile
@@ -2838,7 +2838,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/rince/index.html
-    2024-04-16T23:14:04+00:00
+    2024-04-17T07:18:05+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/rince/Makefile
@@ -2850,7 +2850,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/rince/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:14:33+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/rince/rince.alt2.c
@@ -2886,7 +2886,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/westley/index.html
-    2024-04-16T23:14:04+00:00
+    2024-04-17T07:18:06+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/westley/Makefile
@@ -2898,7 +2898,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/westley/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:05:22+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1991/westley/ttt.alt.sh
@@ -3330,7 +3330,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/index.html
-    2024-04-16T23:13:10+00:00
+    2024-04-17T01:25:37+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/kivinen/1992_kivinen.tar.bz2
@@ -3518,7 +3518,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/vern/index.html
-    2024-04-16T23:14:11+00:00
+    2024-04-17T07:18:12+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/vern/Makefile
@@ -3530,7 +3530,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/vern/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:14:50+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/vern/vern.c
@@ -3554,7 +3554,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/westley/index.html
-    2024-04-16T23:14:11+00:00
+    2024-04-17T07:18:12+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/westley/Makefile
@@ -3566,7 +3566,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/westley/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:06:30+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1992/westley/try.sh
@@ -3834,7 +3834,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1993/index.html
-    2024-04-16T23:13:11+00:00
+    2024-04-17T01:25:37+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1993/jonth/1993_jonth.tar.bz2
@@ -4134,7 +4134,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/index.html
-    2024-04-16T23:14:17+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/Makefile
@@ -4146,7 +4146,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:00:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/try.sh
@@ -4366,7 +4366,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1994/index.html
-    2024-04-16T23:13:11+00:00
+    2024-04-17T01:25:37+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1994/ldb/1994_ldb.tar.bz2
@@ -5006,7 +5006,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1995/index.html
-    2024-04-16T23:13:12+00:00
+    2024-04-17T01:25:38+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1995/leo/1995_leo.tar.bz2
@@ -5022,7 +5022,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1995/leo/index.html
-    2024-04-16T23:14:26+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1995/leo/leo.c
@@ -5042,7 +5042,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1995/leo/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:58:37+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1995/leo/spoiler1.html
@@ -5502,7 +5502,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1996/index.html
-    2024-04-16T23:13:12+00:00
+    2024-04-17T01:25:38+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1996/jonth/1996_jonth.tar.bz2
@@ -6250,7 +6250,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1998/index.html
-    2024-04-16T23:13:13+00:00
+    2024-04-17T01:25:39+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1998/Makefile
@@ -6326,7 +6326,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/index.html
-    2024-04-16T23:14:40+00:00
+    2024-04-17T07:18:40+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/info
@@ -6350,7 +6350,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:07:03+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/schweikh1.alt.c
@@ -6770,7 +6770,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2000/index.html
-    2024-04-16T23:13:13+00:00
+    2024-04-17T01:25:39+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/2000_jarijyrki.tar.bz2
@@ -6970,7 +6970,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2000/robison/index.html
-    2024-04-16T23:14:47+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2000/robison/Makefile
@@ -6982,7 +6982,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2000/robison/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:58:40+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2000/robison/robison.c
@@ -7494,7 +7494,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/index.html
-    2024-04-16T23:14:52+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/Makefile
@@ -7506,7 +7506,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:00:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/try.sh
@@ -7514,7 +7514,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/index.html
-    2024-04-16T23:13:13+00:00
+    2024-04-17T01:25:40+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/jason/2001_jason.tar.bz2
@@ -7738,7 +7738,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/westley/index.html
-    2024-04-16T23:14:56+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/westley/Makefile
@@ -7750,7 +7750,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/westley/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:58:48+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2001/westley/try.sh
@@ -7834,7 +7834,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/index.html
-    2024-04-16T23:14:57+00:00
+    2024-04-17T07:18:57+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/Makefile
@@ -7846,7 +7846,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:07:53+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/try.sh
@@ -8290,7 +8290,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2004/index.html
-    2024-04-16T23:13:14+00:00
+    2024-04-17T01:25:40+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/2004_jdalbec.tar.bz2
@@ -8990,7 +8990,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2005/index.html
-    2024-04-16T23:13:14+00:00
+    2024-04-17T01:25:41+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2005/jetro/2005_jetro.tar.bz2
@@ -9266,7 +9266,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/index.html
-    2024-04-16T23:15:09+00:00
+    2024-04-17T07:19:09+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/kernel-2.901465-03.bin
@@ -9290,7 +9290,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:09:01+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/sykes.c
@@ -9734,7 +9734,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2006/index.html
-    2024-04-16T23:13:15+00:00
+    2024-04-17T01:25:41+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2006/Makefile
@@ -10274,7 +10274,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/index.html
-    2024-04-16T23:15:18+00:00
+    2024-04-17T07:19:18+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/KAYPROII.ZIP
@@ -10290,7 +10290,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:09:12+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/toledo2.alt.c
@@ -11010,7 +11010,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2011/index.html
-    2024-04-16T23:13:15+00:00
+    2024-04-17T01:25:41+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2011/konno/2011_konno.tar.bz2
@@ -11126,7 +11126,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/index.html
-    2024-04-16T23:15:25+00:00
+    2024-04-17T07:19:25+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/keysym.h
@@ -11146,7 +11146,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:09:29+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/toledo.alt2.c
@@ -11582,7 +11582,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/index.html
-    2024-04-16T23:15:28+00:00
+    2024-04-17T07:19:28+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/Makefile
@@ -11594,7 +11594,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:09:39+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/try.sh
@@ -11650,7 +11650,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/index.html
-    2024-04-16T23:15:29+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/Makefile
@@ -11662,7 +11662,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:59:23+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/try.sh
@@ -11790,7 +11790,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/index.html
-    2024-04-16T23:13:16+00:00
+    2024-04-17T01:25:42+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/kang/2012_kang.tar.bz2
@@ -12006,7 +12006,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/index.html
-    2024-04-16T23:15:32+00:00
+    2024-04-17T07:19:32+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/inflate.Blc
@@ -12038,7 +12038,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:10:23+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/symbolic.Blc
@@ -12286,7 +12286,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/birken/index.html
-    2024-04-16T23:15:34+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/birken/ioccc.txt
@@ -12398,7 +12398,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/birken/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T06:59:26+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/birken/rhino.txt
@@ -13574,7 +13574,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/index.html
-    2024-04-16T23:13:16+00:00
+    2024-04-17T01:25:42+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/iocccsize.c
@@ -13766,7 +13766,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/robison/index.html
-    2024-04-16T23:15:41+00:00
+    2024-04-17T07:19:40+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/robison/Makefile
@@ -13778,7 +13778,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/robison/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:10:43+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2013/robison/robison.c
@@ -14054,7 +14054,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2014/index.html
-    2024-04-16T23:13:17+00:00
+    2024-04-17T01:25:43+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2014/iocccsize.c
@@ -14618,7 +14618,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/endoh1/index.html
-    2024-04-16T23:15:49+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/endoh1/ioccc.txt
@@ -14646,7 +14646,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/endoh1/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:00:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/endoh2/2015_endoh2.tar.bz2
@@ -14806,7 +14806,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/hou/index.html
-    2024-04-16T23:15:51+00:00
+    2024-04-17T07:19:50+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/hou/large
@@ -14830,7 +14830,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/hou/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:10:54+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/hou/rfc1321.txt
@@ -14862,7 +14862,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/howe/index.html
-    2024-04-16T23:15:51+00:00
+    2024-04-17T07:19:51+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/howe/Makefile
@@ -14894,7 +14894,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/howe/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:11:02+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/howe/spoiler/err.h
@@ -14918,7 +14918,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/index.html
-    2024-04-16T23:13:17+00:00
+    2024-04-17T01:25:43+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/iocccsize.c
@@ -15142,7 +15142,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/index.html
-    2024-04-16T23:15:53+00:00
+    2024-04-17T07:19:53+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/Makefile
@@ -15162,7 +15162,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:11:22+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/try.sh
@@ -15386,7 +15386,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/index.html
-    2024-04-16T23:15:56+00:00
+    2024-04-17T07:19:55+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/Makefile
@@ -15410,7 +15410,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:11:48+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/scripthd.sh
@@ -15478,7 +15478,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/index.html
-    2024-04-16T23:15:57+00:00
+    2024-04-17T07:19:56+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/iocccbug01.c
@@ -15554,7 +15554,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:12:04+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/results
@@ -15782,7 +15782,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/index.html
-    2024-04-16T23:15:58+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/Makefile
@@ -15810,7 +15810,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:00:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/run.sh
@@ -15850,7 +15850,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/index.html
-    2024-04-16T23:15:59+00:00
+    2024-04-17T07:19:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/Makefile
@@ -15882,7 +15882,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:13:06+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/rpm.html
@@ -16022,7 +16022,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/index.html
-    2024-04-16T23:13:18+00:00
+    2024-04-17T01:25:44+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/iocccsize.c
@@ -16170,7 +16170,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/index.html
-    2024-04-16T23:16:01+00:00
+    2024-04-17T07:20:00+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/ioccc.txt
@@ -16194,7 +16194,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:13:12+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/try.sh
@@ -16822,7 +16822,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2019/index.html
-    2024-04-16T23:13:18+00:00
+    2024-04-17T01:25:44+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2019/iocccsize.c
@@ -16978,7 +16978,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2019/mills/index.html
-    2024-04-16T23:16:08+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2019/mills/IOCCC-hints.cp09_1.809
@@ -17014,7 +17014,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2019/mills/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:00:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2019/mills/Shakespeare.cp04_1.633
@@ -17518,7 +17518,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/index.html
-    2024-04-16T23:16:12+00:00
+    2024-04-17T07:20:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/ioccc-cake.jpg
@@ -17562,7 +17562,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:13:37+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/snake.1
@@ -17622,7 +17622,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/index.html
-    2024-04-16T23:16:13+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/input.txt
@@ -17670,7 +17670,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:00:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/recode.1
@@ -17762,7 +17762,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/index.html
-    2024-04-16T23:13:18+00:00
+    2024-04-17T01:25:44+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/iocccsize.c
@@ -18066,7 +18066,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/tsoj/index.html
-    2024-04-16T23:16:16+00:00
+    2024-04-17T06:57:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/tsoj/Makefile
@@ -18090,7 +18090,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/tsoj/README.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T07:00:58+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/2020/yang/2020_yang.tar.bz2
@@ -18946,7 +18946,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/authors.html
-    2024-04-16T23:13:04+00:00
+    2024-04-17T03:39:54+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/author/Sjoerd_Mullender.json
@@ -19078,11 +19078,11 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/gen-authors.sh
-    2024-04-16T19:14:55+00:00
+    2024-04-17T03:39:46+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/gen-location.sh
-    2024-04-16T19:14:55+00:00
+    2024-04-17T01:42:51+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/gen-other-html.sh
@@ -19098,15 +19098,15 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/gen-top-html.sh
-    2024-04-16T19:14:55+00:00
+    2024-04-17T01:29:11+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/gen-year-index.sh
-    2024-04-16T19:14:55+00:00
+    2024-04-17T01:24:56+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/gen-years.sh
-    2024-04-16T19:14:55+00:00
+    2024-04-17T01:20:43+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/index.html
@@ -19120,10 +19120,6 @@
     https://ioccc-src.github.io/temp-test-ioccc/bin/md2html.sh
     2024-04-16T23:09:56+00:00
 
-
-    https://ioccc-src.github.io/temp-test-ioccc/bin/.md2html.sh.swp
-    2024-04-16T23:11:15+00:00
-
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/output-index-author.sh
     2024-04-16T19:14:55+00:00
@@ -19162,7 +19158,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/status2html.sh
-    2024-04-16T19:14:55+00:00
+    2024-04-17T04:17:20+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bin/subst.default.sh
@@ -19202,11 +19198,11 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bugs.html
-    2024-04-16T23:05:43+00:00
+    2024-04-17T05:36:44+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/bugs.md
-    2024-04-15T23:44:05+00:00
+    2024-04-17T05:38:38+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/CODE_OF_CONDUCT.html
@@ -19218,19 +19214,19 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/contact.html
-    2024-04-16T23:05:43+00:00
+    2024-04-17T06:00:08+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/contact.md
-    2024-04-15T23:42:37+00:00
+    2024-04-17T06:00:03+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/faq.html
-    2024-04-16T23:05:43+00:00
+    2024-04-17T04:47:07+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/faq.md
-    2024-04-15T23:47:35+00:00
+    2024-04-17T04:46:50+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/.gitignore
@@ -19394,11 +19390,11 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/index.html
-    2024-04-16T23:04:22+00:00
+    2024-04-17T05:47:27+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/index.md
-    2024-04-12T18:22:04+00:00
+    2024-04-17T05:47:22+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/ioccc.css
@@ -19418,7 +19414,7 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/location.html
-    2024-04-16T23:13:06+00:00
+    2024-04-17T01:43:00+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/Makefile
@@ -19450,11 +19446,11 @@
 
 
     https://ioccc-src.github.io/temp-test-ioccc/thanks-for-help.html
-    2024-04-16T23:05:46+00:00
+    2024-04-17T05:42:20+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/thanks-for-help.md
-    2024-04-15T23:48:14+00:00
+    2024-04-17T05:42:04+00:00
 
 
     https://ioccc-src.github.io/temp-test-ioccc/.top