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

improve spacing on some bullet lists in FAQ

Browse Source
This commit is contained in:
Landon Curt Noll committed 2024-03-19 22:47:48 -07:00
1 parent a7896eb8ae
commit 78863e5311
2 files changed
+59 -105
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

faq.html
+58 -58
View File
@@ -270,22 +270,22 @@ state something along the lines of:</p>
</blockquote>
<h4 id="maze-generator">maze generator</h4>
<ul>
<li><p><a href="years.html#1985_shapiro">1985/shapiro</a></p></li>
<li><p><a href="years.html#1991_buzzard">1991/buzzard</a></p></li>
<li><p><a href="years.html#1995_cdua">1995/cdua</a></p></li>
<li><p><a href="years.html#1995_dodsond2">1995/dodsond2</a></p></li>
<li><p><a href="years.html#1998_bas1">1998/bas1</a></p></li>
<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>
</ul>
<h4 id="tic-tac-toenoughts-and-crossesxs-and-os-game">tic-tac-toe/noughts and crosses/Xs and Os game</h4>
<ul>
<li><p><a href="years.html#1991_westley">1991/westley</a></p></li>
<li><p><a href="years.html#1996_jonth">1996/jonth</a></p></li>
<li><p><a href="years.html#2020_carlini">2020/carlini</a></p></li>
<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>
</ul>
<h4 id="solitaireothello-game">solitaire/Othello game</h4>
<ul>
<li><p><a href="years.html#1987_lievaart">1987/lievaart</a></p></li>
<li><p><a href="years.html#1994_dodsond1">1994/dodsond1</a></p></li>
<li><a href="years.html#1987_lievaart">1987/lievaart</a></li>
<li><a href="years.html#1994_dodsond1">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>
@@ -300,41 +300,41 @@ state something along the lines of:</p>
anymore.</em></p>
<h4 id="self-reproducing-program">self reproducing program</h4>
<ul>
<li><p><a href="years.html#1990_scjones">1990/scjones</a></p></li>
<li><p><a href="years.html#1994_smr">1994/smr</a> - _do not claim your program is the smallest one without seeing this!</p></li>
<li><p><a href="years.html#2000_dhyang">2000/dhyang</a> - <em>unless you beat this one, your chances are slim</em></p></li>
<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>
</ul>
<h4 id="entries-that-just-print-hello-world">entries that just print “Hello, world!”</h4>
<ul>
<li><p><a href="years.html#1984_anonymous">1984/anonymous</a></p></li>
<li><p><a href="years.html#1985_applin">1985/applin</a></p></li>
<li><p><a href="years.html#1986_applin">1986/applin</a></p></li>
<li><p><a href="years.html#1986_holloway">1986/holloway</a></p></li>
<li><p><a href="years.html#1989_jar.1">1989/jar.1</a></p></li>
<li><p><a href="years.html#1992_lush">1992/lush</a></p></li>
<li><p><a href="years.html#2000_tomx">2000/tomx</a></p></li>
<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>
</ul>
<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><p><a href="years.html#1988_isaak">1988/isaak</a></p></li>
<li><p><a href="years.html#1988_phillipps">1988/phillipps</a></p></li>
<li><p><a href="years.html#2018_ciura">2018/ciura</a></p></li>
<li><p><a href="years.html#2018_giles">2018/giles</a></p></li>
<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>
</ul>
<h4 id="rot13">rot13</h4>
<ul>
<li><p><a href="years.html#1985_sicherman">1985/sicherman</a></p></li>
<li><p><a href="years.html#1989_westley">1989/westley</a></p></li>
<li><p><a href="years.html#1990_dg">1990/dg</a></p></li>
<li><p><a href="years.html#1991_fine">1991/fine</a></p></li>
<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>
</ul>
<h4 id="pi-or-e-computation"><strong>pi</strong> or <strong>e</strong> computation</h4>
<ul>
<li><p><a href="years.html#1986_august">1986/august</a></p></li>
<li><p><a href="years.html#1988_robison">1988/robison</a></p></li>
<li><p><a href="years.html#1988_westley">1988/westley</a></p></li>
<li><p><a href="years.html#1989_roemer">1989/roemer</a></p></li>
<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>
</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
@@ -676,23 +676,23 @@ as most people who are not humor impaired, as well as the IOCCC judges
appreciate the opportunity for a fun read as well as a chuckle or two.</p>
<h4 id="what-helps">What helps:</h4>
<ul>
<li><p>explaining what your entry does</p></li>
<li><p>how to entice it to do what it is supposed to do</p></li>
<li><p>what obfuscations are used</p></li>
<li><p>what are the limitations of your entry in respect of portability and/or input data</p></li>
<li><p>how it works (if you are really condescending)</p></li>
<li>explaining what your entry does</li>
<li>how to entice it to do what it is supposed to do</li>
<li>what obfuscations are used</li>
<li>what are the limitations of your entry in respect of portability and/or input data</li>
<li>how it works (if you are really condescending)</li>
</ul>
<h4 id="what-does-not-help">What does not help:</h4>
<ul>
<li><p>admitting that your entry is not very obfuscated (you see, the contest is
<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).</p></li>
<li><p>mentioning your name or any identifying information in the remark section (or
<a href="years.html#2000_tomx">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
this is not clear!</p></li>
<li><p>leaving the remark section empty.</p></li>
this is not clear!</li>
<li>leaving the remark section empty.</li>
</ul>
<h3 id="faq-2.2-why-dont-you-publish-entries-that-do-not-win"><a name="faq2_2"></a>FAQ 2.2: Why don’t you publish entries that do not win?</h3>
<p>Because the publication on the IOCCC site <strong><em>IS</em></strong> the award!
@@ -724,31 +724,31 @@ For such an IOCCC entry, the IOCCC judges award a “Grand Prize”
or “Best of Show award.</p>
<p>In 1984-1987, the grand prize winning entries are:</p>
<ul>
<li><p><a href="years.html#1984_mullender">1984/mullender</a></p></li>
<li><p><a href="years.html#1985_shapiro">1985/shapiro</a></p></li>
<li><p><a href="years.html#1986_wall">1986/wall</a></p></li>
<li><p><a href="years.html#1987_lievaart">1987/lievaart</a></p></li>
<li><a href="years.html#1984_mullender">1984/mullender</a></li>
<li><a href="years.html#1985_shapiro">1985/shapiro</a></li>
<li><a href="years.html#1986_wall">1986/wall</a></li>
<li><a href="years.html#1987_lievaart">1987/lievaart</a></li>
</ul>
<p>Starting from 1988, the entry we liked the most in that year is called
“Best of Show”. Here are the “Best of Show” entries:</p>
<ul>
<li><p><a href="years.html#1988_applin">1988/applin</a></p></li>
<li><p><a href="years.html#1989_jar.2">1989/jar.2</a></p></li>
<li><p><a href="years.html#1990_theorem">1990/theorem</a></p></li>
<li><p><a href="years.html#1991_brnstnd">1991/brnstnd</a></p></li>
<li><p><a href="years.html#1992_vern">1992/vern</a></p></li>
<li><p><a href="years.html#1996_august">1996/august</a></p></li>
<li><p><a href="years.html#1998_banks">1998/banks</a></p></li>
<li><p><a href="years.html#2000_jarijyrki">2000/jarijyrki</a></p></li>
<li><p><a href="years.html#2020_carlini">2020/carlini</a></p></li>
<li><a href="years.html#1988_applin">1988/applin</a></li>
<li><a href="years.html#1989_jar.2">1989/jar.2</a></li>
<li><a href="years.html#1990_theorem">1990/theorem</a></li>
<li><a href="years.html#1991_brnstnd">1991/brnstnd</a></li>
<li><a href="years.html#1992_vern">1992/vern</a></li>
<li><a href="years.html#1996_august">1996/august</a></li>
<li><a href="years.html#1998_banks">1998/banks</a></li>
<li><a href="years.html#2000_jarijyrki">2000/jarijyrki</a></li>
<li><a href="years.html#2020_carlini">2020/carlini</a></li>
</ul>
<p>In 1993, 1994 and 1995 the judges were unable to select a clear overall
winning entry. So to give a nod to the entry that had the highest approval ranking
from the judges, they used the following awards:</p>
<ul>
<li><p><a href="years.html#1993_rince">1993/rince</a> - Most Well Rounded</p></li>
<li><p><a href="years.html#1994_shapiro">1994/shapiro</a> - Most Well Rounded</p></li>
<li><p><a href="years.html#1995_leo">1995/leo</a> - Best Use of Obfuscation</p></li>
<li><a href="years.html#1993_rince">1993/rince</a> - Most Well Rounded</li>
<li><a href="years.html#1994_shapiro">1994/shapiro</a> - Most Well Rounded</li>
<li><a href="years.html#1995_leo">1995/leo</a> - Best Use of Obfuscation</li>
</ul>
<p>These could be considered the ‘best entry’ for those years with 1 or
more other entries that came in close behind.</p>
faq.md
+1 -47
View File
@@ -190,43 +190,33 @@ 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)
#### 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)
#### solitaire/Othello game
- [1987/lievaart](years.html#1987_lievaart)
- [1994/dodsond1](years.html#1994_dodsond1)
#### 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)
- [2000/bellard](years.html#2000_bellard)
@@ -238,26 +228,18 @@ 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_
#### 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)
_**...it's so 20th century...**_
@@ -266,33 +248,24 @@ _**...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)
#### 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)
#### **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)
@@ -744,13 +717,9 @@ appreciate the opportunity for a fun read as well as a chuckle or two.
#### What helps:
- explaining what your entry does
- how to entice it to do what it is supposed to do
- what obfuscations are used
- what are the limitations of your entry in respect of portability and/or input data
- how it works (if you are really condescending)
@@ -760,12 +729,10 @@ appreciate the opportunity for a fun read as well as a chuckle or two.
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).
- 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
this is not clear!
- leaving the remark section empty.
@@ -814,32 +781,21 @@ or "Best of Show award.
In 1984-1987, the grand prize winning entries are:
- [1984/mullender](years.html#1984_mullender)
- [1985/shapiro](years.html#1985_shapiro)
- [1986/wall](years.html#1986_wall)
- [1987/lievaart](years.html#1987_lievaart)
Starting from 1988, the entry we liked the most in that year is called
"Best of Show". Here are the "Best of Show" entries:
- [1988/applin](years.html#1988_applin)
- [1989/jar.2](years.html#1989_jar.2)
- [1990/theorem](years.html#1990_theorem)
- [1991/brnstnd](years.html#1991_brnstnd)
- [1992/vern](years.html#1992_vern)
- [1996/august](years.html#1996_august)
- [1998/banks](years.html#1998_banks)
- [2000/jarijyrki](years.html#2000_jarijyrki)
- [2020/carlini](years.html#2020_carlini)
@@ -848,9 +804,7 @@ winning entry. So to give a nod to the entry that had the highest approval ranki
from the judges, they used the following awards:
- [1993/rince](years.html#1993_rince) - Most Well Rounded
- [1994/shapiro](years.html#1994_shapiro) - Most Well Rounded
- [1995/leo](years.html#1995_leo) - Best Use of Obfuscation
These could be considered the 'best entry' for those years with 1 or