Format and link fix in 2001/jason

His URL was dead but I found via the Internet Wayback Machine a blog. He
hasn't really updated it (one entry this year) since I think it was 2021
but it's better than what it went to before. He might be on GitHub with
the same handle but I haven't confirmed it so I won't link to it. The
URL was updated in winners.html and winners.csv.

Format fix README.md.

2001/jason/README.md

@@ -1,11 +1,10 @@
 # Best Of Show
 
-    Jason Orendorff
+Jason Orendorff
-    5 Buchanan St.
+5 Buchanan St.
-    Nashua, NH 03060
+Nashua, NH 03060
-    US
+US
-
+<http://jorendorff.blogspot.com>
-    http://www.jorendorff.com/
 
 ## To build:
 
@@ -44,27 +43,30 @@ Of particular interest:  Go ahead, run it through the preprocessor.  You
 TED Shroyer came up with the idea that made it possible to hide all
 the text.  Thanks, TED.  You won.  :)
 
-
+```sh
-$ cc -o prog prog.c
+$ cc -o jason jason.c
-$ ./prog
+$ ./jason
 you are in a maze of twisty little passages
 caves lead:  left forward back
 you see
    a lamp
 > _
 
+```
+
 This program is a rather nostalgic little labyrinth game.  Start
-out by typing "get lamp", then use the direction words "left",
+out by typing "`get lamp`", then use the direction words "`left`",
-"right", "forward", and "back" to explore the caves.  Note that
+"`right`", "`forward`", and "`back`" to explore the caves.  Note that
 these words can refer to different passages depending on which way
-you're facing.  "back" always takes you back the way you came.
+you're facing.  "`back`" always takes you back the way you came.
 Type "quit" to quit.
 
 The maze is randomly generated each time you play.  The algorithm
 ensures that you start at least 6 hops away from the exit.  All
 passages are two-way.
 
-(There is a trick, well-known among adventure game fans, to
+(There is a trick, well-known among
+[Adventure](https://en.wikipedia.org/wiki/Colossal_Cave_Adventure) game fans, to
 keeping one's bearings in games like this.  Unless you know the
 trick, it can be very difficult to find your way around.  Try it
 out first; I'll give away the secret at the bottom of this
@@ -79,10 +81,10 @@ points per item, and bonus points for speed.
 
 Why I think this program is obfuscated:
 
-* 70% more # symbols than the average entry.
+* 70% more `#` symbols than the average entry.
 
 * Where are all the messages?  The game is downright chatty for
-  only having two string literals ("%d \n" and "Y\n : ! ,.?>").
+  only having two string literals (`"%d \n"` and `"Y\n : ! ,.?>"`).
 
 * There is exactly one loop in the program, a for loop, and it is
   clearly the product of a deranged mind.  Running the
@@ -98,13 +100,13 @@ Why I think this program is obfuscated:
 
 * Attempts to replace the one-character identifiers with longer,
   more meaningful names will likewise cause problems.  In fact,
-  simply changing all the Y's to Z's and vice versa results in
+  simply changing all the `Y`s to `Z`s and vice versa results in
   some unexpected side effects.
 
 When all warnings are enabled, some compilers express the desire
 to see a few more parentheses.  I respectfully submit that there are
 plenty of parentheses in the program (370 in all.)  Besides, any
-more would put me over the size limit.  gcc also generates a
+more would put me over the size limit.  `gcc` also generates a
 warning about some calculations not being used.  Having just spent
 19 hours staring at this program, sweating over every character, I
 swear gcc is wrong.
@@ -114,8 +116,10 @@ I find the plaintive chorus "B?  B?" particularly poignant.
 Also, smiley faces are formatted flush left.  (If you don't find
 the game entertaining, see if you can find
 
+```
     the fish scales              Q)++j<
     the shooting star         -~- ~ -~i +
+```
 
 in the source code.)
 
@@ -125,9 +129,11 @@ in the source code.)
 
 
 
-[GAME STRATEGY SPOILER:  The trick, of course, is to drop items in
+### GAME STRATEGY SPOILER
-empty rooms to mark them.  That way you usually know if you're in a
+
-room you've seen before.  It greatly aids mapping.]
+The trick, of course, is to drop items in empty rooms to mark them.  That way
+you usually know if you're in a room you've seen before.  It greatly aids
+mapping.
 
 ## Copyright and CC BY-SA 4.0 License:
 

tmp/winners.csv

@@ -91,7 +91,7 @@ James A. Woods,James_A._Woods,null,null,null,null,null);
 James Bonfield,James_Bonfield,null,null,jkb@mrc-lmb.cam.ac.uk,null,null);
 Jan Stein,Jan_Stein,null,null,null,null,null);
 Jari Arkko,Jari_Arkko,http://www.arkko.com,null,jari@arkko.com,null,null);
-Jason Orendorff,Jason_Orendorff,http://www.jorendorff.com/,null,jason@jorendorff.com,null,null);
+Jason Orendorff,Jason_Orendorff,http://jorendorff.blogspot.com,jason@jorendorff.com,US,null);
 Jay Vosburgh,Jay_Vosburgh,null,null,fubar@sequent.com,null,null);
 Jeff Newbern,Jeff_Newbern,null,null,jnewbern@yahoo.com,null,null);
 Jeff Weisberg,Jeff_Weisberg,http://www.op.net/~jaw,null,jaw@op.net,null,null);

winners.html

@@ -924,7 +924,7 @@ Contest </I></FONT></CENTER><BR>
 <LI TYPE=square>Best Of Show (<A HREF="years.html#2001_ollinger">2001 ollinger</A>)
 </UL><BR>
 
-<LI TYPE=none><A NAME="Jason_Orendorff"></A><B><a href="&#x6D;&#97;&#105;lt&#111;&#x3A;&#x6A;a&#115;&#111;&#x6E;&#64;&#x6A;&#x6F;&#x72;&#101;&#x6E;&#100;&#111;&#x72;&#102;&#x66;.&#99;&#111;&#x6D;">Jason Orendorff</a></B> -- <A HREF="http://www.jorendorff.com/">http://www.jorendorff.com/</a>
+<LI TYPE=none><A NAME="Jason_Orendorff"></A><B><a href="&#x6D;&#97;&#105;lt&#111;&#x3A;&#x6A;a&#115;&#111;&#x6E;&#64;&#x6A;&#x6F;&#x72;&#101;&#x6E;&#100;&#111;&#x72;&#102;&#x66;.&#99;&#111;&#x6D;">Jason Orendorff</a></B> -- <A HREF="http://jorendorff.blogspot.com">http://jorendorff.blogspot.com</a>
 <UL>
 <LI TYPE=square>Best Of Show (<A HREF="years.html#2001_jason">2001 jason</A>)
 </UL><BR>