Merge pull request #2308 from xexyl/links

Fix links in several entries

1988/applin/README.md

@@ -40,7 +40,8 @@ Dhyrstone/sec/cpu machine) using the System V `cpp`.  (The GNU `cpp` when define
 `BIG_CPP` took only 45 seconds.)
 
 Your `cpp` may not be able to compile it due to a common bug that results in
-`cpp` running out of space.  The routine [zsmall](%%REPO_URL%%/1988/applin/zsmall.c) is a smaller version
+`cpp` running out of space.  The routine
+[zsmall](%%REPO_URL%%/1988/applin/applin.alt.c) is a smaller version
 of the [applin.c](%%REPO_URL%%/1988/applin/applin.c) entry.
 
 

1988/applin/index.html

@@ -417,7 +417,8 @@ with this entry.</p>
 Dhyrstone/sec/cpu machine) using the System V <code>cpp</code>. (The GNU <code>cpp</code> when defined as
 <code>BIG_CPP</code> took only 45 seconds.)</p>
 <p>Your <code>cpp</code> may not be able to compile it due to a common bug that results in
-<code>cpp</code> running out of space. The routine <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1988/applin/zsmall.c">zsmall</a> is a smaller version
+<code>cpp</code> running out of space. The routine
+<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1988/applin/applin.alt.c">zsmall</a> is a smaller version
 of the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1988/applin/applin.c">applin.c</a> entry.</p>
 <h2 id="judges-remarks">Judges’ remarks:</h2>
 <p>This entry is by far the most unusual abuse of the C preprocessor that

1990/theorem/README.md

@@ -45,7 +45,7 @@ where:
 The program's source implements four functions, all from the
 same source file!
 
-When you compile [theorem.c](%%REPO_URL%%/1990/theorem/Rtheorem.c) as is and run with 5 args, it
+When you compile [theorem.c](%%REPO_URL%%/1990/theorem/theorem.c) as is and run with 5 args, it
 numerically solves the equation `y'=f(x,y)`, with a step size of `h` (see above
 usage), over the interval `x=[x1,x2]`, with the initial condition of `y(x1)=y1`.
 

1990/theorem/index.html

@@ -416,7 +416,7 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
 <h2 id="judges-remarks">Judges’ remarks:</h2>
 <p>The program’s source implements four functions, all from the
 same source file!</p>
-<p>When you compile <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/Rtheorem.c">theorem.c</a> as is and run with 5 args, it
+<p>When you compile <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/theorem.c">theorem.c</a> as is and run with 5 args, it
 numerically solves the equation <code>y'=f(x,y)</code>, with a step size of <code>h</code> (see above
 usage), over the interval <code>x=[x1,x2]</code>, with the initial condition of <code>y(x1)=y1</code>.</p>
 <p>The ‘expression’ <code>f(x,y)</code> is any function of <code>x</code> and <code>y</code> with the

1992/albert/README.md

@@ -56,8 +56,8 @@ judges this Email message:
     the first factor is 101 and is usually found in an instant.
 ```
 
-The [albert.alt.c](%%REPO_URL%%/1992/albert/albert.c) file is the fixed file, whereas the
+The [albert.alt.c](%%REPO_URL%%/1992/albert/albert.alt.c) file is the fixed file, whereas the
-[albert.c](%%REPO_URL%%/1992/albert/1992/albert/lbert.c) is the file before applying Leo Broukhis' fix.
+[albert.c](%%REPO_URL%%/1992/albert/albert.c) is the file before applying Leo Broukhis' fix.
 
 
 ### Alternate build:

1992/albert/index.html

@@ -426,8 +426,8 @@ judges this Email message:</p>
     I&#39;ve found a number exposing another bug: 10000000001 (that&#39;s 9 0&#39;s).
     Both albert and albert.orig loop without printing anything, although
     the first factor is 101 and is usually found in an instant.</code></pre>
-<p>The <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.c">albert.alt.c</a> file is the fixed file, whereas the
+<p>The <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.alt.c">albert.alt.c</a> file is the fixed file, whereas the
-<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/1992/albert/lbert.c">albert.c</a> is the file before applying Leo Broukhis’ fix.</p>
+<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.c">albert.c</a> is the file before applying Leo Broukhis’ fix.</p>
 <h3 id="alternate-build">Alternate build:</h3>
 <p>To compile this alternate version:</p>
 <pre><code>    make alt</code></pre>

1992/ant/README.md

@@ -35,7 +35,7 @@ P1003 subcommittee.
 
 ## Author's remarks:
 
-See the file [ant.README.txt](%%REPO_URL%%/1992/ant/ant.README).
+See the file [ant.README.txt](%%REPO_URL%%/1992/ant/ant.README.txt).
 
 
 <!--

1992/ant/index.html

@@ -413,7 +413,7 @@ figure out where.</p>
 Interested POSIX balloters should lobby the IEEE for an obfuscated
 P1003 subcommittee.</p>
 <h2 id="authors-remarks">Author’s remarks:</h2>
-<p>See the file <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/ant/ant.README">ant.README.txt</a>.</p>
+<p>See the file <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/ant/ant.README.txt">ant.README.txt</a>.</p>
 <!--
 
     Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved.

2020/ferguson2/recode.html

@@ -409,8 +409,8 @@ have to if you don’t wish to.</p>
 <div id="recode">
 <h1 id="what-is-recode-and-why-is-it-recommended"><a href="#toc">What is recode and why is it recommended?</a></h1>
 </div>
-<p>To demonstrate how to and why you should use the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson1/recode.c">recode.c</a> program with
+<p>To demonstrate how to and why you should use the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a> program with
-the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson1/prog.c">Enigma machine simulator</a> I have included some examples here as
+the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/prog.c">Enigma machine simulator</a> I have included some examples here as
 well as brief (‘brief?!’ I am sure many would think but it’s brief for me)
 commentary.</p>
 <p>It would not be possible to do all that the recode program does in my entry
@@ -482,7 +482,7 @@ Again note that this does not validate input! Although it detects out of range
 for the arrays it doesn’t detect duplicates. This is because it wasn’t meant to
 be any given file or anything else other than the direct output of a previous
 run (thus validated). I’m not even guaranteeing that I got the array tests valid
-in <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson1/recode.c">recode.c</a> <code>-R</code> option!</p>
+in <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c">recode.c</a> <code>-R</code> option!</p>
 <div id="samefile">
 <h2 id="protecting-against-the-same-io-file"><a href="#toc">Protecting against the same I/O file</a></h2>
 </div>
@@ -798,7 +798,7 @@ delicious challenge).</p>
 <h1 id="example-additions"><a href="#toc">Example additions</a></h1>
 </div>
 <ul>
-<li>Add code, to <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson1/prog.c">prog.c</a>, that tries to determine possible decipherments based on
+<li>Add code, to <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/prog.c">prog.c</a>, that tries to determine possible decipherments based on
 a given crib (or set of cribs).</li>
 </ul>
 <div id="exampleuses">

2020/ferguson2/recode.md

@@ -30,8 +30,8 @@ have to if you don't wish to.
 # <a href="#toc">What is recode and why is it recommended?</a>
 </div>
 
-To demonstrate how to and why you should use the [recode.c](%%REPO_URL%%/2020/ferguson1/recode.c) program with
+To demonstrate how to and why you should use the [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) program with
-the [Enigma machine simulator](%%REPO_URL%%/2020/ferguson1/prog.c) I have included some examples here as
+the [Enigma machine simulator](%%REPO_URL%%/2020/ferguson2/prog.c) I have included some examples here as
 well as brief ('brief?!' I am sure many would think but it's brief for me)
 commentary.
 
@@ -128,7 +128,7 @@ Again note that this does not validate input! Although it detects out of range
 for the arrays it doesn't detect duplicates. This is because it wasn't meant to
 be any given file or anything else other than the direct output of a previous
 run (thus validated). I'm not even guaranteeing that I got the array tests valid
-in [recode.c](%%REPO_URL%%/2020/ferguson1/recode.c) `-R` option!
+in [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) `-R` option!
 
 
 <div id="samefile">
@@ -550,7 +550,7 @@ delicious challenge).
 # <a href="#toc">Example additions</a>
 </div>
 
-*   Add code, to [prog.c](%%REPO_URL%%/2020/ferguson1/prog.c), that tries to determine possible decipherments based on
+*   Add code, to [prog.c](%%REPO_URL%%/2020/ferguson2/prog.c), that tries to determine possible decipherments based on
 a given crib (or set of cribs).