Fixes in html files of 1993

1993/ejb/README.md

@@ -11,11 +11,7 @@
     ./ejb level
 ```
 
-where:
-
-``` <!---sh-->
-    level   a value from -128 to 127
-```
+where `level` is a value from `-128` to `127`.
 
 
 ## Try:
@@ -88,8 +84,8 @@ reasonably, however.)
 
 Although this program has only been tested on UNIX systems it will probably run
 on just about any machine with an ANSI C compiler.  It does not use the C
-preprocessor at all.  The only functions it uses are `atoi()`, `malloc()`,
-`memset()`, `printf()`, and `puts()`.  It does, however, require that the
+preprocessor at all.  The only functions it uses are `atoi(3)`, `malloc(3)`,
+`memset(3)`, `printf(3)`, and `puts(3)`.  It does, however, require that the
 architecture it runs on have bytes that are at least eight bits long and
 pointers that are at least four bytes long.  In addition, it requires an ANSI
 compiler since it uses `signed char` and ANSI-style function declarations.

1993/ejb/index.html

@@ -405,8 +405,7 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
 <pre><code>    make all</code></pre>
 <h2 id="to-use">To use:</h2>
 <pre><code>    ./ejb level</code></pre>
-<p>where:</p>
-<pre><code>    level   a value from -128 to 127</code></pre>
+<p>where <code>level</code> is a value from <code>-128</code> to <code>127</code>.</p>
 <h2 id="try">Try:</h2>
 <pre><code>    ./try.sh</code></pre>
 <h2 id="judges-remarks">Judges’ remarks:</h2>
@@ -451,8 +450,8 @@ indented properly. (It is pretty hard to indent this code
 reasonably, however.)</p>
 <p>Although this program has only been tested on UNIX systems it will probably run
 on just about any machine with an ANSI C compiler. It does not use the C
-preprocessor at all. The only functions it uses are <code>atoi()</code>, <code>malloc()</code>,
-<code>memset()</code>, <code>printf()</code>, and <code>puts()</code>. It does, however, require that the
+preprocessor at all. The only functions it uses are <code>atoi(3)</code>, <code>malloc(3)</code>,
+<code>memset(3)</code>, <code>printf(3)</code>, and <code>puts(3)</code>. It does, however, require that the
 architecture it runs on have bytes that are at least eight bits long and
 pointers that are at least four bytes long. In addition, it requires an ANSI
 compiler since it uses <code>signed char</code> and ANSI-style function declarations.</p>

1993/ejb/patience.html

@@ -514,7 +514,7 @@ restoration of ring 1 and the removal of ring 3. This is
 because ring 1 is always movable, and ring 3 is currently
 the second ring still attached to the <code>U</code>. This constraint
 leads to a recursive solution to the puzzle. Like the
-<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/hanoi.md">Towers of Hanoi</a>, the number of steps to solve this puzzle is
+<a href="hanoi.html">Towers of Hanoi</a>, the number of steps to solve this puzzle is
 exponential in the number of rings.</p>
 <hr style="width:10%;text-align:left;margin-left:0">
 <p>Jump to: <a href="#">top</a></p>

1993/ejb/patience.md

@@ -139,7 +139,7 @@ restoration of ring 1 and the removal of ring 3.  This is
 because ring 1 is always movable, and ring 3 is currently
 the second ring still attached to the `U`.  This constraint
 leads to a recursive solution to the puzzle.  Like the
-[Towers of Hanoi](%%REPO_URL%%/1993/ejb/hanoi.md), the number of steps to solve this puzzle is
+[Towers of Hanoi](hanoi.html), the number of steps to solve this puzzle is
 exponential in the number of rings.