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

force use of pandoc version >= 3.1.12.2

Browse Source 
The `bin/pandoc-wrapper.sh` tool will verify that the ssytem
has a recent enough version of `pandoc(1)`.

We explain why we insist on `pandoc(1)`. version >= 3.1.12.2
in comments where the $PANDOC_MIN_VERSION is set.

Added `--wrap=preserve` as a default argument to `pandoc(1)`.
While this change will impact every HTML file generated,
we believe this will improve the ability of someone to look
at the generated HTML and correlate with the original markdown.

Changed `bin/pandoc-wrapper.sh` VERSION from "1.4.2 2024-03-17"
to "1.4.3 2024-03-18".

Performed `make www` to achieve all of the above and to generate
HTML using the new  `--wrap=preserve` `pandoc(1)` mode.
This commit is contained in:
Landon Curt Noll committed 2024-03-18 01:26:39 -07:00
1 parent 9eb7a54e9f
commit b0b212acb1
402 files changed
+37061 -55132
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2005/index.html
+60 -101
View File
@@ -123,82 +123,56 @@
<!-- END: this line ends content from: inc/before-content.default.html -->
<!-- START: this line starts content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<h1 id="eighteenth-international-obfuscated-c-code-contest">Eighteenth
International Obfuscated C Code Contest</h1>
<h1 id="eighteenth-international-obfuscated-c-code-contest">Eighteenth International Obfuscated C Code Contest</h1>
<h2 id="standard-ioccc-stuff">Standard IOCCC stuff</h2>
<p>View the <code>index.html</code> web page for the given winning entry
for information on how on how to compile the entry and how to run the
winning program. Look at the winning source and try to figure how it
does what it does! You may then wish to look at the Author’s remarks for
even more details.</p>
<p>The IOCCC has a web site and now has a number of international
mirrors. The primary site can be found at <a
href="https://www.ioccc.org/"
class="uri">https://www.ioccc.org/</a>.</p>
<p>Use <code>make(1)</code> to compile entries. It is possible that on
non-Unix / non-Linux systems the <code>Makefile</code> needs to be
changed. See the <code>Makefile</code> for details.</p>
<p>This year we included most of the information included by the
submitters in the <code>README.md</code> files (that were used to build
the <code>index.html</code> web pages).</p>
<p>Read over the <code>Makefile</code> for compile/build issues. Your
system may require certain changes (add or remove a library, add or
remove a <code>#define</code>).</p>
<p>View the <code>index.html</code> web page for the given winning entry for information on how
on how to compile the entry and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has a web site and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org/" class="uri">https://www.ioccc.org/</a>.</p>
<p>Use <code>make(1)</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the <code>Makefile</code> needs to be changed. See the <code>Makefile</code> for details.</p>
<p>This year we included most of the information included by the submitters
in the <code>README.md</code> files (that were used to build the <code>index.html</code> web pages).</p>
<p>Read over the <code>Makefile</code> for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using <code>gcc</code> instead
of your local compiler.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the
entries</h2>
<p>We believe you will be impressed with this year’s winning
entries.</p>
yours is lacking, you may need to compile using <code>gcc</code> instead of your
local compiler.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>We believe you will be impressed with this year’s winning entries.</p>
<p>In particular:</p>
<ul>
<li><p>The <a href="klausler/index.html">Abuse of the rules
(klausler)</a> used local dictionary data to get around the size
limit.</p></li>
<li><p>The <a href="vince/index.html">Most beauteous visuals (vince)</a>
made clever use of <code>{}</code>s and whitespace in their source code
and during execution.</p></li>
<li><p>The <a href="vik/index.html">Most circuitous walk (vik)</a> entry
is just amazing.</p></li>
<li><p>The <a href="toledo/index.html">Best game (toledo)</a> makes full
use of its single function.</p></li>
<li><p>The <a href="sykes/index.html">Best emulator (sykes)</a> may
allow you to reconnect to your first <a
href="https://en.wikipedia.org/wiki/Commodore_PET">PET</a>.</p></li>
<li><p>Our <a href="persano/index.html">Best of Show (persano)</a> this
year was simply (or non-simply :-) ) the best!</p></li>
<li><p>(And we need only mention (parenthetically speaking) that the <a
href="mikeash/index.html">Best use of parenthesis</a> is self
reproducing).</p></li>
<li><p>The <a href="jetro/index.html">Most sonorous output (jetro)</a>
might <code>sound</code> :-) like a good idea.</p></li>
<li><p>The <a href="giljade/index.html">Best 2D puzzle (giljade)</a>
takes editorial license with expressions as well as the with the <a
href="https://en.wikipedia.org/wiki/Vi">vi editor</a>.</p></li>
<li><p>The <a href="chia/index.html">Most ambiguous language (chia)</a>
entry is really a C program.</p></li>
<li><p>The <a href="boutines/index.html">Most superfluous output
(boutines)</a> entry is simply <a
href="Voronoi">Voronoi</a>-lific!</p></li>
<li><p>Try not to have your sense of good coding offended by the <a
href="timwi/index.html">Most discourteous interpreter (timwi)</a>
entry.</p></li>
<li><p>The <a href="mynx/index.html">Best use of the www (mynx)</a>
doesn’t include those letters.</p></li>
<li><p>You will be puzzled by the <a href="anon/index.html">Best 3D
puzzle (anon)</a> entry; we are sure!</p></li>
<li><p>The <a href="aidan/index.html">Most ingenious puzzle solution
(aidan)</a> might puzzle you more while it puzzles out some puzzles: all
in a puzzling way! :-)</p></li>
<li><p>The <a href="klausler/index.html">Abuse of the rules (klausler)</a> used local dictionary data to
get around the size limit.</p></li>
<li><p>The <a href="vince/index.html">Most beauteous visuals (vince)</a> made clever use of <code>{}</code>s and
whitespace in their source code and during execution.</p></li>
<li><p>The <a href="vik/index.html">Most circuitous walk (vik)</a> entry is just amazing.</p></li>
<li><p>The <a href="toledo/index.html">Best game (toledo)</a> makes full use of its single function.</p></li>
<li><p>The <a href="sykes/index.html">Best emulator (sykes)</a> may allow you to reconnect to your first
<a href="https://en.wikipedia.org/wiki/Commodore_PET">PET</a>.</p></li>
<li><p>Our <a href="persano/index.html">Best of Show (persano)</a> this year was simply (or non-simply :-) ) the best!</p></li>
<li><p>(And we need only mention (parenthetically speaking) that the <a href="mikeash/index.html">Best use of
parenthesis</a> is self reproducing).</p></li>
<li><p>The <a href="jetro/index.html">Most sonorous output (jetro)</a> might <code>sound</code> :-) like a good idea.</p></li>
<li><p>The <a href="giljade/index.html">Best 2D puzzle (giljade)</a> takes editorial license with expressions as well as the
with the <a href="https://en.wikipedia.org/wiki/Vi">vi editor</a>.</p></li>
<li><p>The <a href="chia/index.html">Most ambiguous language (chia)</a> entry is really a C program.</p></li>
<li><p>The <a href="boutines/index.html">Most superfluous output (boutines)</a> entry is simply
<a href="Voronoi">Voronoi</a>-lific!</p></li>
<li><p>Try not to have your sense of good coding offended by the <a href="timwi/index.html">Most
discourteous interpreter (timwi)</a> entry.</p></li>
<li><p>The <a href="mynx/index.html">Best use of the www (mynx)</a> doesn’t include those letters.</p></li>
<li><p>You will be puzzled by the <a href="anon/index.html">Best 3D puzzle (anon)</a> entry; we are sure!</p></li>
<li><p>The <a href="aidan/index.html">Most ingenious puzzle solution (aidan)</a> might puzzle you more while it
puzzles out some puzzles: all in a puzzling way! :-)</p></li>
</ul>
<h3 id="remarks-on-some-of-the-losing-entries">Remarks on some of the
losing entries</h3>
<h3 id="remarks-on-some-of-the-losing-entries">Remarks on some of the losing entries</h3>
<p>There were some outstanding entries that did not win. Unfortunately
some very good entries lost because they:</p>
<ul>
<li><p>depended too much on non-portable side effects in expressions;
and/or</p></li>
<li><p>depended too much on non-portable side effects in expressions; and/or</p></li>
<li><p>depended too much on a particular byte order; and/or</p></li>
<li><p>required the use of a special script, data file or pseudo-machine
language that was not supplied with the entry.</p></li>
@@ -206,54 +180,39 @@ language that was not supplied with the entry.</p></li>
<p>We hope the authors of some of those entries will fix and resubmit
them for the next IOCCC.</p>
<h2 id="final-comments">Final Comments</h2>
<p><strong>IMPORTANT NOTE</strong>: See <a
href="../contact.html">contact.html</a> for up to date contact details
as well as details on how to provide fixes to any of the entries. See
also <a href="../faq.html">the IOCCC FAQ</a> for addition information on
the IOCCC.</p>
<p><strong>IMPORTANT NOTE</strong>: See <a href="../contact.html">contact.html</a> for up to date contact details
as well as details on how to provide fixes to any of the entries.
See also <a href="../faq.html">the IOCCC FAQ</a> for addition information on the IOCCC.</p>
<h1 id="copyright-and-license">Copyright and License</h1>
<p>Copyright (c) 2005,2023, Landon Curt Noll and Leonid A. Broukhis. All
Rights Reserved. This work is licensed under a <a
href="https://creativecommons.org/licenses/by-sa/4.0/">Creative Commons
CC BY-SA 4.0 DEED Attribution-ShareAlike 4.0 International</a> license.
If you do use this work in some form, the <a href="../judges.html">IOCCC
judges</a> would appreciate (but does not require) if you were to <a
href="../contact.html">send us a note about your use</a>.</p>
<p>Copyright (c) 2005,2023, Landon Curt Noll and Leonid A. Broukhis. All Rights Reserved.
This work is licensed under a <a href="https://creativecommons.org/licenses/by-sa/4.0/">Creative Commons CC BY-SA 4.0 DEED Attribution-ShareAlike
4.0 International</a> license.
If you do use this work in some form, the <a href="../judges.html">IOCCC judges</a> would appreciate
(but does not require) if you were to <a href="../contact.html">send us a note about your use</a>.</p>
<!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- START: this line starts content for HTML phase 22 by: bin/output-year-index.sh via bin/md2html.sh -->
<!-- START: this line starts content generated by: bin/output-year-index.sh -->
<h1
id="winning-entries-of-2005---the-18th-ioccc"><a name=inventory></a><a name=2005></a>Winning
Entries of 2005 - The 18th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="2005/ioccc.2005.tar.bz2">2005 entry source</a></p>
<h1 id="winning-entries-of-2005---the-18th-ioccc"><a name=inventory></a><a name=2005></a>Winning Entries of 2005 - The 18th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="2005/ioccc.2005.tar.bz2">2005 entry source</a></p>
<ul>
<li><a href="aidan/index.html">2005/aidan</a> - Most ingenious puzzle
solution</li>
<li><a href="aidan/index.html">2005/aidan</a> - Most ingenious puzzle solution</li>
<li><a href="anon/index.html">2005/anon</a> - Best 3D puzzle</li>
<li><a href="boutines/index.html">2005/boutines</a> - Most superfluous
output</li>
<li><a href="chia/index.html">2005/chia</a> - Most ambiguous
language</li>
<li><a href="boutines/index.html">2005/boutines</a> - Most superfluous output</li>
<li><a href="chia/index.html">2005/chia</a> - Most ambiguous language</li>
<li><a href="giljade/index.html">2005/giljade</a> - Best 2D puzzle</li>
<li><a href="jetro/index.html">2005/jetro</a> - Most sonorous
output</li>
<li><a href="klausler/index.html">2005/klausler</a> - Abuse of the
rules</li>
<li><a href="mikeash/index.html">2005/mikeash</a> - Best use of
parenthesis</li>
<li><a href="jetro/index.html">2005/jetro</a> - Most sonorous output</li>
<li><a href="klausler/index.html">2005/klausler</a> - Abuse of the rules</li>
<li><a href="mikeash/index.html">2005/mikeash</a> - Best use of parenthesis</li>
<li><a href="mynx/index.html">2005/mynx</a> - Best use of the WWW</li>
<li><a href="persano/index.html">2005/persano</a> - Best of Show</li>
<li><a href="sykes/index.html">2005/sykes</a> - Best Emulator</li>
<li><a href="timwi/index.html">2005/timwi</a> - Most discourteous
interpreter</li>
<li><a href="timwi/index.html">2005/timwi</a> - Most discourteous interpreter</li>
<li><a href="toledo/index.html">2005/toledo</a> - Best Game</li>
<li><a href="vik/index.html">2005/vik</a> - Most circuitous walk</li>
<li><a href="vince/index.html">2005/vince</a> - Most beauteous
visuals</li>
<li><a href="vince/index.html">2005/vince</a> - Most beauteous visuals</li>
</ul>
<p> <strong>Jump to:</strong> <a href="#">top</a></p>