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

2012/index.html
+66 -91
View File
@@ -123,135 +123,110 @@
<!-- 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="twenty-first-international-obfuscated-c-code-contest">Twenty
First International Obfuscated C Code Contest</h1>
<h1 id="twenty-first-international-obfuscated-c-code-contest">Twenty First 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>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>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>
<p>We believe you will be impressed with this year’s winning entries. We
had a very difficult time picking a single best from among the other
entries because the overall quality of the submissions were so high.</p>
<p>This year we selected the top 4 entries for particularly high
honors:</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. We had
a very difficult time picking a single best from among the other entries
because the overall quality of the submissions were so high.</p>
<p>This year we selected the top 4 entries for particularly high honors:</p>
<ul>
<li><p>Gold award - Balanced use of obfuscation</p>
<p>A very extremely subtle and twisted piece of source code! Even if you
start with the zeitak.alt.c source, you will still have a very
challenging time to understand it!</p></li>
<p>A very extremely subtle and twisted piece of source code!
Even if you start with the zeitak.alt.c source,
you will still have a very challenging time to understand it!</p></li>
<li><p>Silver award - Most elementary use of C</p>
<p>A fun program that could also have won “Best abuse of Ghostscript”
because it managed to create some PDF files that Ghostscript could not
read.</p></li>
<p>A fun program that could also have won “Best abuse of
Ghostscript” because it managed to create some PDF files
that Ghostscript could not read.</p></li>
<li><p>Bronze award - Best use of cocoa</p>
<p>A picture within a picture is worth more than a thousand (4 byte)
words. :-)</p></li>
<p>A picture within a picture is worth more than a
thousand (4 byte) words. :-)</p></li>
<li><p>Honorable mention - Most complex ASCII fluid</p>
<p>When you see this program in action, you too will very likely say <a
href="http://bit.ly/R6ALpK">wow</a> as we did!</p></li>
<p>When you see this program in action, you too will
very likely say <a href="http://bit.ly/R6ALpK">wow</a> as we did!</p></li>
</ul>
<p>But don’t ignore the other winning entries! There are games,
utilities, eye candy, calculators and graphical tools to explore.</p>
<p>This year, Yusuke Endoh won with two entries, one of which (<a
href="endoh1/index.html">endoh1</a>) won the special Honorable mention
award. Eight of the winning entries were from people who won in previous
years.</p>
<p>But don’t ignore the other winning entries! There are games, utilities,
eye candy, calculators and graphical tools to explore.</p>
<p>This year, Yusuke Endoh won with two entries, one of which
(<a href="endoh1/index.html">endoh1</a>) won the special Honorable mention award. Eight of
the winning entries were from people who won in previous years.</p>
<p>This year we had a number of authors from Asia. We saw our second
authors from China and first from Korea. We are pleased to see
outstanding entries from areas of the world that have not been active in
past contests. Will we see an upswing of entries from South America,
Africa and Antarctica next year? :-)</p>
<p>Please note that judging is done completely anonymously. Please do
NOT reveal your identity in your source code. In the future we may
disqualify entries that reveal the identity of the submitter!</p>
outstanding entries from areas of the world that have not been
active in past contests. Will we see an upswing of entries
from South America, Africa and Antarctica next year? :-)</p>
<p>Please note that judging is done completely anonymously. Please
do NOT reveal your identity in your source code. In the future we
may disqualify entries that reveal the identity of the submitter!</p>
<p>There were some outstanding entries that did not win. Unfortunately
some very good entries lost because they:</p>
<ul>
<li><p>would take years to execute</p></li>
<li><p>were way way oversize and didn’t even attempt to justify their
excess by a clever abuse of the rules</p></li>
<li><p>obfuscate themselves by simply invoking a complex state
machine</p></li>
<li><p>obfuscate themselves by simply invoking a complex
state machine</p></li>
<li><p>depend on a single obfuscation trick</p></li>
<li><p>could only be run on a particular vendor’s platform</p></li>
<li><p>were very similar to previous winning entries</p></li>
<li><p>were based on an overused theme such as yet another fractal
display program</p></li>
<li><p>were based on an overused theme such as yet another
fractal display program</p></li>
<li><p>didn’t work as documented</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>There is a risk in submitting an entry that is similar to a well used
theme by previous winning entries. Previous entries set a very high bar.
A new winning entry must not only compete against other submissions form
the current year, they must also excel over similar winning entry in
some particularly impressive way.</p>
<p>There is a risk in submitting an entry that is similar to a well
used theme by previous winning entries. Previous entries set a very high
bar. A new winning entry must not only compete against other submissions
form the current year, they must also excel over similar winning entry
in some particularly impressive way.</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-2012---the-21st-ioccc"><a name=inventory></a><a name=2012></a>Winning
Entries of 2012 - The 21st IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="2012/ioccc.2012.tar.bz2">2012 entry source</a></p>
<h1 id="winning-entries-of-2012---the-21st-ioccc"><a name=inventory></a><a name=2012></a>Winning Entries of 2012 - The 21st IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="2012/ioccc.2012.tar.bz2">2012 entry source</a></p>
<ul>
<li><a href="blakely/index.html">2012/blakely</a> - Most GIFted
expressions</li>
<li><a href="deckmyn/index.html">2012/deckmyn</a> - Most notable and
best tool</li>
<li><a href="dlowe/index.html">2012/dlowe</a> - Best way to lose a
life</li>
<li><a href="endoh1/index.html">2012/endoh1</a> - Most complex ASCII
fluid - Honorable mention</li>
<li><a href="endoh2/index.html">2012/endoh2</a> - PiE in the sky
award</li>
<li><a href="grothe/index.html">2012/grothe</a> - Most
conspiratorial</li>
<li><a href="hamano/index.html">2012/hamano</a> - Most elementary use of
C - Silver award</li>
<li><a href="blakely/index.html">2012/blakely</a> - Most GIFted expressions</li>
<li><a href="deckmyn/index.html">2012/deckmyn</a> - Most notable and best tool</li>
<li><a href="dlowe/index.html">2012/dlowe</a> - Best way to lose a life</li>
<li><a href="endoh1/index.html">2012/endoh1</a> - Most complex ASCII fluid - Honorable mention</li>
<li><a href="endoh2/index.html">2012/endoh2</a> - PiE in the sky award</li>
<li><a href="grothe/index.html">2012/grothe</a> - Most conspiratorial</li>
<li><a href="hamano/index.html">2012/hamano</a> - Most elementary use of C - Silver award</li>
<li><a href="hou/index.html">2012/hou</a> - Most useful obfuscation</li>
<li><a href="kang/index.html">2012/kang</a> - Best short program</li>
<li><a href="konno/index.html">2012/konno</a> - Best one liner</li>
<li><a href="omoikane/index.html">2012/omoikane</a> - Most
surreptitious</li>
<li><a href="omoikane/index.html">2012/omoikane</a> - Most surreptitious</li>
<li><a href="tromp/index.html">2012/tromp</a> - Most functional</li>
<li><a href="vik/index.html">2012/vik</a> - Best use of cocoa - Bronze
award</li>
<li><a href="zeitak/index.html">2012/zeitak</a> - Balanced use of
obfuscation - Gold award</li>
<li><a href="vik/index.html">2012/vik</a> - Best use of cocoa - Bronze award</li>
<li><a href="zeitak/index.html">2012/zeitak</a> - Balanced use of obfuscation - Gold award</li>
</ul>
<p> <strong>Jump to:</strong> <a href="#">top</a></p>