Landon Curt Noll
4ee4c731f7
While not strictly necessary, replacing the two ASCII tab characters in the markdown copyright comment makes it easier to detect problematic TAB indentation within markdown files. After this commit, only 90 markdown files have leading ASCII TAB characters. And again, while not strictly necessary, we can consider running expand on those 90 markdown files to see what effect that might have on the HTML files they produce. Replace leading ASCII TAB characters with multiples of 8 ASCII SPACE characters (the default action of the `expand(1)` tool) might have an negative effect on some HTML formatting where **hack-a-round** formatting was attempted to fix broken indentation caused by problematic ASCII TAB characters. Think of this as a baseline for evaluating leading TAB characters within markdown files. TODO: Consider either using `expand(1)` to replace leading ASCII TAB characters with multiples of 8 ASCII SPACE characters AND/OR modifying the appropriate `bin` tool to convert leading ASCII TAB characters into multiples of 8 ASCII SPACE characters.
Eighteenth International Obfuscated C Code Contest
Standard IOCCC stuff
View the index.html web page for the given winning entry for information on how
on how to 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.
The IOCCC has a website and now has a number of international mirrors. The primary site can be found at https://www.ioccc.org/.
Use make(1) to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
This year we included most of the information included by the submitters
in the README.md files (that were used to build the index.html web pages).
Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a #define).
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.
Remarks on some of the entries
We believe you will be impressed with this year's winning entries.
In particular:
-
The Abuse of the rules - 2005/klausler used local dictionary data to get around the size limit.
-
The Most beauteous visuals - 2005/vince made clever use of
{}s and whitespace in their source code and during execution. -
The Most circuitous walk - 2005/vik entry is just amazing.
-
The Best game - 2005/toledo makes full use of its single function.
-
The Best emulator - 2005/sykes may allow you to reconnect to your first PET.
-
Our Best of Show - 2005/persano this year was simply (or non-simply :-) ) the best!
-
(And we need only mention (parenthetically speaking) that the Best use of parenthesis is self reproducing).
-
The Most sonorous output - 2005/jetro might
sound:-) like a good idea. -
The Best 2D puzzle - 2005/giljade takes editorial license with expressions as well as the with the vi editor.
-
The Most ambiguous language - 2005/chia entry is really a C program.
-
The Most superfluous output - 2005/boutines entry is simply Voronoi-lific!
-
Try not to have your sense of good coding offended by the Most discourteous interpreter - 2005/timwi entry.
-
The Best use of the www - 2005/mynx doesn't include those letters.
-
You will be puzzled by the Best 3D puzzle - 2005/anon entry; we are sure!
-
The Most ingenious puzzle solution - 2005/aidan might puzzle you more while it puzzles out some puzzles: all in a puzzling way! :-)
Remarks on some of the losing entries
There were some outstanding entries that did not win. Unfortunately some very good entries lost because they:
-
depended too much on non-portable side effects in expressions; and/or
-
depended too much on a particular byte order; and/or
-
required the use of a special script, data file or pseudo-machine language that was not supplied with the entry.
We hope the authors of some of those entries will fix and resubmit them for the next IOCCC.
Final Comments
IMPORTANT NOTE: See contact.html for up to date contact details as well as details on how to provide fixes to any of the entries. See also the IOCCC FAQ for additional information on the IOCCC.