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

2015/index.html
+58 -86
View File
@@ -123,58 +123,46 @@
<!-- 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-fourth-international-obfuscated-c-code-contest">Twenty
Fourth International Obfuscated C Code Contest</h1>
<h1 id="twenty-fourth-international-obfuscated-c-code-contest">Twenty Fourth 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. This year we included most of the information included by the
submitter.</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>Look at the source and try to figure out what the programs do, and
run them with various inputs.</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
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. This year we included most of the
information included by the submitter.</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>Look at the source and try to figure out what the programs do, and run
them with various inputs.</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-winning-entries">Remarks on some of the
winning entries</h2>
<p>We believe you will again be impressed with this year’s winning
entries.</p>
<h2 id="remarks-on-some-of-the-winning-entries">Remarks on some of the winning entries</h2>
<p>We believe you will again be impressed with this year’s winning entries.</p>
<p>The fraction of worthy entries was higher than usual.</p>
<p>We call to your attention the <a href="hou/index.html">hou</a> entry
that performs the MD5 cryptographic hash. Normally implemented with a
set of integer and boolean operations, this code uses floating point
variables inside a single <code>while</code> loop filled with unusual
constants, cosine, square root, and exponent function calls. The number
of lines of code is also smaller than the original algorithm.</p>
<p>The <a href="mills2/index.html">mills2</a> source code is a very
compressed version of a decompression algorithm. We think those who
enjoy compression algorithms will particularly enjoy this entry.</p>
<p>We suggest that you attempt to completely understand the <a
href="endoh4/index.html">endoh4</a> 1-liner program: another impressive
compact piece of C code.</p>
<p>And while you are at it, cat the <a href="endoh2/prog.c">endoh2
prog.c</a> code. Compile it and look at the source code again.</p>
<p>In a “Back to the Future” moment, <a
href="endoh3/index.html">endoh3</a> gave us a twist on one of the all
time best IOCCC entries from 1984.</p>
<p>We also suggest that you take a very good look at how the <a
href="muth/index.html">muth</a> code makes full use of the C
Pre-Processor.</p>
<p>…We’ll stop spouting spoilers now. Have fun exploring all the
entries!</p>
<h2 id="remarks-on-some-of-submissions-that-did-not-win">Remarks on some
of submissions that did not win</h2>
<p>We call to your attention the <a href="hou/index.html">hou</a> entry that performs the MD5
cryptographic hash. Normally implemented with a set of integer and boolean
operations, this code uses floating point variables inside a single <code>while</code> loop
filled with unusual constants, cosine, square root, and exponent function calls.
The number of lines of code is also smaller than the original algorithm.</p>
<p>The <a href="mills2/index.html">mills2</a> source code is a very compressed version of a
decompression algorithm. We think those who enjoy compression algorithms will
particularly enjoy this entry.</p>
<p>We suggest that you attempt to completely understand the
<a href="endoh4/index.html">endoh4</a> 1-liner program: another impressive compact piece of
C code.</p>
<p>And while you are at it, cat the <a href="endoh2/prog.c">endoh2 prog.c</a> code. Compile it
and look at the source code again.</p>
<p>In a “Back to the Future” moment, <a href="endoh3/index.html">endoh3</a> gave us a twist on
one of the all time best IOCCC entries from 1984.</p>
<p>We also suggest that you take a very good look at how the
<a href="muth/index.html">muth</a> code makes full use of the C Pre-Processor.</p>
<p>…We’ll stop spouting spoilers now. Have fun exploring all the entries!</p>
<h2 id="remarks-on-some-of-submissions-that-did-not-win">Remarks on some of submissions that did not win</h2>
<p>The number of entries that would have made it into the final rounds
would have been much higher had some people paid attention to rules 2
and 22 (one third of 666).</p>
@@ -187,28 +175,23 @@ and 22 (one third of 666).</p>
| Identifying yourself, in an obvious way in your code, data, remarks
| or program output, unless you are Peter Honeyman or pretending
| to be Peter Honeyman, will be grounds for disqualification of your entry.</code></pre>
<p>A number of other entries were based on <a
href="iocccsize.c">iocccsize.c</a>, making derivative works rather than
original works.</p>
<p>Still other entries were too large, violating the first line of rule
2:</p>
<p>A number of other entries were based on <a href="iocccsize.c">iocccsize.c</a>, making
derivative works rather than original works.</p>
<p>Still other entries were too large, violating the first line of rule 2:</p>
<pre><code>2) The size of your program source must be &lt;= 4096 bytes in length.</code></pre>
<p>While these entries might have passed under the 2053 limit for
iocccsize, they were larger than &lt;= 4096 bytes, sometimes by an order
or magnitude.</p>
<p>While these entries might have passed under the 2053 limit for iocccsize,
they were larger than &lt;= 4096 bytes, sometimes by an order or magnitude.</p>
<p>We hope the authors of some of those entries will fix and re-submit
them for the next IOCCC.</p>
<h2 id="final-comments">Final Comments</h2>
<p>Please feel free to send us comments and suggestions about the
competition, this README or anything else that you would like to see in
future contests.</p>
<p>If you use, distribute or publish these entries in some way, please
drop us a line. We enjoy seeing who, where and how the contest is
used.</p>
<p>If you have problems with any of the entries, AND YOU HAVE A FIX,
please send us the fix (patch file or the entire changed file).</p>
<p>For the latest information on how to contact the IOCCC Judges please
visit</p>
<p>If you use, distribute or publish these entries in some way, please drop
us a line. We enjoy seeing who, where and how the contest is used.</p>
<p>If you have problems with any of the entries, AND YOU HAVE A FIX, please
send us the fix (patch file or the entire changed file).</p>
<p>For the latest information on how to contact the IOCCC Judges please visit</p>
<ul>
<li><a href="../contact.html">contact.html</a></li>
</ul>
@@ -217,44 +200,33 @@ visit</p>
<li><a href="../news.html">news.html</a></li>
</ul>
<h1 id="copyright-and-license">Copyright and License</h1>
<p>Copyright (C) 2015,2024, 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) 2015,2024, 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-2015---the-24th-ioccc"><a name=inventory></a><a name=2015></a>Winning
Entries of 2015 - The 24th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="2015/ioccc.2015.tar.bz2">2015 entry source</a></p>
<h1 id="winning-entries-of-2015---the-24th-ioccc"><a name=inventory></a><a name=2015></a>Winning Entries of 2015 - The 24th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="2015/ioccc.2015.tar.bz2">2015 entry source</a></p>
<ul>
<li><a href="burton/index.html">2015/burton</a> - Most Useful</li>
<li><a href="dogon/index.html">2015/dogon</a> - Most Crafty</li>
<li><a href="duble/index.html">2015/duble</a> - Best Handwriting</li>
<li><a href="endoh1/index.html">2015/endoh1</a> - Most Diffused
Reaction</li>
<li><a href="endoh2/index.html">2015/endoh2</a> - Most Overlooked
Obfuscation</li>
<li><a href="endoh3/index.html">2015/endoh3</a> - Back to the Future
Award</li>
<li><a href="endoh1/index.html">2015/endoh1</a> - Most Diffused Reaction</li>
<li><a href="endoh2/index.html">2015/endoh2</a> - Most Overlooked Obfuscation</li>
<li><a href="endoh3/index.html">2015/endoh3</a> - Back to the Future Award</li>
<li><a href="endoh4/index.html">2015/endoh4</a> - Best One-liner</li>
<li><a href="hou/index.html">2015/hou</a> - Most Well-rounded Hash</li>
<li><a href="howe/index.html">2015/howe</a> - Most Different</li>
<li><a href="mills1/index.html">2015/mills1</a> - For the Birds!
Award</li>
<li><a href="mills1/index.html">2015/mills1</a> - For the Birds! Award</li>
<li><a href="mills2/index.html">2015/mills2</a> - Most Compact</li>
<li><a href="muth/index.html">2015/muth</a> - Most Complete Use of
CPP</li>
<li><a href="schweikhardt/index.html">2015/schweikhardt</a> - Best
Documented</li>
<li><a href="muth/index.html">2015/muth</a> - Most Complete Use of CPP</li>
<li><a href="schweikhardt/index.html">2015/schweikhardt</a> - Best Documented</li>
<li><a href="yang/index.html">2015/yang</a> - Most Pointed Reaction</li>
</ul>
<p> <strong>Jump to:</strong> <a href="#">top</a></p>