fix many internal links

Fixed a number of internal links that need to
go to the GitHub site.

Ran `make www` to perform the above.

2015/README.md

@@ -46,7 +46,7 @@ We suggest that you attempt to completely understand the
 [endoh4](endoh4/index.html) 1-liner program: another impressive compact piece of
 C code.
 
-And while you are at it, cat the [endoh2 prog.c](endoh2/prog.c) code.  Compile it
+And while you are at it, cat the [endoh2 prog.c](%%REPO_URL%%/2015/endoh2/prog.c) code.  Compile it
 and look at the source code again.
 
 In a "Back to the Future" moment, [endoh3](endoh3/index.html) gave us a twist on
@@ -77,7 +77,7 @@ Rule 22, now known as **Catch 22** states:
         to be Peter Honeyman, will be grounds for disqualification of your entry.
 ```
 
-A number of other entries were based on [iocccsize.c](iocccsize.c), making
+A number of other entries were based on [iocccsize.c](%%REPO_URL%%/2015/iocccsize.c), making
 derivative works rather than original works.
 
 Still other entries were too large, violating the first line of rule 2:

2015/burton/README.md

@@ -122,7 +122,7 @@ Flow control is by `for` and `return`.  It is `if`-less,  `switch`-less,
 `while`-less, and hopeless. Literally, if not figuratively. ;-)
 
 The code size is intentionally 2015, as stated by `iocccsize -i`, and can be
-reformatted without changes (as in [rule2.c](rule2.c)) to exactly 4096 octets.
+reformatted without changes (as in [rule2.c](%%REPO_URL%%/2015/burton/rule2.c)) to exactly 4096 octets.
 
 Finally, `calc` is interesting, if for no other reason than it is practically
 useful: Hex/decimal conversion, arithmetic, byte-swapping, bit-shifting, and

2015/burton/index.html

@@ -434,7 +434,7 @@ and hex input.</p>
 <p>Flow control is by <code>for</code> and <code>return</code>. It is <code>if</code>-less, <code>switch</code>-less,
 <code>while</code>-less, and hopeless. Literally, if not figuratively. ;-)</p>
 <p>The code size is intentionally 2015, as stated by <code>iocccsize -i</code>, and can be
-reformatted without changes (as in <a href="rule2.c">rule2.c</a>) to exactly 4096 octets.</p>
+reformatted without changes (as in <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/burton/rule2.c">rule2.c</a>) to exactly 4096 octets.</p>
 <p>Finally, <code>calc</code> is interesting, if for no other reason than it is practically
 useful: Hex/decimal conversion, arithmetic, byte-swapping, bit-shifting, and
 logical operations with memory, on the command line, or interactively.</p>

2015/duble/README.md

@@ -69,12 +69,12 @@ wondering if it was not the reason for its very erratic behaviour.
 
 ### [prog.c](%%REPO_URL%%/2015/duble/prog.c) vs [prog.alt.c](%%REPO_URL%%/2015/duble/prog.alt.c)
 
-The file [prog.alt.c](prog.alt.c) is the one I submitted.
+The file [prog.alt.c](%%REPO_URL%%/2015/duble/prog.alt.c) is the one I submitted.
 
 [Gil Dogon](../../authors.html#Gil_Dogon) noted a few unsafe statements (statements
 whose behaviour is undefined in the C standard and, as such, could cause issues
 with other compilers or optimization levels). These have been fixed in
-[prog.c](prog.c).
+[prog.c](%%REPO_URL%%/2015/duble/prog.c).
 
 After this fix, in order to remain rule-2-compliant, a variable name has also
 been shortened in this file.

2015/duble/index.html

@@ -409,11 +409,11 @@ allows to consider each terminal character as a tiny 2x4 bitmap.</p>
 blasphemous. When I was fighting to make this program work, I started
 wondering if it was not the reason for its very erratic behaviour.</p>
 <h3 id="prog.c-vs-prog.alt.c"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/duble/prog.c">prog.c</a> vs <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/duble/prog.alt.c">prog.alt.c</a></h3>
-<p>The file <a href="prog.alt.c">prog.alt.c</a> is the one I submitted.</p>
+<p>The file <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/duble/prog.alt.c">prog.alt.c</a> is the one I submitted.</p>
 <p><a href="../../authors.html#Gil_Dogon">Gil Dogon</a> noted a few unsafe statements (statements
 whose behaviour is undefined in the C standard and, as such, could cause issues
 with other compilers or optimization levels). These have been fixed in
-<a href="prog.c">prog.c</a>.</p>
+<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/duble/prog.c">prog.c</a>.</p>
 <p>After this fix, in order to remain rule-2-compliant, a variable name has also
 been shortened in this file.</p>
 <h3 id="how-to-build">How to build</h3>

2015/endoh1/README.md

@@ -134,7 +134,9 @@ All cells have `(u0, v0)` by default.
 
 You can specify a pattern file when the executable is invoked (not
 compile-time).  The file should include a sequence of points, see
-[ioccc.txt](ioccc.txt), [center.txt](center.txt), or [line.txt](line.txt) as
+[ioccc.txt](%%REPO_URL%%/2015/endoh1/ioccc.txt),
+[center.txt](%%REPO_URL%%/2015/endoh1/center.txt),
+or [line.txt](%%REPO_URL%%/2015/endoh1/line.txt) as
 examples.  Each amount in cells near to the point included in the file, will be
 added by `(u1, v1)`.
 

2015/endoh1/index.html

@@ -461,7 +461,9 @@ notation.</p>
 All cells have <code>(u0, v0)</code> by default.</p>
 <p>You can specify a pattern file when the executable is invoked (not
 compile-time). The file should include a sequence of points, see
-<a href="ioccc.txt">ioccc.txt</a>, <a href="center.txt">center.txt</a>, or <a href="line.txt">line.txt</a> as
+<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/endoh1/ioccc.txt">ioccc.txt</a>,
+<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/endoh1/center.txt">center.txt</a>,
+or <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/endoh1/line.txt">line.txt</a> as
 examples. Each amount in cells near to the point included in the file, will be
 added by <code>(u1, v1)</code>.</p>
 <h4 id="simulation-speed--dtimestepts--dspeedspd">Simulation speed: <code>-DTIMESTEP=ts -DSPEED=spd</code></h4>

2015/endoh3/README.md

@@ -87,7 +87,7 @@ hijack the `main()` function call.  And then it interprets `main()` as an
 instruction sequence.
 
 It supports the minimal subset of instructions and addressing modes which are
-needed for [mullender.c](mullender.c) to work:
+needed for [mullender.c](%%REPO_URL%%/2015/endoh3/mullender.c) to work:
 
 * Instructions
   * BR: branch

2015/endoh3/index.html

@@ -427,7 +427,7 @@ Read it upside down.)</p>
 hijack the <code>main()</code> function call. And then it interprets <code>main()</code> as an
 instruction sequence.</p>
 <p>It supports the minimal subset of instructions and addressing modes which are
-needed for <a href="mullender.c">mullender.c</a> to work:</p>
+needed for <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/endoh3/mullender.c">mullender.c</a> to work:</p>
 <ul>
 <li>Instructions
 <ul>

2015/index.html

@@ -394,7 +394,7 @@ particularly enjoy this entry.</p>
 <p>We suggest that you attempt to completely understand the
 <a href="endoh4/index.html">endoh4</a> 1-liner program: another impressive compact piece of
 C code.</p>
-<p>And while you are at it, cat the <a href="endoh2/prog.c">endoh2 prog.c</a> code. Compile it
+<p>And while you are at it, cat the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/endoh2/prog.c">endoh2 prog.c</a> code. Compile it
 and look at the source code again.</p>
 <p>In a “Back to the Future” moment, <a href="endoh3/index.html">endoh3</a> gave us a twist on
 one of the all time best IOCCC entries from 1984.</p>
@@ -414,7 +414,7 @@ and 22 (one third of 666).</p>
         Identifying yourself, in an obvious way in your code, data, remarks
         or program output, unless you are Peter Honeyman or pretending
         to be Peter Honeyman, will be grounds for disqualification of your entry.</code></pre>
-<p>A number of other entries were based on <a href="iocccsize.c">iocccsize.c</a>, making
+<p>A number of other entries were based on <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/iocccsize.c">iocccsize.c</a>, making
 derivative works rather than original works.</p>
 <p>Still other entries were too large, violating the first line of rule 2:</p>
 <pre><code>    2) The size of your program source must be &lt;= 4096 bytes in length.</code></pre>