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

2013/index.html
+52 -77
View File
@@ -123,43 +123,36 @@
<!-- 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-second-international-obfuscated-c-code-contest">Twenty
Second International Obfuscated C Code Contest</h1>
<h1 id="twenty-second-international-obfuscated-c-code-contest">Twenty Second 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 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">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 might
require certain changes (add or remove a library, add or remove a
<code>#define</code> i.e. <code>-D</code> flag).</p>
<p>View the <code>index.html</code> web page for the given winning entry for information on how
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">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 might require
certain changes (add or remove a library, add or remove a <code>#define</code> i.e. <code>-D</code>
flag).</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 again be impressed with this year’s winning
entries.</p>
<p>This year, 9 won 15 awards. For the first time in the history of the
contest, one person, <a href="../authors.html#Yusuke_Endoh">Yusuke
Endoh</a> won 4 times while <a
href="../authors.html#Adrian_Cable">Adrian Cable</a> won 3 times! It is
also worth noting that <a href="../authors.html#Christopher_Mills">Chris
Mills</a> last win was in 1993. Welcome back Chris!</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>We believe you will again be impressed with this year’s winning entries.</p>
<p>This year, 9 won 15 awards. For the first time in the history of the contest,
one person, <a href="../authors.html#Yusuke_Endoh">Yusuke Endoh</a> won
4 times while <a href="../authors.html#Adrian_Cable">Adrian Cable</a>
won 3 times! It is also worth noting that <a href="../authors.html#Christopher_Mills">Chris
Mills</a> last win was in 1993.
Welcome back Chris!</p>
<p>We, the judges, were very surprised by this as many of the multiple
authors submitted very different styles of entries.</p>
<p>This year was the first time the IOCCC size tool was used. Entries
had to print a value 2053 or less when the <code>-i</code> flag was
used.</p>
<p>Several people discovered an undocumented feature in that certain
comments such as:</p>
had to print a value 2053 or less when the <code>-i</code> flag was used.</p>
<p>Several people discovered an undocumented feature in that
certain comments such as:</p>
<div class="sourceCode" id="cb1"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb1-1"><a href="#cb1-1" aria-hidden="true" tabindex="-1"></a> <span class="co">///*</span></span></code></pre></div>
<p>or:</p>
<div class="sourceCode" id="cb2"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb2-1"><a href="#cb2-1" aria-hidden="true" tabindex="-1"></a> <span class="op">*</span>\</span>
@@ -168,9 +161,9 @@ comments such as:</p>
<pre><code>In cases where the above summary and the algorithm implemented by
the IOCCC size tool source code conflict, the algorithm implemented
by the IOCCC size tool source code is preferred by the judges.</code></pre>
<p>so this abuse was allowed (and encouraged). The judges hope that the
IOCCC size tool author will patch the tool to block this kind of size
abuse in future contests.</p>
<p>so this abuse was allowed (and encouraged). The judges hope that
the IOCCC size tool author will patch the tool to block this kind
of size abuse in future contests.</p>
<p>There were some outstanding entries that did not win. Unfortunately
some very good entries lost because they:</p>
<ul>
@@ -181,64 +174,46 @@ excess by a clever abuse of the rules</li>
<li>were very similar to previous winning entry</li>
<li>didn’t work as documented</li>
</ul>
<p>We hope that the authors of some of those entries will fix and
resubmit 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 entry must not only compete against other submissions from the
current year but they must also excel over similar previous winning
entry in some particularly impressive way.</p>
<p>We hope that the authors of some of those entries will fix and resubmit 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 entry must not
only compete against other submissions from the current year but they must also
excel over similar previous 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) 2013,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) 2013,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-2013---the-22nd-ioccc"><a name=inventory></a><a name=2013></a>Winning
Entries of 2013 - The 22nd IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="2013/ioccc.2013.tar.bz2">2013 entry source</a></p>
<h1 id="winning-entries-of-2013---the-22nd-ioccc"><a name=inventory></a><a name=2013></a>Winning Entries of 2013 - The 22nd IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="2013/ioccc.2013.tar.bz2">2013 entry source</a></p>
<ul>
<li><a href="birken/index.html">2013/birken</a> - Best painting
tool</li>
<li><a href="cable1/index.html">2013/cable1</a> - Most partisan
1-liner</li>
<li><a href="birken/index.html">2013/birken</a> - Best painting tool</li>
<li><a href="cable1/index.html">2013/cable1</a> - Most partisan 1-liner</li>
<li><a href="cable2/index.html">2013/cable2</a> - Best of show</li>
<li><a href="cable3/index.html">2013/cable3</a> - Largest small system
emulator</li>
<li><a href="dlowe/index.html">2013/dlowe</a> - Best sparkling
utility</li>
<li><a href="cable3/index.html">2013/cable3</a> - Largest small system emulator</li>
<li><a href="dlowe/index.html">2013/dlowe</a> - Best sparkling utility</li>
<li><a href="endoh1/index.html">2013/endoh1</a> - Most lazy SKIer</li>
<li><a href="endoh2/index.html">2013/endoh2</a> - Most recyclable</li>
<li><a href="endoh3/index.html">2013/endoh3</a> - Most tweetable
1-liner</li>
<li><a href="endoh3/index.html">2013/endoh3</a> - Most tweetable 1-liner</li>
<li><a href="endoh4/index.html">2013/endoh4</a> - Most solid</li>
<li><a href="hou/index.html">2013/hou</a> - Best use of 1 Infinite
Loop</li>
<li><a href="mills/index.html">2013/mills</a> - Most timely
rendered</li>
<li><a href="hou/index.html">2013/hou</a> - Best use of 1 Infinite Loop</li>
<li><a href="mills/index.html">2013/mills</a> - Most timely rendered</li>
<li><a href="misaka/index.html">2013/misaka</a> - Most catty</li>
<li><a href="morgan1/index.html">2013/morgan1</a> - Smallest large
system simulator</li>
<li><a href="morgan2/index.html">2013/morgan2</a> - Most playfully
versatile</li>
<li><a href="robison/index.html">2013/robison</a> - Most poetic use of
strings</li>
<li><a href="morgan1/index.html">2013/morgan1</a> - Smallest large system simulator</li>
<li><a href="morgan2/index.html">2013/morgan2</a> - Most playfully versatile</li>
<li><a href="robison/index.html">2013/robison</a> - Most poetic use of strings</li>
</ul>
<p> <strong>Jump to:</strong> <a href="#">top</a></p>