fix markdown links to .txt files that use a %%TOKEN%%

2015/burton/road.to.obscurity.html

@@ -570,7 +570,7 @@ relatively tight. But changing around the stable initialization code – by now
 the largest piece of logic – yielded the necessary bytes, and improved
 obscurity by double duty encoding of the operations initialization.</p>
 <p>The utility is now truly functional, and feature complete, and obscure. Without
-<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/burton/src.doc.txt">src.doc.txt</a> (basic documentation of the code structure), and some
+<a href="src.doc.txt">src.doc.txt</a> (basic documentation of the code structure), and some
 commented expanded logic stashed away, and the familiarity I have with the code
 having written and revised it repeatedly, I would not even want to attempt to
 decipher the logic. Many times in the debugging, I was thwarted by my own

2015/burton/road.to.obscurity.md

@@ -243,7 +243,7 @@ the largest piece of logic -- yielded the necessary bytes, and improved
 obscurity by double duty encoding of the operations initialization.
 
 The utility is now truly functional, and feature complete, and obscure.  Without
-[src.doc.txt](%%REPO_URL%%/2015/burton/src.doc.txt) (basic documentation of the code structure), and some
+[src.doc.txt](src.doc.txt) (basic documentation of the code structure), and some
 commented expanded logic stashed away, and the familiarity I have with the code
 having written and revised it repeatedly, I would not even want to attempt to
 decipher the logic.  Many times in the debugging, I was thwarted by my own

2015/burton/spoilers.html

@@ -381,7 +381,7 @@
 <p><code>calc</code> is a recursive-descent parser. It allocates from the stack deep enough
 that all expressions are exhausted before the recursion stack depth reaches the
 allocations. The memory map and source is documented in
-<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/burton/src.doc.txt">src.doc.txt</a>. Tokens are encoded using values 0-20, where 0 is an
+<a href="src.doc.txt">src.doc.txt</a>. Tokens are encoded using values 0-20, where 0 is an
 invalid token, 1 is minus, 2 is space, 3 is plus, etc. The necessary constants
 are derived at the start of the program, using the guarantee that globals are
 initialized to zero; so a correct NULL pointer is obtained from an uninitialized

2015/burton/spoilers.md

@@ -4,7 +4,7 @@
 `calc` is a recursive-descent parser.  It allocates from the stack deep enough
 that all expressions are exhausted before the recursion stack depth reaches the
 allocations.  The memory map and source is documented in
-[src.doc.txt](%%REPO_URL%%/2015/burton/src.doc.txt).  Tokens are encoded using values 0-20, where 0 is an
+[src.doc.txt](src.doc.txt).  Tokens are encoded using values 0-20, where 0 is an
 invalid token, 1 is minus, 2 is space, 3 is plus, etc.  The necessary constants
 are derived at the start of the program, using the guarantee that globals are
 initialized to zero; so a correct NULL pointer is obtained from an uninitialized