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

1996/index.html
+60 -79
View File
@@ -123,114 +123,95 @@
<!-- 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="thirteenth-international-obfuscated-c-code-contest">Thirteenth
International Obfuscated C Code Contest</h1>
<h1 id="thirteenth-international-obfuscated-c-code-contest">Thirteenth 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 an official home page: <a
href="https://www.ioccc.org">www.ioccc.org</a>, containing previous
winning entries, information about the judges, announcements and much
more.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD
or non-Unix systems the Makefile needs to be changed. See the Makefile
for details.</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 an official home page: <a href="https://www.ioccc.org">www.ioccc.org</a>,
containing previous winning entries, information about the judges,
announcements and much more.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD or non-Unix
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> i.e. the <code>-D</code> flag).</p>
<h2 id="where-are-larry-bassel-and-barbara-frezza">Where are Larry
Bassel and Barbara Frezza?</h2>
<h2 id="where-are-larry-bassel-and-barbara-frezza">Where are Larry Bassel and Barbara Frezza?</h2>
<p>It is not true that Larry Bassel avoided the 13th IOCCC on grounds of
superstition! Larry (as well as Landon) is fond of prime numbers. Larry
is so fond of prime numbers that he decided to become a graduate student
in number theory at UC San Diego. For this reason Larry decided to sit
out this year and plans to be back next year.</p>
<p>Barbara Frezza also went to San Diego to enter into law school at the
same time. Her cooking in the role of official chef was sorely missed.
We look forward to her return to the contest next year as well.</p>
<p>Both Larry and Barbara have taken important new steps in their lives
and we wish them the best. When it is all over, Larry will be able to
produce obfuscated mathematical proofs, and Barbara will be able
deobfuscate the many legal obfuscations. :-)</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the
entries</h2>
superstition! Larry (as well as Landon) is fond of prime numbers.
Larry is so fond of prime numbers that he decided to become a graduate
student in number theory at UC San Diego. For this reason Larry
decided to sit out this year and plans to be back next year.</p>
<p>Barbara Frezza also went to San Diego to enter into law school
at the same time. Her cooking in the role of official chef was
sorely missed. We look forward to her return to the contest
next year as well.</p>
<p>Both Larry and Barbara have taken important new steps in their
lives and we wish them the best. When it is all over, Larry will
be able to produce obfuscated mathematical proofs, and Barbara
will be able deobfuscate the many legal obfuscations. :-)</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>This year, <a href="../authors.html#Jens_Schweikhardt">Jens
Schweikhardt</a> won 3 times … a new IOCCC record. Meanwhile, <a
href="../authors.html#Brian_Westley">Brian Westley</a> came up with his
8th winning entry, twice the number of the next highest count. But with
people like Schweikhardt around, this lead could fall fast.</p>
<p>As we stated in the <a href="guidelines.txt">guidelines</a>, the
authors of the winning entries are as much news to us as they are to you
because we keep authorship separate from rest of the entry. Some people
have it, we guess!</p>
Schweikhardt</a> won 3 times
… a new IOCCC record. Meanwhile, <a href="../authors.html#Brian_Westley">Brian
Westley</a> came up with his 8th
winning entry, twice the number of the next highest count. But with people like
Schweikhardt around, this lead could fall fast.</p>
<p>As we stated in the <a href="guidelines.txt">guidelines</a>, the authors of the winning entries are
as much news to us as they are to you because we keep authorship separate from
rest of the entry. Some people have it, we guess!</p>
<p>There were a few very good entries that might have won if it were not
for the fact that they didn’t work. If you didn’t win, but think you had
a chance: test your program, fix it and submit it next year!</p>
<h2 id="a-few-notes-regarding-future-contests">A few notes regarding
future contests</h2>
for the fact that they didn’t work. If you didn’t win, but think you
had a chance: test your program, fix it and submit it next year!</p>
<h2 id="a-few-notes-regarding-future-contests">A few notes regarding future contests</h2>
<p>There will be no 1997 contest.</p>
<p>The next contest will not open until sometime in March 1998, and will
close sometime around the end of May 1998. The rules for the 1998
contest have not been formed at this time and are not expected to be
ready for distribution until late February 1998.</p>
<p>So what happened to 1997? Well the next USENIX Technical Conference
will be held Jun 15-19, 1998 (in New Orleans, US). The 18 month span
between conferences will cause the IOCCC to skip over 1997.</p>
<p>Be sure to wait until the 1998 rules are posted before submitting
entries. Rules differ from year to year, sometimes in significant
ways.</p>
will be held Jun 15-19, 1998 (in New Orleans, US). The 18 month
span between conferences will cause the IOCCC to skip over 1997.</p>
<p>Be sure to wait until the 1998 rules are posted before submitting entries.
Rules differ from year to year, sometimes in significant ways.</p>
<p>Please send us comments and suggestions what we have expressed above.
Also include anything else that you would like to see in future
contests. Send such email to:</p>
Also include anything else that you would like to see in future contests.
Send such email to:</p>
<pre><code>judges@toad.com</code></pre>
<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 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>
<h2 id="final-comments">Final Comments</h2>
<p><strong>IMPORTANT NOTE</strong>: The email addresses found above are
for historical purposes only, and should not be used today. 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>: The email addresses found above are for historical
purposes only, and should not be used today. 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) 1997,2023, Landon Curt Noll and Sriram Srinivasan. 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) 1997,2023, Landon Curt Noll and Sriram Srinivasan. 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-1996---the-13th-ioccc"><a name=inventory></a><a name=1996></a>Winning
Entries of 1996 - The 13th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="1996/ioccc.1996.tar.bz2">1996 entry source</a></p>
<h1 id="winning-entries-of-1996---the-13th-ioccc"><a name=inventory></a><a name=1996></a>Winning Entries of 1996 - The 13th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="1996/ioccc.1996.tar.bz2">1996 entry source</a></p>
<ul>
<li><a href="august/index.html">1996/august</a> - Best of Show</li>
<li><a href="dalbec/index.html">1996/dalbec</a> - Best Numerical
Obfuscation</li>
<li><a href="dalbec/index.html">1996/dalbec</a> - Best Numerical Obfuscation</li>
<li><a href="eldby/index.html">1996/eldby</a> - Best Output</li>
<li><a href="gandalf/index.html">1996/gandalf</a> - Best Layout</li>
<li><a href="huffman/index.html">1996/huffman</a> - Best Obfuscated
Character Set Utility</li>
<li><a href="huffman/index.html">1996/huffman</a> - Best Obfuscated Character Set Utility</li>
<li><a href="jonth/index.html">1996/jonth</a> - Best X11 Entry</li>
<li><a href="rcm/index.html">1996/rcm</a> - Best RFC Obfuscation</li>
<li><a href="schweikh1/index.html">1996/schweikh1</a> - Worst Abuse of
the C Preprocessor</li>
<li><a href="schweikh2/index.html">1996/schweikh2</a> - Best
Algorithm</li>
<li><a href="schweikh3/index.html">1996/schweikh3</a> - Best
Utility</li>
<li><a href="schweikh1/index.html">1996/schweikh1</a> - Worst Abuse of the C Preprocessor</li>
<li><a href="schweikh2/index.html">1996/schweikh2</a> - Best Algorithm</li>
<li><a href="schweikh3/index.html">1996/schweikh3</a> - Best Utility</li>
<li><a href="westley/index.html">1996/westley</a> - Best One Liner</li>
</ul>
<p> <strong>Jump to:</strong> <a href="#">top</a></p>