1995 entries checked

Fixed formatting of README.md files.

Some typo fixes.

All entries work well.

Added some try commands.

1995/savastio/README.md

@@ -10,43 +10,46 @@
 
         make all
 
-### To run
+## To run:
 
 	./savastio
+	# enter a number such as 100
 
-	NOTE: enter a number (such as 100).
+## Try:
 
-## Judges' comments
+	echo 42 | ./savastio
 
-    I know an l when I see a 1.
+## Judges' comments:
 
-## Author's comments
+I know an l when I see a 1.
 
-    This program is an infinite-precision factorial calculator.  It will
-    compute the factorial of any number entered to an infinite degree of
-    precision (or the limits of your machine's memory, whichever comes
-    first).  I'd suggest you start with small numbers the first few times
-    you run it and gradually work your way up in order to get a feel for
-    the computation time your machine will require.
+## Author's comments:
 
-    Aside from having an artistic code layout and confusing variable names,
-    the algorithm itself takes advantage of some cute C-isms.  Try to
-    figure out how it prints the prompt "Enter number:".
+This program is an infinite-precision factorial calculator.  It will
+compute the factorial of any number entered to an infinite degree of
+precision (or the limits of your machine's memory, whichever comes
+first).  I'd suggest you start with small numbers the first few times
+you run it and gradually work your way up in order to get a feel for
+the computation time your machine will require.
 
-    Numbers are represented internally by a linked list of blocks each
-    containing 1000 buckets of 4-digit integers.  To further confuse
-    matters, the buckets are arranged backwards in the block.  For example,
-    the number 8347108947139478934713847134 is represented as:
+Aside from having an artistic code layout and confusing variable names,
+the algorithm itself takes advantage of some cute C-isms.  Try to
+figure out how it prints the prompt "Enter number:".
+
+Numbers are represented internally by a linked list of blocks each
+containing 1000 buckets of 4-digit integers.  To further confuse
+matters, the buckets are arranged backwards in the block.  For example,
+the number 8347108947139478934713847134 is represented as:
 
        7134 1384 9347 3947 9471 7108 834
 
-    Platform limitations:
+Platform limitations:
 
-    Long integers must be at least 4 bytes.
+Long integers must be at least 4 bytes.
 
-    Features:
+### Features
 
-    In order to prevent the user from wasting too much time computing
-    useless factorials, the maximum factorial that can be computed is
-    429539!  This limit was selected through extensive research in
-    time management studies and the factorial arts.
+In order to prevent the user from wasting too much time computing
+useless factorials, the maximum factorial that can be computed is
+429539!  This limit was selected through extensive research in
+time management studies and the factorial arts.