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

2011/index.html
+41 -64
View File
@@ -123,95 +123,72 @@
<!-- 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="twentieth-international-obfuscated-c-code-contest">Twentieth
International Obfuscated C Code Contest</h1>
<h1 id="twentieth-international-obfuscated-c-code-contest">Twentieth 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 it 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">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on
non-Unix / non-Linux systems the Makefile needs to be changed. See the
Makefile 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 Makefile 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 it 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">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile 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 Makefile 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 gcc instead of your
local compiler.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the
entries</h2>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>There were some outstanding entries that did not win. Unfortunately
some very good entries lost because they:</p>
<ul>
<li><p>did not follow the “one program - one file” rule;</p></li>
<li><p>depended too much on 32 bit architectures;</p></li>
<li><p>were more of the “obfuscated math” kind rather than the
“obfuscated C” kind.</p></li>
<li><p>were more of the “obfuscated math” kind rather than the “obfuscated C” kind.</p></li>
</ul>
<p>We hope the authors of some of those entries will fix and re-submit
them for the next IOCCC.</p>
<p>We believe you will be impressed with this year’s winning entries.
The Best of Show is a fine example of character stitching. But don’t
ignore the other entries! There are games, puzzle solvers, utilities,
eye candy, calculators and graphical and audio tools.</p>
<p>This year all authors are different, and there is a authors from a
new country - China! Many authors won for the first time. (Please note
that judging is done completely anonymously. Be warned that we may
disqualify entries that reveal the identity of the submitter).</p>
<p>We believe you will be impressed with this year’s winning entries. The Best
of Show is a fine example of character stitching. But don’t ignore the other
entries! There are games, puzzle solvers, utilities, eye candy, calculators and
graphical and audio tools.</p>
<p>This year all authors are different, and there is a authors from a new country -
China! Many authors won for the first time. (Please note that judging is done
completely anonymously. Be warned that we may disqualify entries that reveal
the identity of the submitter).</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) 2012,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) 2012,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-2011---the-20th-ioccc"><a name=inventory></a><a name=2011></a>Winning
Entries of 2011 - The 20th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="2011/ioccc.2011.tar.bz2">2011 entry source</a></p>
<h1 id="winning-entries-of-2011---the-20th-ioccc"><a name=inventory></a><a name=2011></a>Winning Entries of 2011 - The 20th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="2011/ioccc.2011.tar.bz2">2011 entry source</a></p>
<ul>
<li><a href="akari/index.html">2011/akari</a> - Best of Show - Most
Shrinkable</li>
<li><a href="akari/index.html">2011/akari</a> - Best of Show - Most Shrinkable</li>
<li><a href="blakely/index.html">2011/blakely</a> - Most devolving</li>
<li><a href="borsanyi/index.html">2011/borsanyi</a> - Best data
utility</li>
<li><a href="dlowe/index.html">2011/dlowe</a> - Most self
deprecating</li>
<li><a href="borsanyi/index.html">2011/borsanyi</a> - Best data utility</li>
<li><a href="dlowe/index.html">2011/dlowe</a> - Most self deprecating</li>
<li><a href="eastman/index.html">2011/eastman</a> - Best ball</li>
<li><a href="fredriksson/index.html">2011/fredriksson</a> - Most
useful</li>
<li><a href="fredriksson/index.html">2011/fredriksson</a> - Most useful</li>
<li><a href="goren/index.html">2011/goren</a> - Most artistic</li>
<li><a href="hamaji/index.html">2011/hamaji</a> - Best solved
puzzle</li>
<li><a href="hou/index.html">2011/hou</a> - Best self documenting
program</li>
<li><a href="hamaji/index.html">2011/hamaji</a> - Best solved puzzle</li>
<li><a href="hou/index.html">2011/hou</a> - Best self documenting program</li>
<li><a href="konno/index.html">2011/konno</a> - Best one liner</li>
<li><a href="richards/index.html">2011/richards</a> - Most surprisingly
portable</li>
<li><a href="toledo/index.html">2011/toledo</a> - Best non-chess
game</li>
<li><a href="richards/index.html">2011/richards</a> - Most surprisingly portable</li>
<li><a href="toledo/index.html">2011/toledo</a> - Best non-chess game</li>
<li><a href="vik/index.html">2011/vik</a> - Most sound</li>
<li><a href="zucker/index.html">2011/zucker</a> - Most shiny</li>
</ul>