Merge pull request #2309 from xexyl/links

1994/shapiro/README.md

@@ -51,7 +51,7 @@ source file is self documenting.  :-)
 From time to time, run `ps(1)` and look at the new processes.
 
 See [shapiro.html](shapiro.html) for more information in the internals of this program.
-The file [shapiro.alt.c](%%REPO_URL%%/1994/shapiro/shapiro.alt.c) contains a non-obfuscated version of
+The file `shapiro.alt.c` contains a non-obfuscated version of
 this program. Note that this alt file is currently missing. See
 [1994 shapiro bugs](../../bugs.html#1994_shapiro) for details.
 
@@ -71,14 +71,14 @@ My entry, [shapiro.c](%%REPO_URL%%/1994/shapiro/shapiro.c), is mostly comments,
 clock. If you strip out the comments and look at the code you will
 quickly realize that the comments were the important part and that
 the code does very little (see pun above). It writes (to `stdout`)
-another C program ([shapiro_t2.c](%%REPO_URL%%/1994/shapiro/shapiro_t2.c). This is the first level of
+another C program (`shapiro_t2.c`). This is the first level of
 obfuscation.
 
-The second program ([shapiro_t2.c](%%REPO_URL%%/1994/shapiro/shapiro_t2.c) (use `make everything` first)
-prints a clock in the upper right hand corner of your VTxxx/ANSI display.
+The second program (`shapiro_t2.c`) prints a clock in the upper right hand
+corner of your VTxxx/ANSI display.
 
 Most of the surface obfuscation in the second program,
-[shapiro_t2.c](%%REPO_URL%%/1994/shapiro/shapiro_t2.c), was an attempt to make it as small as possible.
+`shapiro_t2.c`, was an attempt to make it as small as possible.
 You should be able to see around this with `cb(1)` and some more intelligent
 variable names.  Once you get past this you will realize that the third level of
 obfuscation is a six member client/server hierarchy.  (See the

1994/shapiro/index.html

@@ -421,7 +421,7 @@ bring it back to the foreground.</p>
 source file is self documenting. :-)</p>
 <p>From time to time, run <code>ps(1)</code> and look at the new processes.</p>
 <p>See <a href="shapiro.html">shapiro.html</a> for more information in the internals of this program.
-The file <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/shapiro/shapiro.alt.c">shapiro.alt.c</a> contains a non-obfuscated version of
+The file <code>shapiro.alt.c</code> contains a non-obfuscated version of
 this program. Note that this alt file is currently missing. See
 <a href="../../bugs.html#1994_shapiro">1994 shapiro bugs</a> for details.</p>
 <h2 id="authors-remarks">Author’s remarks:</h2>
@@ -432,12 +432,12 @@ this program. Note that this alt file is currently missing. See
 clock. If you strip out the comments and look at the code you will
 quickly realize that the comments were the important part and that
 the code does very little (see pun above). It writes (to <code>stdout</code>)
-another C program (<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/shapiro/shapiro_t2.c">shapiro_t2.c</a>. This is the first level of
+another C program (<code>shapiro_t2.c</code>). This is the first level of
 obfuscation.</p>
-<p>The second program (<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/shapiro/shapiro_t2.c">shapiro_t2.c</a> (use <code>make everything</code> first)
-prints a clock in the upper right hand corner of your VTxxx/ANSI display.</p>
+<p>The second program (<code>shapiro_t2.c</code>) prints a clock in the upper right hand
+corner of your VTxxx/ANSI display.</p>
 <p>Most of the surface obfuscation in the second program,
-<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/shapiro/shapiro_t2.c">shapiro_t2.c</a>, was an attempt to make it as small as possible.
+<code>shapiro_t2.c</code>, was an attempt to make it as small as possible.
 You should be able to see around this with <code>cb(1)</code> and some more intelligent
 variable names. Once you get past this you will realize that the third level of
 obfuscation is a six member client/server hierarchy. (See the

1994/weisberg/README.md

@@ -77,7 +77,8 @@ event of a system shutdown or reboot.
 
 ### Bugs
 
-The alternative version ([weisberg.alt.c](%%REPO_URL%%/1994/weisberg/weisberg.alt.c) source) has never actually run
+The alternative version ([weisberg.c](%%REPO_URL%%/1994/weisberg/weisberg.c)
+compiled to `weisberg.alt`) has never actually run
 to completion. After running for close to a week it had reached somewhere around
 250e6, when it became necessary to test the reboot feature (which worked
 remarkably well). As there are quite a lot of primes to be found before reaching

1994/weisberg/index.html

@@ -431,7 +431,8 @@ run to completion, so as an added feature, it will cease execution upon
 reception of a signal (any will do equally well), as well as in the
 event of a system shutdown or reboot.</p>
 <h3 id="bugs">Bugs</h3>
-<p>The alternative version (<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/weisberg.alt.c">weisberg.alt.c</a> source) has never actually run
+<p>The alternative version (<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/weisberg.c">weisberg.c</a>
+compiled to <code>weisberg.alt</code>) has never actually run
 to completion. After running for close to a week it had reached somewhere around
 250e6, when it became necessary to test the reboot feature (which worked
 remarkably well). As there are quite a lot of primes to be found before reaching

1995/vanschnitz/README.md

@@ -120,7 +120,7 @@ solution wherein the disks end up on peg 2; for an even
 number of disks, they will end on peg 3.  This should
 provide some hint as to what sort of algorithm is used.
 
-We have included a [spoiler](%%REPO_URL%%/1995/vanschnitz/spoiler.c) version of the program, with
+We have included a [spoiler](%%REPO_URL%%/1995/vanschnitz/vanschnitz.alt.c) version of the program, with
 meaningful symbol names and comments, but we encourage you
 to try to decipher the program without it...
 
@@ -204,7 +204,6 @@ to try to decipher the program without it...
     end
 ```
 
-
 <!--
 
     Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved.

1995/vanschnitz/index.html

@@ -470,7 +470,7 @@ the resulting program (on a Unix system) is to do the command</p>
 solution wherein the disks end up on peg 2; for an even
 number of disks, they will end on peg 3. This should
 provide some hint as to what sort of algorithm is used.</p>
-<p>We have included a <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/vanschnitz/spoiler.c">spoiler</a> version of the program, with
+<p>We have included a <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/vanschnitz/vanschnitz.alt.c">spoiler</a> version of the program, with
 meaningful symbol names and comments, but we encourage you
 to try to decipher the program without it…</p>
 <pre><code>    begin 444 spoiler.c