mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

change years.html#entry_id links to entry's index.html page

Browse Source
This commit is contained in:
Landon Curt Noll committed 2024-04-21 17:11:14 -07:00
1 parent ab95fdcfb5
commit 83a24fd01f
10 files changed
+106 -105
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2015/mills2/README.md
+1 -1
View File
@@ -33,7 +33,7 @@ For more detailed information see [2015 mills2 bugs](../../bugs.html#2015_mills2
## Judges' remarks:
Without ASCII art, the source code of this entry would have been exactly 256
bytes. Compared to [1990/jaw](../../years.html#1990_jaw), it is very
bytes. Compared to [1990/jaw](../../1990/jaw/index.html), it is very
impressive, even taking into account the missing `atob` functionality. Now we wish
for a `compress(1)`-like compressor using a similar idea.
2015/mills2/index.html
+1 -1
View File
@@ -164,7 +164,7 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
<pre><code> ./try.sh</code></pre>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>Without ASCII art, the source code of this entry would have been exactly 256
bytes. Compared to <a href="../../years.html#1990_jaw">1990/jaw</a>, it is very
bytes. Compared to <a href="../../1990/jaw/index.html">1990/jaw</a>, it is very
impressive, even taking into account the missing <code>atob</code> functionality. Now we wish
for a <code>compress(1)</code>-like compressor using a similar idea.</p>
<p>Why is the sad smiley on line 12 in that particular place?</p>
2018/burton1/README.md
+1 -1
View File
@@ -60,7 +60,7 @@ This code has been compiled and tested on:
* X86-Linux, gcc 4.1.2 and 4.8.4, -O0 and -O3
* ARM-QEMU, gcc 4.8.4, -O0 and -O3
* X86-FreeBSD 10.3, clang 3.4.1, -O0 and -O3
* TCC 0.9.26 (x86-64) (used as a proxy for [2001/bellard](../../years.html#2001_bellard))
* TCC 0.9.26 (x86-64) (used as a proxy for [2001/bellard](../../2001/bellard/index.html))
* UNIX V7 pcc (Johnson's C compiler) on a [simulated PDP-11/45](http://simh.trailing-edge.com/)
(see spoiler for further detail)
2018/burton1/index.html
+1 -1
View File
@@ -181,7 +181,7 @@ It adds several nice-to-have features, and allows salt-to-taste customizability.
<li>X86-Linux, gcc 4.1.2 and 4.8.4, -O0 and -O3</li>
<li>ARM-QEMU, gcc 4.8.4, -O0 and -O3</li>
<li>X86-FreeBSD 10.3, clang 3.4.1, -O0 and -O3</li>
<li>TCC 0.9.26 (x86-64) (used as a proxy for <a href="../../years.html#2001_bellard">2001/bellard</a>)</li>
<li>TCC 0.9.26 (x86-64) (used as a proxy for <a href="../../2001/bellard/index.html">2001/bellard</a>)</li>
<li>UNIX V7 pcc (Johnson’s C compiler) on a <a href="http://simh.trailing-edge.com/">simulated PDP-11/45</a>
(see spoiler for further detail)</li>
</ul>
2019/README.md
+2 -2
View File
@@ -34,8 +34,8 @@ vocabulary!
There are again nods to entries of the years:
[1991/davidguy](../years.html#1991_davidguy)
[2011/blakely](../years.html#2011_blakely)
* [1991/davidguy](../1991/davidguy/index.html)
* [2011/blakely](../2011/blakely/index.html)
These nods to not run afoul of the guideline:
2019/dogon/README.md
+2 -2
View File
@@ -35,8 +35,8 @@ the program and the script.
## Judges' remarks:
[1991/davidguy](../../years.html#1991_davidguy),
[2011/blakely](../../years.html#2011_blakely), ...
[1991/davidguy](../../1991/davidguy/index.html),
[2011/blakely](../../2011/blakely/index.html), ...
...This entry likely concludes the IOCCC category "Cellular automata simulators";
it would be very hard to beat it on its field.
2019/dogon/index.html
+2 -2
View File
@@ -165,8 +165,8 @@ Location: <a href="../../location.html#IL">IL</a> - <em>State of Israel</em> (<e
<p>Make sure that you keep focus of windows in mind when going back and forth to
the program and the script.</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p><a href="../../years.html#1991_davidguy">1991/davidguy</a>,
<a href="../../years.html#2011_blakely">2011/blakely</a>, …</p>
<p><a href="../../1991/davidguy/index.html">1991/davidguy</a>,
<a href="../../2011/blakely/index.html">2011/blakely</a>, …</p>
<p>…This entry likely concludes the IOCCC category “Cellular automata simulators”;
it would be very hard to beat it on its field.</p>
<p>FYI: The <code>.mc</code> extension stands for <code>Golly macrocell</code> format.</p>
2019/index.html
+4 -2
View File
@@ -159,8 +159,10 @@ a way it produces its own text!</p>
<p>The <a href="ciura/index.html">“Most likely to be awarded” (ciura)</a> has an amazing
vocabulary!</p>
<p>There are again nods to entries of the years:</p>
<pre><code>[1991/davidguy](../years.html#1991_davidguy)
[2011/blakely](../years.html#2011_blakely)</code></pre>
<ul>
<li><a href="../1991/davidguy/index.html">1991/davidguy</a></li>
<li><a href="../2011/blakely/index.html">2011/blakely</a></li>
</ul>
<p>These nods to not run afoul of the guideline:</p>
<pre><code> We tend to dislike programs that:
...
faq.html
+46 -46
View File
@@ -304,71 +304,71 @@ state something along the lines of:</p>
</blockquote>
<h4 id="maze-generator">maze generator</h4>
<ul>
<li><a href="years.html#1985_shapiro">1985/shapiro</a></li>
<li><a href="years.html#1991_buzzard">1991/buzzard</a></li>
<li><a href="years.html#1995_cdua">1995/cdua</a></li>
<li><a href="years.html#1995_dodsond2">1995/dodsond2</a></li>
<li><a href="years.html#1998_bas1">1998/bas1</a></li>
<li><a href="1985/shapiro/index.html">1985/shapiro</a></li>
<li><a href="1991/buzzard/index.html">1991/buzzard</a></li>
<li><a href="1995/cdua/index.html">1995/cdua</a></li>
<li><a href="1995/dodsond2/index.html">1995/dodsond2</a></li>
<li><a href="1998/bas1/index.html">1998/bas1</a></li>
</ul>
<h4 id="tic-tac-toenoughts-and-crossesxs-and-os-game">tic-tac-toe/noughts and crosses/Xs and Os game</h4>
<ul>
<li><a href="years.html#1991_westley">1991/westley</a></li>
<li><a href="years.html#1996_jonth">1996/jonth</a></li>
<li><a href="years.html#2020_carlini">2020/carlini</a></li>
<li><a href="1991/westley/index.html">1991/westley</a></li>
<li><a href="1996/jonth/index.html">1996/jonth</a></li>
<li><a href="2020/carlini/index.html">2020/carlini</a></li>
</ul>
<h4 id="solitaireothello-game">solitaire/Othello game</h4>
<ul>
<li><a href="years.html#1987_lievaart">1987/lievaart</a></li>
<li><a href="years.html#1994_dodsond1">1994/dodsond1</a></li>
<li><a href="1987/lievaart/index.html">1987/lievaart</a></li>
<li><a href="1994/dodsond1/index.html">1994/dodsond1</a></li>
</ul>
<h4 id="generating-small-primes-below-is-the-list-of-all-prime-related-winning-entries">generating small primes (below is the list of all prime related winning entries)</h4>
<ul>
<li><p><a href="years.html#1985_august">1985/august</a></p></li>
<li><p><a href="years.html#1988_applin">1988/applin</a></p></li>
<li><p><a href="years.html#1994_weisberg">1994/weisberg</a></p></li>
<li><p><a href="years.html#1995_makarios">1995/makarios</a></p></li>
<li><p><a href="years.html#1996_dalbec">1996/dalbec</a></p></li>
<li><p><a href="years.html#2000_bellard">2000/bellard</a></p></li>
<li><p><a href="1985/august/index.html">1985/august</a></p></li>
<li><p><a href="1988/applin/index.html">1988/applin</a></p></li>
<li><p><a href="1994/weisberg/index.html">1994/weisberg</a></p></li>
<li><p><a href="1995/makarios/index.html">1995/makarios</a></p></li>
<li><p><a href="1996/dalbec/index.html">1996/dalbec</a></p></li>
<li><p><a href="2000/bellard/index.html">2000/bellard</a></p></li>
</ul>
<p><em>As you can see, just a list of primes (let alone small primes) does not cut it
anymore.</em></p>
<h4 id="self-reproducing-program">self reproducing program</h4>
<ul>
<li><a href="years.html#1990_scjones">1990/scjones</a></li>
<li><a href="years.html#1994_smr">1994/smr</a> - _do not claim your program is the smallest one without seeing this!</li>
<li><a href="years.html#2000_dhyang">2000/dhyang</a> - <em>unless you beat this one, your chances are slim</em></li>
<li><a href="1990/scjones/index.html">1990/scjones</a></li>
<li><a href="1994/smr/index.html">1994/smr</a> - <em>do not claim your program is the smallest one without seeing this</em>!</li>
<li><a href="2000/dhyang/index.html">2000/dhyang</a> - <em>unless you beat this one, your chances are slim</em></li>
</ul>
<h4 id="entries-that-just-print-hello-world">entries that just print “Hello, world!”</h4>
<ul>
<li><a href="years.html#1984_anonymous">1984/anonymous</a></li>
<li><a href="years.html#1985_applin">1985/applin</a></li>
<li><a href="years.html#1986_applin">1986/applin</a></li>
<li><a href="years.html#1986_holloway">1986/holloway</a></li>
<li><a href="years.html#1989_jar.1">1989/jar.1</a></li>
<li><a href="years.html#1992_lush">1992/lush</a></li>
<li><a href="years.html#2000_tomx">2000/tomx</a></li>
<li><a href="1984/anonymous/index.html">1984/anonymous</a></li>
<li><a href="1985/applin/index.html">1985/applin</a></li>
<li><a href="1986/applin/index.html">1986/applin</a></li>
<li><a href="1986/holloway/index.html">1986/holloway</a></li>
<li><a href="1989/jar.1/index.html">1989/jar.1</a></li>
<li><a href="1992/lush/index.html">1992/lush</a></li>
<li><a href="2000/tomx/index.html">2000/tomx</a></li>
</ul>
<p><em><strong>…it’s so 20th century…</strong></em></p>
<p><em><strong>…it’s so 20th century…</strong></em> :-)</p>
<h4 id="entries-that-use-some-complex-state-machinetable-to-print-something">entries that use some complex state machine/table to print something</h4>
<ul>
<li><a href="years.html#1988_isaak">1988/isaak</a></li>
<li><a href="years.html#1988_phillipps">1988/phillipps</a></li>
<li><a href="years.html#2018_ciura">2018/ciura</a></li>
<li><a href="years.html#2018_giles">2018/giles</a></li>
<li><a href="1988/isaak/index.html">1988/isaak</a></li>
<li><a href="1988/phillipps/index.html">1988/phillipps</a></li>
<li><a href="2018/ciura/index.html">2018/ciura</a></li>
<li><a href="2018/giles/index.html">2018/giles</a></li>
</ul>
<h4 id="rot13">rot13</h4>
<ul>
<li><a href="years.html#1985_sicherman">1985/sicherman</a></li>
<li><a href="years.html#1989_westley">1989/westley</a></li>
<li><a href="years.html#1990_dg">1990/dg</a></li>
<li><a href="years.html#1991_fine">1991/fine</a></li>
<li><a href="1985/sicherman/index.html">1985/sicherman</a></li>
<li><a href="1989/westley/index.html">1989/westley</a></li>
<li><a href="1990/dg/index.html">1990/dg</a></li>
<li><a href="1991/fine/index.html">1991/fine</a></li>
</ul>
<h4 id="pi-or-e-computation"><strong>pi</strong> or <strong>e</strong> computation</h4>
<ul>
<li><a href="years.html#1986_august">1986/august</a></li>
<li><a href="years.html#1988_robison">1988/robison</a></li>
<li><a href="years.html#1988_westley">1988/westley</a></li>
<li><a href="years.html#1989_roemer">1989/roemer</a></li>
<li><a href="1986/august/index.html">1986/august</a></li>
<li><a href="1988/robison/index.html">1988/robison</a></li>
<li><a href="1988/westley/index.html">1988/westley</a></li>
<li><a href="1989/roemer/index.html">1989/roemer</a></li>
</ul>
<h4 id="hints-on-overused-themes">Hints on overused themes</h4>
<p>HINT: It is not fatal to send in those types of entries, it is just MUCH
@@ -433,7 +433,7 @@ For example:</p>
Linux or Solaris). To improve chances to win, it should work under both BSD and
SysV style UNIX (think <strong>stty cbreak</strong>), and should not depend on “Endianness”.
If it can compile and run on Windows and/or Mac (see
<a href="years.html#2000_thadgavin">2000/thadgavin</a> for one example, amongst others),
<a href="2000/thadgavin/index.html">2000/thadgavin</a> for one example, amongst others),
even better. Being able to compile with other compilers like clang is also a
good thing.</p>
<div id="faq0_5">
@@ -527,9 +527,9 @@ While many have asked who it was, we have continued to follow the
author’s wish to remain anonymous.</p>
<p>A few years ago, we asked the author if they still wanted to remain anonymous.
They said: ‘<em>Yes, I want to keep my anonymity. But you can tell them that I am well known for my connection to the
C language</em>’. It was not until 2001 that another <a href="years.html#2001_anonymous">anonymous
C language</em>’. It was not until 2001 that another <a href="2001/anonymous/index.html">anonymous
entry</a> received an award.</p>
<p>BTW: The <a href="years.html#1984_mullender">1984/mullender</a> remains one of my (Landon Curt Noll) all time favorites.</p>
<p>BTW: The <a href="1984/mullender/index.html">1984/mullender</a> remains one of my (Landon Curt Noll) all time favorites.</p>
<p>The name used in the posting of the <a href="http://groups.google.com/groups?q=Obfuscated&amp;hl=en&amp;lr=&amp;ie=UTF-8&amp;as_drrb=b&amp;as_mind=1&amp;as_minm=1&amp;as_miny=1983&amp;as_maxd=18&amp;as_maxm=4&amp;as_maxy=1984&amp;selm=837%40nsc.UUCP&amp;rnum=2&amp;filter=0">1st winning IOCCC
entry</a>
posting was <strong>I</strong>nternational <strong>O</strong>bfuscated <strong>C</strong> <strong>C</strong>ode <strong>C</strong>ontest or
@@ -596,7 +596,7 @@ repo</a>.</p>
<h4 id="ioccc-winning-entries-released-using-git-via-github">2020 IOCCC winning entries released using git via GitHub</h4>
<p>The <a href="https://github.com/ioccc-src/winner/commit/9d61fc0fb4a3245afb1435458cfb597fad0e8e6a">winning
entries</a>
of the <a href="https://www.ioccc.org/years.html#2020">IOCCC 2020</a>,
of the <a href="years.html#2020">IOCCC 2020</a>,
after a far too long of a delay
(due in part to a <a href="https://github.com/ioccc-src/winner/commit/c94fc84c35dc83e3eb9900720b95917a15c27afe">former IOCCC judge whose resignation was noted on
2021 Jan 04</a>)
@@ -606,7 +606,7 @@ were added by an <a href="https://www.ioccc.org/judges.html">IOCCC judge</a>
to their local <a href="https://git-scm.com">git</a> repository and then were
merged into the <a href="https://github.com/ioccc-src/winner/commit/b1638ff0012964d79ab1c44aa815d3f824f35b6c">Official IOCCC winner repo on 2020 Dec
31</a>.</p>
<p>These <a href="https://www.ioccc.org/years.html#2020">2020 IOCCC winning entries</a>,
<p>These <a href="years.html#2020">2020 IOCCC winning entries</a>,
as shown in the <a href="https://web.archive.org">Internet Wayback Machine</a>
<a href="https://web.archive.org/web/20210102042216/www.ioccc.org/years.html">snapshot of 2021 Jan 02</a>
were the first IOCCC entries to have been released via
@@ -687,7 +687,7 @@ tools and scripts</a>.</li>
<li>Setting up a system whereby authors of IOCCC entries may update their own
contact information via a <a href="https://github.com/ioccc-src/temp-test-ioccc/pulls">GitHub pull
request</a>.</li>
<li>Setting up to generate the top level <a href="/years.html">years.html</a> file via the
<li>Setting up to generate the top level <a href="years.html">years.html</a> file via the
<a href="/bin/gen-years.sh">gen-years.sh</a> tool.</li>
<li>Setting up to generate the top level <a href="/authors.html">authors.html file</a>, renamed
from <code>winners.html</code>, via the <a href="/bin/gen-authors.sh">gen-authors.sh</a> tool.</li>
@@ -787,7 +787,7 @@ appreciate the opportunity for a fun read as well as a chuckle or two.</p>
<li>admitting that your entry is not very obfuscated (you see, the contest is
called the <strong>IOCCC</strong>, not the <strong>INVOCCC</strong> :-) ); but even if you do not admit
it, not very obfuscated entries have a minuscule chance to win (although
<a href="years.html#2000_tomx">2000/tomx</a> is a notable counterexample).</li>
<a href="2000/tomx/index.html">2000/tomx</a> is a notable counterexample).</li>
<li>mentioning your name or any identifying information in the remark section (or
in the C code for that matter) - we like to be unbiased during the judging
rounds; we look at the author name only if an entry wins. See the guidelines if
faq.md
+46 -47
View File
@@ -202,7 +202,6 @@ While it is possible to win a new IOCCC with one of these
__over-submitted__ types of entries, level of the competition from
previous IOCCC entries make it more challenging to be successful.
It is also important to note that the [guidelines](guidelines.html) often
state something along the lines of:
@@ -211,35 +210,35 @@ state something along the lines of:
#### maze generator
- [1985/shapiro](years.html#1985_shapiro)
- [1991/buzzard](years.html#1991_buzzard)
- [1995/cdua](years.html#1995_cdua)
- [1995/dodsond2](years.html#1995_dodsond2)
- [1998/bas1](years.html#1998_bas1)
- [1985/shapiro](1985/shapiro/index.html)
- [1991/buzzard](1991/buzzard/index.html)
- [1995/cdua](1995/cdua/index.html)
- [1995/dodsond2](1995/dodsond2/index.html)
- [1998/bas1](1998/bas1/index.html)
#### tic-tac-toe/noughts and crosses/Xs and Os game
- [1991/westley](years.html#1991_westley)
- [1996/jonth](years.html#1996_jonth)
- [2020/carlini](years.html#2020_carlini)
- [1991/westley](1991/westley/index.html)
- [1996/jonth](1996/jonth/index.html)
- [2020/carlini](2020/carlini/index.html)
#### solitaire/Othello game
- [1987/lievaart](years.html#1987_lievaart)
- [1994/dodsond1](years.html#1994_dodsond1)
- [1987/lievaart](1987/lievaart/index.html)
- [1994/dodsond1](1994/dodsond1/index.html)
#### generating small primes (below is the list of all prime related winning entries)
- [1985/august](years.html#1985_august)
- [1988/applin](years.html#1988_applin)
- [1994/weisberg](years.html#1994_weisberg)
- [1995/makarios](years.html#1995_makarios)
- [1996/dalbec](years.html#1996_dalbec)
- [1985/august](1985/august/index.html)
- [1988/applin](1988/applin/index.html)
- [1994/weisberg](1994/weisberg/index.html)
- [1995/makarios](1995/makarios/index.html)
- [1996/dalbec](1996/dalbec/index.html)
- [2000/bellard](years.html#2000_bellard)
- [2000/bellard](2000/bellard/index.html)
_As you can see, just a list of primes (let alone small primes) does not cut it
anymore._
@@ -247,46 +246,46 @@ anymore._
#### self reproducing program
- [1990/scjones](years.html#1990_scjones)
- [1994/smr](years.html#1994_smr) - _do not claim your program is the smallest one without seeing this!
- [2000/dhyang](years.html#2000_dhyang) - _unless you beat this one, your chances are slim_
- [1990/scjones](1990/scjones/index.html)
- [1994/smr](1994/smr/index.html) - _do not claim your program is the smallest one without seeing this_!
- [2000/dhyang](2000/dhyang/index.html) - _unless you beat this one, your chances are slim_
#### entries that just print "Hello, world!"
- [1984/anonymous](years.html#1984_anonymous)
- [1985/applin](years.html#1985_applin)
- [1986/applin](years.html#1986_applin)
- [1986/holloway](years.html#1986_holloway)
- [1989/jar.1](years.html#1989_jar.1)
- [1992/lush](years.html#1992_lush)
- [2000/tomx](years.html#2000_tomx)
- [1984/anonymous](1984/anonymous/index.html)
- [1985/applin](1985/applin/index.html)
- [1986/applin](1986/applin/index.html)
- [1986/holloway](1986/holloway/index.html)
- [1989/jar.1](1989/jar.1/index.html)
- [1992/lush](1992/lush/index.html)
- [2000/tomx](2000/tomx/index.html)
_**...it's so 20th century...**_
_**...it's so 20th century...**_ :-)
#### entries that use some complex state machine/table to print something
- [1988/isaak](years.html#1988_isaak)
- [1988/phillipps](years.html#1988_phillipps)
- [2018/ciura](years.html#2018_ciura)
- [2018/giles](years.html#2018_giles)
- [1988/isaak](1988/isaak/index.html)
- [1988/phillipps](1988/phillipps/index.html)
- [2018/ciura](2018/ciura/index.html)
- [2018/giles](2018/giles/index.html)
#### rot13
- [1985/sicherman](years.html#1985_sicherman)
- [1989/westley](years.html#1989_westley)
- [1990/dg](years.html#1990_dg)
- [1991/fine](years.html#1991_fine)
- [1985/sicherman](1985/sicherman/index.html)
- [1989/westley](1989/westley/index.html)
- [1990/dg](1990/dg/index.html)
- [1991/fine](1991/fine/index.html)
#### **pi** or **e** computation
- [1986/august](years.html#1986_august)
- [1988/robison](years.html#1988_robison)
- [1988/westley](years.html#1988_westley)
- [1989/roemer](years.html#1989_roemer)
- [1986/august](1986/august/index.html)
- [1988/robison](1988/robison/index.html)
- [1988/westley](1988/westley/index.html)
- [1989/roemer](1989/roemer/index.html)
#### Hints on overused themes
@@ -375,7 +374,7 @@ Your entry must compile with GCC and run under at least one flavor of UNIX (e.g.
Linux or Solaris). To improve chances to win, it should work under both BSD and
SysV style UNIX (think **stty cbreak**), and should not depend on "Endianness".
If it can compile and run on Windows and/or Mac (see
[2000/thadgavin](years.html#2000_thadgavin) for one example, amongst others),
[2000/thadgavin](2000/thadgavin/index.html) for one example, amongst others),
even better. Being able to compile with other compilers like clang is also a
good thing.
@@ -500,9 +499,9 @@ author's wish to remain anonymous.
A few years ago, we asked the author if they still wanted to remain anonymous.
They said: '_Yes, I want to keep my anonymity. But you can tell them that I am well known for my connection to the
C language_'. It was not until 2001 that another [anonymous
entry](years.html#2001_anonymous) received an award.
entry](2001/anonymous/index.html) received an award.
BTW: The [1984/mullender](years.html#1984_mullender) remains one of my (Landon Curt Noll) all time favorites.
BTW: The [1984/mullender](1984/mullender/index.html) remains one of my (Landon Curt Noll) all time favorites.
The name used in the posting of the [1st winning IOCCC
entry](http://groups.google.com/groups?q=Obfuscated&hl=en&lr=&ie=UTF-8&as_drrb=b&as_mind=1&as_minm=1&as_miny=1983&as_maxd=18&as_maxm=4&as_maxy=1984&selm=837%40nsc.UUCP&rnum=2&filter=0)
@@ -597,7 +596,7 @@ repo](https://github.com/ioccc-src/winner).
The [winning
entries](https://github.com/ioccc-src/winner/commit/9d61fc0fb4a3245afb1435458cfb597fad0e8e6a)
of the [IOCCC 2020](https://www.ioccc.org/years.html#2020),
of the [IOCCC 2020](years.html#2020),
after a far too long of a delay
(due in part to a [former IOCCC judge whose resignation was noted on
2021 Jan 04](https://github.com/ioccc-src/winner/commit/c94fc84c35dc83e3eb9900720b95917a15c27afe))
@@ -608,7 +607,7 @@ to their local [git](https://git-scm.com) repository and then were
merged into the [Official IOCCC winner repo on 2020 Dec
31](https://github.com/ioccc-src/winner/commit/b1638ff0012964d79ab1c44aa815d3f824f35b6c).
These [2020 IOCCC winning entries](https://www.ioccc.org/years.html#2020),
These [2020 IOCCC winning entries](years.html#2020),
as shown in the [Internet Wayback Machine](https://web.archive.org)
[snapshot of 2021 Jan 02](https://web.archive.org/web/20210102042216/www.ioccc.org/years.html)
were the first IOCCC entries to have been released via
@@ -702,7 +701,7 @@ tools and scripts](/bin/index.html).
* Setting up a system whereby authors of IOCCC entries may update their own
contact information via a [GitHub pull
request](https://github.com/ioccc-src/temp-test-ioccc/pulls).
* Setting up to generate the top level [years.html](/years.html) file via the
* Setting up to generate the top level [years.html](years.html) file via the
[gen-years.sh](/bin/gen-years.sh) tool.
* Setting up to generate the top level [authors.html file](/authors.html), renamed
from `winners.html`, via the [gen-authors.sh](/bin/gen-authors.sh) tool.
@@ -825,7 +824,7 @@ appreciate the opportunity for a fun read as well as a chuckle or two.
- admitting that your entry is not very obfuscated (you see, the contest is
called the **IOCCC**, not the **INVOCCC** :-) ); but even if you do not admit
it, not very obfuscated entries have a minuscule chance to win (although
[2000/tomx](years.html#2000_tomx) is a notable counterexample).
[2000/tomx](2000/tomx/index.html) is a notable counterexample).
- mentioning your name or any identifying information in the remark section (or
in the C code for that matter) - we like to be unbiased during the judging
rounds; we look at the author name only if an entry wins. See the guidelines if