cleanup winner README.md files

Fixed cases where there was a bad trailing backslash.

Improved a few cases where a code block was needed
to highlight some text.

Changed a few cases where a code block needed to
declared as, say, a sh code block.

Fixed a few cases where the winner information was not properly formatted.

Plus a few nits and clarifying text was added.

2004/gavin/README.md

@@ -41,7 +41,6 @@ su
 Make a floppy with an ext2 filesystem (`mke2fs /dev/fd0` replacing `fd0` with
 whatever the floppy device is!),  mount it under `/mnt/floppy` and then:
 
-
 ```sh
 cp kernel fs.tar lilo.conf boot.b /mnt/floppy
 ```
@@ -175,7 +174,9 @@ Accesses to data in the string are made relative to the define `V`,
 so these may need updating as appropriate (`0x90200` is the address
 at which a Linux bootloader loads an x86 kernel image).
 
+```
 \* ;-)
+```
 
 
 ## Copyright and CC BY-SA 4.0 License:

2004/hibachi/README.md

@@ -186,12 +186,12 @@ style](https://wiki.c2.com/?OneTrueBraceStyle).
 
 ### Suggested IOCCC Categories
 
-    Best Utility
-    Best Support
-    Most Portable Package
-    Most Likely to Cook Apache
-    Best Interpretation of RFC 2616
-    Winner of The Far Too Much Free Time Award
+* Best Utility
+* Best Support
+* Most Portable Package
+* Most Likely to Cook Apache
+* Best Interpretation of RFC 2616
+* Winner of The Far Too Much Free Time Award
 
 
 ## Copyright and CC BY-SA 4.0 License:

2004/kopczynski/README.md

@@ -135,37 +135,47 @@ numbers from 8 to 11.
 2. We know that [Euler
 characteristics](https://en.wikipedia.org/wiki/Euler_characteristic) is the number of "vertexes"
 
+```
 	    #
+```
 
-   minus the number of "edges"
+minus the number of "edges"
 
+```
 	   ## # #. .#
 	      # .# #.   ('.' must be empty)
+```
 
-   plus the number of "faces"
+plus the number of "faces"
 
+```
 	   ##
 	   ##
+```
 
 3. If we fill all these patterns to 2x2 squares,
 
+```
 	   #? ## #? #. .# ##
 	   ?? ?? #? .# #. ##
 	   +1 -1 -1 -1 -1 +1
+```
 
-   substitute all possible "values" of `?` and sum them up, we get that it is
-   enough to calculate:
+substitute all possible "values" of `?` and sum them up, we get that it is
+enough to calculate:
 
+```
 	   #. .# ##
 	   .. #. #.
 	   +1 -1 -1
+```
 
-   Note now it is simple and obfuscated enough to be used as
-   a "magic trick".
+Note now it is simple and obfuscated enough to be used as
+a "magic trick".
 
 4. I make a 16-character array; when indexed by 4-bit value which
-   represents the 2x2 squares, it will return a number to add/subtract
-   `{-1,0,+1}`
+represents the 2x2 squares, it will return a number to add/subtract
+`{-1,0,+1}`
 
 5. We convert lines of input to bitmaps (`N-bit` integers). Additionally, it is
 heavily obfuscated by using negative numbers (two's complement).  For example,
@@ -180,14 +190,16 @@ we use 15-character string.)
 
 7. Since the rule found in (3) did not produce any funny messages, I changed it until it did. (The `#` character to find vertexes is in the top right corner, not the top left one.) The following messages will also work instead of `has dirtiest IF`:
 
-	   HighlandYachter
-	   TestDirtiestTen
-	   has lintiest IF
-	   TighterLaughter
-	   HustlerDaughter
-	   TighterDemoThen
+```
+HighlandYachter
+TestDirtiestTen
+has lintiest IF
+TighterLaughter
+HustlerDaughter
+TighterDemoThen
+```
 
-   They can be mixed, of course!
+They can be mixed, of course!
 
 8. NOTE: item 8 was removed by the judges so as to not spoil the challenge of
 figuring how arguments can be used to alter the exit value.

2004/newbern/README.md

@@ -40,12 +40,16 @@ This is a configurable banner-like program.
 
 - To convert a character glyph into a data file:
 
-	./newbern char < some_nicely_shaped_text >> data_file
+```sh
+./newbern char < some_nicely_shaped_text >> data_file
+```
 
 
 - To print a string using glyphs from a data file:
 
-	./newbern data_file a_string
+```sh
+./newbern data_file a_string
+```
 
 ### Extra functionality