Get 1989 entries to compile

There were some which cannot be compiled under clang. One entry we used
a patch from Yusuke Endoh to get the entry to compile; thank you Yusuke
for your assistance! Another one we used a patch from Yusuke (thank
you!) but I further fixed it so that it would work with clang. It had to
be done: IOCCC Tetris has to work! This was done by changing the
environment arg to main() to be a char * in main() itself rather than a
char **. Using a char ** in main() third arg got it to compile but only
one key worked with clang so I changed it to be not the third argument
but a regular char * in main(). **a (third arg) evaluated correctly but
*a[1] and onward was actually part of the environment. Again IOCCC
Tetris has to work!

I also fixed fubar to work which took a few tweaks.

README.md files were also updated.

1989/ovdluhe/README.md

@@ -1,4 +1,4 @@
-Most humorous output:
+## Most humorous output:
 
 	Oskar von der Luehe
 	Institut fuer Astronomie
@@ -6,40 +6,45 @@ Most humorous output:
 	8092 Zuerich
 	Switzerland
 
-Judges notes:
+## To build:
 
-	Run this program using your favorite text file as input.  Files
-	such as mailboxes, man pages and usenet articles are especially
-	recommended.  You will get different output each time you run it.
+	make all
 
-	Run the program this way:
+To get this to compile with a modern CPP, we had to replace `#D` with `#define`.
 
-		ovdluhe < textfile
+## Judges' comments:
 
-	The program stops when it reaches the end of the template buffer 
-	by chance or is killed.
+Run this program using your favorite text file as input.  Files
+such as mailboxes, man pages and usenet articles are especially
+recommended.  You will get different output each time you run it.
 
-	To have a chance to compile under a modern CPP, we had to
-	replace `#D` with `#define`.
+Run the program this way:
 
-Selected notes from the author:
+	ovdluhe < textfile
 
-	This program implements an "Eddington ape" - it generates
-	random text from a supplied template.  The template text file
-	is read through stdin.  The larger the template, the better the
-	result.  A maximum of 2**12 chars are used. From the template,
-	the program calculates the statistics of chars that immediately
-	follow a given string (correlator string) of a certain length
-	(currently 4 - can be varied by changing the definition for P
-	accordingly).  A character is randomly chosen, weighted by its
-	probability to occur after the correlator string.  That
-	character is printed to stdout and placed at the end of the
-	correlator string, whose first character is discarded.
-	Meaningful words are therefore usually preserved, the effect on
-	sentences can be dramatically random.
+The program stops when it reaches the end of the template buffer 
+by chance or is killed.
 
-	You might want to vary the definition of P between 2 and 10 and
-	observe the result.
+
+
+## Selected notes from the author:
+
+This program implements an "Eddington ape" - it generates
+random text from a supplied template.  The template text file
+is read through stdin.  The larger the template, the better the
+result.  A maximum of `2**12` chars are used. From the template,
+the program calculates the statistics of chars that immediately
+follow a given string (correlator string) of a certain length
+(currently 4 - can be varied by changing the definition for P
+accordingly).  A character is randomly chosen, weighted by its
+probability to occur after the correlator string.  That
+character is printed to stdout and placed at the end of the
+correlator string, whose first character is discarded.
+Meaningful words are therefore usually preserved, the effect on
+sentences can be dramatically random.
+
+You might want to vary the definition of P between 2 and 10 and
+observe the result.
 
 Copyright (c) 1989, Landon Curt Noll & Larry Bassel.
 All Rights Reserved.  Permission for personal, educational or non-profit use is