mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add preview of 1984-2019

Browse Source 
The 2020 winners are hinted it, but the source code is not there,
nor are the hints. Someone could look into the HTML and
see what was commented out, but that is not a problem because
WHO won is known and the name of their AWARD is known already.
Moreover a number of the winners have talked about what their
entirs do, so the commented out spoiler text is not a bit problem.

One will find HTML commented out with:

    <!-- XXX remove when 2020 is ready
    2020 links here
    XXX remove when 2020 is ready -->

The "XXX remove when 2020 is ready" string is found at the
start and end comment blocks.  Again, soneone could read
what was commented out, but that is OK since most of that
information is known or can be known.  The following files
have such HTML comment blocks in them.

    ./winners.html
    ./years-spoiler.html
    ./years.html

In addition, ./all/summary.txt was modified to not
include the 2020 entries for the momemt.

The 2020 winner code AND write-ups are NOT part of this set.

p.s. The all/all.tar.bz2 does not contain the 2020 source code (yet?).
This commit is contained in:
Landon Curt Noll committed 2020-12-30 16:57:03 -08:00
1 parent 28efc67f5d
commit c0663537cb
1683 files changed
+220064
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2020/guidelines.txt
+996
View File
@@ -0,0 +1,996 @@
| 27th International Obfuscated C Code Contest Official Guidelines
| Copyright (C) 2006-2019 Leonid A. Broukhis, Simon Cooper, Landon Curt Noll.
All Rights Reserved. Permission for personal, education or non-profit use is
granted provided this this copyright and notice are included in its entirety
and remains unaltered. All other uses must receive prior permission in
writing from the contest judges.
| This guidelines file is version 2019-06-15-v27.
Most of the changes from the previous IOCCC guideline set
have been marked with a "|" on the left hand side of the line.
ABOUT THIS FILE:
This file contains guidelines intended to help people who wish to
submit entries to the International Obfuscated C Code Contest (IOCCC).
This is not the IOCCC rules, though it does contain comments about
them. The guidelines should be viewed as hints and suggestions.
Entries that violate the guidelines but remain within the rules are
allowed. Even so, you are safer if you remain within the guidelines.
You should read the current IOCCC rules, prior to submitting entries.
The rules are typically sent out with these guidelines.
We recommend that you follow the twitter handle:
@IOCCC
to learn about IOCCC news, important IOCCC related alerts, IOCCC
reminders, and changes to the rules and these guidelines.
You do not have to be a twitter user to follow @IOCCC. Non-twitter
users should access:
https://twitter.com/ioccc
Non-twitter users should force their browsers to reload the above URL
to be sure they are seeing the most recent tweets.
While we try to post use news at:
http://www.ioccc.org/index.html#news
such postings may be delayed or obscured by slow to respond mirrors.
| WHAT'S NEW IN 2019/2020:
This IOCCC runs from:
| 2019-Dec-26 06:01:41 UTC
to:
| 2020-Mar-15 06:26:49 UTC
| The reason for the times of day are so that key IOCCC events occur during UTC
| "prime time". Do you understand why we factored this into the rules and
| guidelines? :-)
Until the start of this IOCCC, these rules, guidelines and iocccsize.c tool
should be considered provisional BETA versions and may be adjusted
at any time.
| Even though the contest will start in 2019, because the contest will close
| in 2020, URLs, subject lines, and contest related email addresses use 2019.
The IOCCC submission URL:
https://submit.ioccc.org/
| The submit URL should be active on or slightly before 2020-Jan-15 12:21:37 UTC.
Please wait to submit your entries until after that time.
The official rules, guidelines and iocccsize.c tool will be available
on the official IOCCC web site on or slightly before start of this IOCCC.
Please check the IOCCC web site "How to enter" link:
http://www.ioccc.org/index.html#enter
on or after the start of this IOCCC to be sure you are using the correct
versions of these items before using the IOCCC entry submission URL.
HINTS AND SUGGESTIONS:
You are encouraged to examine the winners of previous contests. See
FOR MORE INFORMATION for details on how to get previous winners.
Keep in mind that rules change from year to year, so some winning entries
may not be valid entries this year. What was unique and novel one year
might be 'old' the next year.
An entry is usually examined in a number of ways. We typically apply
a number of tests to an entry:
* look at the original source
* convert ANSI tri-graphs to ASCII
* C pre-process the source ignoring '#include' lines
* C pre-process the source ignoring '#define' and '#include' lines
* run it through a C beautifier
* examine the algorithm
* compile it (with flags to enable all warnings)
* execute it
You should consider how your entry looks in each of the above tests.
You should ask yourself if your entry remains obscure after it has been
'cleaned up' by the C pre-processor and a C beautifier.
Your entry need not pass all of the above tests. In certain
cases, a test is not important. Entries that compete for the
'strangest/most creative source layout' need not do as well as
others in terms of their algorithm. On the other hand, given
two such entries, we are more inclined to pick the entry that
does something interesting when you run it.
We try to avoid limiting creativity in our rules. As such, we leave
the contest open for creative rule interpretation. As in real life
programming, interpreting a requirements document or a customer request
is important. For this reason, we often award 'worst abuse of the
rules' to an entry that illustrates this point in an ironic way.
We do realize that there are holes in the rules, and invite entries
to attempt to exploit them. We will award 'worst abuse of the rules'
and then plug the hole next year. Even so, we will attempt to use
| the smallest plug needed, if not smaller. Or, maybe not. :-)
| There may be less than 2^7-1 reasons why these guidelines seem obfuscated.
Check out your program and be sure that it works. We sometimes make
the effort to debug an entry that has a slight problem, particularly
in or near the final round. On the other hand, we have seen some
of the best entries fall down because they didn't work.
We tend to look down on a prime number printer that claims that
16 is a prime number. If you do have a bug, you are better off
documenting it. Noting "this entry sometimes prints the 4th power
of a prime by mistake" would save the above entry. And sometimes,
a strange bug/feature can even help the entry! Of course, a correctly
working entry is best. Clever people will note that 16 might be prime
under certain conditions. Wise people, when submitting something clever
will fully explain such cleverness in their entry's remarks file.
People who are considering to just use some complex mathematical
function or state machine to spell out something such as "hello,
world!" really really, and we do mean really, do need to be more creative.
Ultra-obfuscated programs are, in some cases, easier to
deobfuscate than subtly-obfuscated programs. Consider using
misleading or subtle tricks layered on top of or under an
appropriate level of obfuscation. A clean looking program with
misleading comments and variable names might be a good start.
When programs use VTxxx/ANSI sequences, they should NOT limited to a
specific terminal brand. Those programs that work in a standard xterm
are considered more portable.
| Rule 2 (the size rule) refers to the use of an IOCCC size tool.
| The source for this tool is found at:
| http://www.ioccc.org/2020/iocccsize.c
To further clarify rule 2, we subdivided it into two parts, 2a and 2b.
| Your entry must satisfy BOTH the maximum size rule 2a AND your entry
must satisfy the IOCCC size tool rule 2b.
The IOCCC size tool should be compiled as:
cc -pedantic -Wall -Wextra -std=c11 iocccsize.c -o iocccsize
This tool imposes a 2nd limit on C code size (rule 2b). To check your
code against the 2nd limit of rule 2, use the -i command line option.
For example:
./iocccsize -i < prog.c
The IOCCC size tool, when using the -i option, may be summarized as:
The size tool counts most C reserved words (keyword, secondary,
and selected preprocessor keywords) as 1. The size tool counts all
other octets as 1 excluding ASCII whitespace, and excluding any
';', '{' or '}' followed by ASCII whitespace, and excluding any
';', '{' or '}' octet immediately before the end of file.
ASCII whitespace includes ASCII tab, ASCII space, ASCII newline,
ASCII formfeed, and ASCII carriage return.
| When ';', '{' or '}' are within a C string, they may still not be
| counted by the IOCCC size tool. This is a feature, not a bug!
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.
There are at least 2 other reasons for selecting 2053 as the 2nd limit
besides the fact that 2053 is the next prime > 2048. These reasons
may be searched for and discovered if you are "Curios!" about 2053. :-)
Moreover, 2053 was the number of the kernel disk pack of one of the
judge's BESM-6.
Take note that this secondary limit imposed by the IOCCC size tool
obviates some of the need to #define C reserved words in an effort
to get around the size limits of rule 2.
Yes Virginia, that is a hint!
| We applaud programs that do not issue warnings when compiled.
| To avoid warnings, you might be tempted to add various -Wno-foobar
| flags. Unfortunately such flags are NOT portable. Moreover,
| such flags are not consistent between different C compilers.
| Therefore we recommend that you consider one of several approaches:
|
| a) Write code that does not generate compiler warnings
| b) Do not use flags that disable compiler warnings
| c) Provide instructions (such as in your Makefile) that
| uses appropriate disable compiler warnings flags for
| both clang and gcc
| d) Do something creative
OUR LIKES AND DISLIKES:
Doing masses of #defines to obscure the source has become 'old'. We
tend to 'see thru' masses of #defines due to our pre-processor tests
that we apply. Simply abusing #defines or -Dfoo=bar won't go as far
as a program that is more well rounded in confusion.
Many C compilers dislike the following code, and so do we:
#define d define
#d foo /* <-- don't expect this to turn into #define foo */
When declaring local or global variables, you should declare the type:
int this_is_fine;
this_is_not; /* <-- Try to avoid implicit type declarations */
We suggest that you compile your entry with a commonly available
c11 (formerly C1X) C compiler (ISO/IEC 9899:2011).
Do not assume that optional c11 features are supported. If you
must use an optional c11 feature, use feature test macros so
that implementations without such optional c11 features will see
an entry that is both functional and interesting.
We like entries that have workarounds that allow someone with
an older c99 (ISO/IEC 9899:1999) compiler to be able to compile
and enjoy your entry.
We really like "lint free" code. However lint is a toll of the past.
So try to ensure that your entry compiles warning free. If possible,
to compile compile your code using:
-Wall -Wextra -pedantic
For compilers, such as clang, that have the -Weverything option, try
to make your code compile warning free using:
-Wall -Wextra -Weverything -pedantic
If you must turn off various warnings on the compile line such as:
... -Wno-empty-body -Wno-return-type ...
be sure to clearly state so in your remarks AS WELL AS in
your "how to build" / Makefile.
All other things being equal, a program that must turn off fewer
warnings will be considered better, for certain values of better.
Unless you clearly state otherwise in your remarks AS WELL AS in
your "how to build" / Makefile we will compile using:
-O3 -std=c11
Anyone care to submit an entry that makes gratuitous use of all
of the c11 reserved words in their intended C language contexts?
NOTE: As with the use of the word Belgium, the use of certain gratuitous
c11 reserved words may be completely banned in all parts of the Galaxy,
except in one small part (ISO/IEC 9899:2011) where they might not truly
understand the implications of such words.
http://hitchhikers.wikia.com/wiki/Belgium
http://www.bezem.de/pdf/ReservedWordsInC.pdf
DO NOT assume that we will use gcc to compile your program.
We will first try to compile your program using Clang.
It is much better to not use any obscure compiler flags if
you can help it. We want to discourage the use of obscure compiler
flags that would make the program less portable.
One side effect of the above is that you cannot assume the use
of nested functions such as:
main() {
| void please_do_not_submit_this() {
| printf("The machine that goes BING!\n");
}
| please_do_not_submit_this();
}
This is because such nested functions often requires one to compile with
a flag such as -fnested-functions that is not found on some compilers.
On 2012 July 20, the judges rescinded the encouragement of
nested functions. Such constructions, while interesting and sometimes
amusing, will have to wait until they required by a C standard that are
actually implemented in commonly used C compilers. Sorry!
| We prefer programs that do not require a fish license: crayons and
| cat detector vans not withstanding.
If your entry uses functions that have a variable number of
arguments, be careful. Systems implement va_list as a wide variety
of ways. Because of this, a number of operations using va_list are
not portable and must not be used:
* assigning a non-va_list variable to/from a va_list variable
* casting a non-va_list variable into/from a va_list variable
* passing a va_list variable to a function expecting a non-va_list arg
* passing a non-va_list variable to a function expecting a va_list arg
* performing arithmetic on va_list variables
* using va_list as a structure or union
In particular, do not treat va_list variables as if they were a char **'s.
Avoid using <varargs.h>. Use <stdarg.h> instead.
On 28 January 2007, the Judges rescinded the requirement that the
'#" in a C preprocessor directive must be the 1st non-whitespace octet.
The exit() function returns void. Some broken systems have exit()
return int, your entry should assume that exit() returns a void.
| This guideline has a change mark at the very start of this line.
Small programs are best when they are short, obscure and concise.
While such programs are not as complex as other winners, they do
serve a useful purpose. They are often the only program that people
attempt to completely understand. For this reason, we look for
programs that are compact, and are instructional.
While those who are used to temperatures found on dwarf planet,
(yes Virginia, dwarf planets are planets) such as Pluto might be able to
explain to the Walrus why our seas are boiling hot, the question of
whether pigs have wings is likely to remain a debatable point to most.
One line programs should be short one line programs: say around 80 to 120
octets long. Going well beyond 140 octets is a bit too long to be called
a one-liner in our vague opinion.
We tend to dislike programs that:
* are very hardware specific
* are very OS version specific
(index/strchr differences are OK, but socket/streams specific
code is likely not to be)
* dump core or have compiler warnings
(it is OK only if you warn us in the 'remark' header item)
* won't compile or run under a POSIX P1003.1/P1003.2 like systems
* depend on a utility or application not normally found on most
most POSIX P1003.1/P1003.2 like systems
* abuse the build file to get around the size limit
* obfuscate by excessive use of ANSI tri-graphs
* are longer than they need to be
* are "blob-ier" than they need to be
* are rather similar to previous winners :-(
* are too similar to previous losers :-)
| * that mandate the exclusive the use of an specific Integrated
| Development Environment (IDE)
| In order to encourage entry portability, we dislike entries that
| fail to build unless one is using an IDE. For example, do not
| mandate that one must use Microsoft Visual Studio to compile
| your entry. Nevertheless some of the better IDEs have command-line
| interfaces to their compilers, once one learns how to invoke a shell.
| The program must compile and link cleanly in a POSIX-like environment.
| Therefore do not assume the system has a windows.h include file:
|
| #include <windows.h> /* we dislike this include */
Unless you are cramped for space, or unless you are entering the
'best one liner' category, we suggest that you format your program
in a more creative way than simply forming excessively long lines.
At least one judge prefers to maintain the use of the leap-second
as part of the world's time standard. If your code prints time
with seconds, we prefer that your code be capable of printing the
time of day during a leap-second where the value in seconds
after the minute mark is 60.
The "how to build" make process should not be used to try and get
around the size limit. It is one thing to make use of a several -D's
| on the compile line to help out, but it is quite another to use many
bytes of -D's in order to try and squeeze the source under the size limit.
| Your source code, post-pre-processing, should not exceed the size
| of Windows. :-)
The judges, as a group, have a history giving wide degree of latitude
to reasonable entries. And recently they have had as much longitudinal
variation as it is possible to have on Earth. :-)
You should try to restrict commands used on the build file to
POSIX-like or common Un*x-like commands. You can also compile
and use your own programs. If you do, try to build and execute
from the current directory. This restriction is not a hard and
absolute one. The intent is to ensure that the building if your
program is reasonably portable.
We prefer programs that are portable across a wide variety of Un*x-like
operating systems (i.e., Linux, GNU Hurd, BSD, Un*x, etc.).
You are in a maze of twisty guidelines, all different.
There are at least zero judges who think that Fideism has little
or nothing to do with the IOCCC judging process.
Don't forget that the building of your program should be done
***without human intervention***. So don't do things such as:
prog: prog.c
#echo this next line requires data from standard input
cat > prog.c
${CC} prog.c -o prog
However, you can do something cute such as making your program
do something dumb (or cute) when it is built 'automatically'. And
when it is run with a human involved, do something more clever.
For example, one could use the build instructions:
prog: prog.c
${CC} prog.c -DNON_HUMAN_COMPILE -o prog
@echo "See remarks section about alternate ways to compile"
and then include special notes in the program "remarks" for
alternate / human intervention based building.
We want to get away from source that is simply a compact blob of
octets. Really try to be more creative than blob coding. *HINT!*
Please do not use things like gzip to get around the size limit.
Please try to be much more creative.
We really dislike entries that make blatant use of including
large data files to get around the source code size limit.
We do not recommend submitting systemd source code to the IOCCC,
if nothing else because that code is likely to exceed the source code
size limit. This isn't to say that another highly compact and obfuscated
replacement of init would not be an interesting submission.
Did we remember to indicate that programs that blatantly use
some complex state machine to do something simple are boring?
We think we did. :-)
All generalizations are false, including this one. -- Mark Twain
Given two versions of the same program, one that is a compact blob
of code, and the other that is formatted more like a typical C
program, we tend to favor the second version. Of course, a third
version of the same program that is formatted in an interesting
and/or obfuscated way, would definitely win over the first two!
Remember, you can submit more than one entry. See the rules for details.
We suggest that you avoid trying for the 'smallest self-replicating'
source. The smallest, a zero byte entry, won in 1994.
Programs that claim to be the smallest C source that does something, really
better be the smallest such program or they risk being rejected because
they do not work as documented.
Please note that the C source below, besides lacking in obfuscation,
is NOT the smallest C source file that when compiled and run, dumps core:
main;
We do not like writable strings. That is, we don't want stuff like:
char *T = "So many primes, so little time!";
...
T[14] = ';';
Please don't make use of this feature, even if your system allows it.
However, initialized char arrays are OK to write over. This is OK:
char b[] = "Is this OK";
b[9] = 'K';
| There are more than one typos in this very sentence.
X client entries should be as portable as possible. Entries that
adapt to a wide collection of environments will be favored. For
example, don't depend on a particular type or size of display.
Don't assume the use of a particular browser. Instead assume a
generic browser that forms to a widely used W3C standard.
Don't assume a particular sound sub-system or video driver is installed
in the OS. Instead, make use of a well known and widely available open
source program (one that actually works) to display audio/visual data.
X client entries should avoid using X related libraries and
software that is not in wide spread use.
This is the only guideline that contains the word fizzbin.
| However, do you know how to play fizzbin? You do?!? (Except on Tuesday)
We don't like entries that use proprietary toolkits such as the M*tif,
Xv*ew, or OpenL*ok toolkits, since not everyone has them. Use of an
open source toolkit that is widely and freely available instead.
| The previous guideline in this spot has been replaced by this guideline:
| ------------------------------------------------------------------------
X client entries should not to depend on particular items on
.Xdefaults. If you must do so, be sure to note the required lines
in the program "remarks". They should also not depend on any
particular window manager.
Try to avoid entries that play silent sound segments or play the
Happy Birthday song; music that some people believe is copyrighted
(even if such copyrights appear to be bogus and/or blatant abuses of
the copyright system).
While we recognize that UN*X is not a universal operating system, the
contest does have a bias towards such systems. In an effort to expand
the scope of the contest, we phrase our bias in terms of POSIX P1003.1
and P1003.2 standards. This will allow certain non-UN*X OS users to
submit entries. On the other hand, this is a guideline and not a rule.
We will not reject an entry based on some POSIX technicality.
When dealing with OS and application environments, we suggest that you
be reasonable with a nod towards vanilla UN*X-like systems. POSIX will
evolve but not as much as the contest.
You very well might not be completely prohibited from failing to not
partly misunderstand this particular guideline, but of course we could
| not possibly comment. Nevertheless, you are neither prohibited, nor are
| you required to determine that this or the previous sentence is either false
| and/or misleading. Therefore, it might be wise for you to not fail to consider
| to do so, accordingly. Thank you.
Any complaints about the above guideline could be addressed to the
Speaker of the House of Commons, or to the speaker of your national
| parliament should you have one.
We like programs that:
* are as concise and small as they need to be
* do something at least quasi-interesting
* are portable
* are unique or novel in their obfuscation style
* MAKE USE OF A NUMBER OF DIFFERENT TYPES OF OBFUSCATION <== HINT!!
* make us laugh and/or throw up :-) (humor really helps!)
* make us want to eat good chocolate.
Some types of programs can't excel (anti-tm) in some areas. Your
program doesn't have to excel in all areas, but doing well in several
areas really does help.
You are better off explaining what your entry does in the program
"remarks" section rather than leaving it obscure for the judges
as we might miss something and/or be too tired to notice.
| Please avoid this specific individual guideline, if at all possible.
We freely admit that interesting, creative or humorous comments in
the program "remarks" help your chances of winning. If you had to
read so many twisted entries, you too would enjoy a good laugh or two.
We think the readers of the contest winners do as well. We do read
the program "remarks" during the judging process, so it is worth your
while to write remarkable program "remarks".
We dislike C code with trailing control-M's (\r or \015) that results
in compilation failures. Some non-Un*x/non-Linux tools such as
MS Visual C and MS Visual C++ leave trailing control-M's on lines.
Users of such tools should strip off such control-M's before submitting
their entries. In some cases tools have a "Save As" option that will
prevent such trailing control-M's being added.
One should restrict libcurses to portable features found on BSD
or Linux curses.
Rule 13 states any C source that fails to compile because of unescaped
octets with the high bit set (octet value >= 128) will be rejected.
Instead of unescaped octets, you should use \octal or \hex escapes:
/* 123456789 123456789 123456789 123456 */
char *foo = "This string is 36 octets in length \263";
/* This octet requires 4 octets of source ^^^^ */
if (strlen(foo) == 36) printf("foo is 36 octets plus a final NUL\n");
else printf("This code should not print this message\n");
It is a very good idea to, in your remarks file, tell us why you
think your entry is obfuscated. This is particularly true if
your entry is has some very subtle obfuscations that we might
otherwise overlook. <<-- Hint!
Anyone can format their code into a dense blob. A really clever
author will try format their entry using a "normal" formatting style
such that at first glance (if you squint and don't look at the details)
the code might pass for non-obfuscated C. Deceptive comments,
and mis-leading formatting, in some cases, may be a plus. On the
other hand, a misleading code style requires more source bytes.
If you do elect to use misleading formatting and comments, we
suggest you remark on this point in your remarks where you talk
about why you think your entry is obfuscated. On the other hand,
if you are pushing up against the size limits, you may be forced
into creating a dense blob. Such are the trade offs that obfuscators face!
We prefer code that can run on either a 64-bit or 32-bit processor.
However, it is unwise to assume it will run on an i386 or x86 architecture.
We believe that Mark Twain's remark:
Get your facts first, then you can distort them as you please.
is a good guideline for those writing code for the IOCCC.
The IOCCC size tool source, iocccsize.c, is not an original work,
| unless you are Anthony C Howe, in which case it is original!
| Submitting source that uses the content iocccsize.c, unless you are
| Anthony C Howe, might run the risk of violating rule 7.
Rule 7 does not prohibit you from writing your own obfuscated IOCCC size tool.
However if you do, you might wish to make your tool do something more
interesting than simply implementing the IOCCC size tool algorithm.
While programs that only run in a specific word size are OK. If you have
to pick, choose a 64-bit word size.
If we are feeling ornery we might choose to compile your program
for running on an Arduino or a PDP-11. Heck, should we ever find
an emulator of 60-bit CDC Cyber CPU running a POSIX-like OS, we
might just try your entry on that emulator as well :-)
If your entry MUST run only in 32-bit mode on an Intel processor, add the
following compiler flag:
-arch i386
to your "how to build" make compile line. For example:
prog: prog.c
${CC} prog.c -arch i386 -o prog
Be even more creative!
If there are limitations in your entry, you are highly encouraged
to note such limitations in your remarks file. For example if your
entry factors values up to a certain size, you might want to state:
This entry factors values up 2305567963945518424753102147331756070.
Attempting to factor larger values will produce unpredictable results.
The judges might try to factor the value -5, so you want to might state:
This entry factors positive values up 2305567963945518424753102147331756070.
Attempting to factor large values will produce unpredictable results.
However the judges might try to also factor 0, so you want to might state:
This entry factors values between 1 and 2305567963945518424753102147331756070.
Attempting to factor values outside that range will produce unpredictable results.
Moreover the try to also factor 3.5 or 0x7, or Fred, so you want to might state:
This entry factors integers between 1 and 2305567963945518424753102147331756070.
Attempting to factor anything else will produce unpredictable results.
You entry might be better off catching the attempt to factor bogus values
and doing something interesting. So you might want to code accordingly and state:
This entry factors integers between 1 and 2305567963945518424753102147331756070.
Attempting to factor anything else will cause the program to insult your
pet fish Eric.
The judges might not have a pet fish named Eric, so might want to state:
This entry factors integers between 1 and 2305567963945518424753102147331756070.
Attempting to factor anything else will cause the program to insult your
pet fish Eric, or in the case that you lack such a pet, will insult the
pet that you do not have.
When all other things are equal, an entry with fewer limitation will be judged
better than an entry with lots of limitations. So you might want to code accordingly
and state:
This entry attempts to a factor value of any size provided that the program
is given enough time and memory. If the value is not a proper integer, the
program will insult a fish named Eric, even if such a fish does not exist.
ABUSING THE RULES:
Legal abuse of the rules is somewhat encouraged. Legal rule abuse may
involve, but is not limited to, doing things that are technically
allowed by the rules and yet do not fit the spirit of what we intended
to be submitted.
Legal rule abuse is encouraged to help promote creativity. Rule abuse
entries, regardless of if they receive an award, result in changes to
the next year's rules and guidelines.
Legal abuse of the rules is NOT an invitation to violate the rules.
An entry that violates the rules in the opinion of the judges, WILL be
disqualified. RULE ABUSE CARRIES A CERTAIN LEVEL OF RISK! If you
have an entry that might otherwise be interesting, you might want to
submit two versions; one that does not abuse the rules and one that
does.
If you intend to abuse the rules, indicate so in the program
"remarks". You must try to justify why you consider your rule abuse
to be allowed under the rules. That is, you must plead your case as
to why your entry is valid. Humor and/or creativity help plead a
case.
Abusing the web submission procedure tends to annoy us more
than amuse us. Spend your creative energy on content of your
entry rather than on the submission process itself.
We are often asked why the contest rules and guidelines seem too
strange or contain mistakes, flaws or grammatical errors. One reason
is that we sometimes make genuine mistakes. But in many cases such
problems, flaws or areas of confusion are deliberate. Changes to
rules and guidelines in response to rule abuses, are done in a minimal
fashion. Often we will deliberately leave behind holes (or introduce
new ones) so that future rule abuse may continue. A cleaver author
should be able to read them and "drive a truck through the holes" in
the rules and guidelines.
At the risk of stating the obvious, this contest is a parody of the
software development process. The rules and guidelines are only a
small part of the overall contest. Even so, one may think the contest
rules and guideline process as a parody of the sometimes tragic
mismatch between what a customer (or marketing) wants and what
engineering delivers. Real programmers must face obfuscated
and sometimes conflicting specifications and requirements from marketing,
sales, product management an even from customers themselves on a
all too regular basis. This is one of the reasons why the rules and
guidelines are written in obfuscated form.
JUDGING PROCESS:
Entries are judged by Leonid A. Broukhis, Simon Cooper, Landon Curt Noll.
Each entry submitted is given a random id number and subdirectory. The
entry files including, but not limited to prog.c, Makefile (that we
form from around your "how to build" information), as well as any
data files that you submit are all placed under their own directory.
stored and judged from this directory.
Any information about the authors is not read by the judges until
the judging process is complete, and then only from entries that have
won an award. Because we do not read this information for entries that
do not win, we do not know who did not win.
The above process helps keep us biased for/against any one particular
individual. Therefore you MUST refrain from putting any information
that reveals your identity in your entry.
Now some people point out that coding style might reveal the information
about the others. However we consider this to be simply circumstantial
and outside the scope of the above paragraph.
Some people, in the past, have attempted to obfuscate their identity by
including comments of famous Internet personalities such as Peter Honeyman
(http://www.citi.umich.edu/u/honey/). The judges are on to this
trick and therefore consider any obfuscated source or data file
claiming to be from Honeyman to not be form Honeyman. This of course
creates an interesting paradox known as the "obfuscated Peter Honeyman
paradox". Should Peter Honeyman actually submit an obfuscated entry,
he alone is excluded from the above, as we will likely believe
it just another attempt at confusion. This guideline is known
as the "Peter Honeyman is exempt" guideline.
BTW: None of the entries claiming to be from Peter Honeyman have ever
won an award. So it is theoretically possible that Peter Honeyman
did submit an entry in the past. In the past, Peter had denied
submitting anything to the IOCCC. Perhaps those entries were
submitted by one of his students?
Hopefully we are very CLEAR on this point! The rules now strongly state:
PLEASE DO NOT put a name of an author, in an obvious way, into your
source code, remarks, data files, etc. The above "Peter Honeyman is
exempt" not withstanding.
We seemed to have digressed again ... :-) Returning to the judging process:
We prefer to be kept in the dark as much as you are until the final
awards are given. We enjoy the surprise of finding out in the end,
who won and where they were from.
We attempt to keep all entries anonymous, unless they win an award.
Because the main 'prize' of winning is being announced, we make all
attempts to send non-winners into oblivion. We remove all non-winning
files, and shred all related paper. By tradition, we do not even
reveal the number of entries that we received.
During the judging process. a process that spans multiple sessions
over a few weeks, post general updates from our @IOCCC twitter account.
Once we have selected the winners, for each category we will tweet:
category name
name(s) of the authors (or anonymous if requested)
twitter handle(s) (if provided and if anonymity was not requested)
country code(s) of the author(s)
After the initial announcement, we attempt to send Email to the
authors of the winning entries. One reason we do this is to give
the authors a chance to comment on the way we have presented their
entry. They are given the chance to correct mistakes and typos. We
often accept their suggestions/comments about our remarks as well.
This is done prior to posting the winners to the wide world.
Judging consists of a number of elimination rounds. During a round,
the collection of entries are divided into two roughly equal piles;
the pile that advances on to the next round, and the pile that does
not. We also re-examine the entries that were eliminated in the
previous round. Thus, an entry gets at least two readings.
A reading consists of a number of actions:
* reading the "how to build" information and forming a Makefile
* reading prog.c, the C source
* reviewing the "remarks" information
* briefly looking any any supplied data files
* passing the source thru the C pre-processor
skipping over any #include files
* performing a number of C beautify/cleanup edits on the source
* passing the beautified source thru the C pre-processor
skipping over any #include files
* compiling/building the source
* running the program
* Doing other things that only IOCCC judges know about :-)
In later rounds, other actions are performed including performing
miscellaneous tests on the source and binary.
! This is the very guideline that goes, BING!
Until we reduce the stack of entries down to about 25 entries, entries
are judged on an individual basis. An entry is set aside because it
does not, in our opinion, meet the standard established by the round.
When the number of entries thins to about 25 entries, we begin to form
award categories. Entries begin to compete with each other for awards.
An entry will often compete in several categories.
The actual award category list will vary depending on the types of entries
we receive. A typical category list might be:
* best small one line program (see above about one line programs)
* best small program
* strangest/most creative source layout
* most useful obfuscated program
* best game that is obfuscated
* most creatively obfuscated program
* most deceptive C code (code with deceptive comments and source code)
* best X client (see OUR LIKES AND DISLIKES)
* best abuse of ISO C or ANSI C standard (see above about compilers)
* best abuse of the C preprocessor
* worst abuse of the rules
* (anything else so strange that it deserves an award)
We do not limit ourselves to this list. For example, a few entries are so
good/bad that they are declared winners at the start of the final round.
We will invent awards categories for them, if necessary.
In the final round process, we perform the difficult tasks of
reducing the remaining entries (typically about 25) down to to about
half that number: declaring those remaining to be winners.
Often we are confident that the entries that make it into
the final round are definitely better than the ones that do not
make it. The selection of the winners out of the final round, is
less clear cut.
Sometimes a final round entry is good enough to win, but is beat out
by a similar, but slightly better entry. For this reason, it is
sometimes worthwhile to re-enter an improved version of an entry
that failed to win in a previous year. This assumes, of course,
that the entry is worth improving in the first place!
More than one IOCCC judge has been known to bribe another IOCCC judge
into voting for a winning entry by offering a bit high quality chocolate.
This technique is highly discouraged for use by non-IOCCC judges.
More often than not, we select a small entry (usually one line), a
strange/creative layout entry. We sometimes also select an
entry that abuses the contest guidelines in an interesting way,
or that stretches the content rules that while legal, is
nevertheless goes against the intent of the rules.
In the end, we traditionally pick one entry as 'best'. Sometimes such
an entry simply far exceeds any of the other entries. More often, the
'best' is picked because it does well in a number of categories.
In years past, we renamed the winning entry from prog.c to a
name related to the submitter(s) names. This is no longer done.
Winning source is called prog.c A compiled binary is called prog.
ANNOUNCEMENT OF WINNERS:
The judges will tweet initial announcement of who won, the name
of their award, and a very brief description of the winning entry
from the @IOCCC twitter handle. Non-twitter users should visit:
https://twitter.com/ioccc
Non-twitter users should force their browsers to reload the above URL
to be sure they are seeing the most recent tweets.
The judges will then post an initial announcement of who won, the name
of their award, and a very brief description of the winning entry
on the IOCCC web site:
http://www.ioccc.org/whowon.html
We will also attempt to submit a brief announcement story to /.:
http://slashdot.org
that, depending on the willingness of the /. editors, may be posted
to their site at the same time.
Note that initial announcement will NOT contain source. This is because
the winning authors are given a chance to review the judges comments,
and test our Makefile. This review process typically takes a few weeks.
Sometime after the initial announcement, and once the the review
by the winners has been completed, the winning source will be
posted to the IOCCC web site:
http://www.ioccc.org/years.html
NOTE: previous winners are available at that URL
We will also tweet, via @IOCCC, when the winning source is available.
It is pointless to ask the IOCCC judges how many entries we receive.
Other government TLA or FLA snooping organizations are prohibited from
either confirming, denying or revealing any knowledge of this data point.
Often, winning entries are published in selected magazines from around
the world. Winners have appeared in books ("The New Hackers Dictionary")
and on T-Shirts. More than one winner has been turned in a tattoo!
Last, but not least, winners receive international fame and flames! :-)
FOR MORE INFORMATION:
You may contact the judges by sending Email to the following address:
| q.2020@ioccc.org (do not submit entries to this address)
| You must include the words 'ioccc 2020 question' in the subject of your
Email message when sending Email to the judges.
Questions and comments about the contest are welcome. Comments about
confusing rules and guidelines are also welcome.
The rules and the guidelines may (and often do) change from year to
year. You should be sure you have the current rules and guidelines
prior to submitting entries.
Check out the IOCCC Web page:
http://www.ioccc.org
It has rules, guidelines and winners of previous contests (1984 to date).
For the updates and breaking IOCCC news, you are encouraged to follow
the twitter handle:
@IOCCC
You do not have to be a twitter user to follow @IOCCC. Non-twitter
users should access:
https://twitter.com/ioccc
Non-twitter users should force their browsers to reload the above URL
to be sure they are seeing the most recent tweets.
Leonid A. Broukhis
Simon Cooper
chongo (Landon Curt Noll) /\cc/\
2020/hint.css
+122
View File
@@ -0,0 +1,122 @@
* {
font-family: Helvetica Neue, Helvetica, Arial, sans-serif;
}
body {
max-width: 50em;
margin: 0 auto;
color: #111;
}
pre, code {
font-family: Monaco, Courier New, monospace;
font-size: 12px;
}
h1 {
font-size: 30px;
font-weight: bold;
letter-spacing: -1px;
margin-bottom: -5px;
}
h1 code {
font-size: 30px;
}
h2 {
color: rgb(43,105,145);
font-weight: bold;
margin-bottom: -5px;
}
h2 code {
font-size: 22px;
}
h3 {
/* color: rgb(43,105,145); */
font-weight: bold;
margin-bottom: -5px;
}
h3 code {
font-size: 16px;
}
a {
color: blue;
text-decoration: underline;
}
a:visited {
color: navy;
}
a:hover {
text-decoration: underline;
}
code {
white-space: pre;
}
pre {
border-radius: 10px;
-webkit-border-radius: 10px;
-moz-border-radius: 10px;
box-shadow: 0px 2px 8px rgba(0, 0, 0, 0.3);
-webkit-box-shadow: 0px 2px 8px rgba(0, 0, 0, 0.3);
-moz-box-shadow: 0px 2px 8px rgba(0, 0, 0, 0.3);
border-width: 1px;
border-color: rgb(16,48,0);
border-style: solid;
padding: 0.6em;
padding-left: 1em;
margin-left: 5%;
margin-right: 8%;
overflow: auto;
color: rgb(255,223,0);
background-color: rgb(53,46,0);
}
p, li {
font-size: 14px;
line-height: 18px;
}
/* For a navigation menu */
#bar ul {
list-style-type: none;
margin: 0;
/* padding: 0; */
overflow: hidden;
/* border: 1px solid black; */
/* background-color: #f0f0f0; */
}
#bar li {
/* border-right: 1px solid black; */
display: inline;
float: left;
}
#bar li a {
display: block;
color: black;
text-align: center;
padding: 10px 16px;
text-decoration: none;
background-color: #f0f0f0;
border: 1px solid black;
border-right: none;
}
#bar li a:hover:not(.active) {
color: black;
background-color: white;
}
#bar li:last-child {
border-right: 1px solid black;
}
#bar .active {
color: black;
background-color: #4CAF50;
}
2020/index.html
+126
View File
@@ -0,0 +1,126 @@
<!doctype html public "-//W3C//DTD HTML 4.0 Transitional //EN">
<html>
<head>
<meta name="GENERATOR" content="mkd2html 2.2.2">
<meta http-equiv="Content-Type"
content="text/html; charset=utf-8"> <link rel="stylesheet"
type="text/css"
href="hint.css" />
<title></title>
<title>README</title>
</head>
<body>
<CENTER>
<IMG SRC="/png/ioccc.png" ALT="IOCCC" height=78 width=267>
<P><FONT size="6"><I>The International Obfuscated C Code Contest</I></FONT></P>
<div id="bar">
<ul>
<li><a href="index.html">About the 27th IOCCC</a></li>
<li><a href="whowon.html">27th IOCCC Winners</a></li>
<li><a href="/index.html">IOCCC home</a></li>
<li><a href="/winners.html">List of All Winners</a></li>
<li><a href="/judges.html">The Judges</a></li>
</ul>
</div>
<P><FONT size="6"><B>The 27<sup>th</sup> IOCCC</B></FONT></P>
</CENTER>
<h2>2020 marked the &ldquo;The Twenty Seventh International Obfuscated C Code Contest&rdquo;</h2>
<p>Copyright &copy; 2020, Landon Curt Noll, Simon Cooper, and Leonid A.
Broukhis. All Rights Reserved. Permission for personal, educational
or non-profit use is granted provided this copyright and notice are
included in its entirety and remains unaltered. All other uses
must receive prior permission from the contest judges.</p>
<h2>Standard IOCCC stuff</h2>
<p>The primary IOCCC web site can be found at,</p>
<blockquote><p> <a href="http://www.ioccc.org/">http://www.ioccc.org/</a></p></blockquote>
<p>Use make to compile entries. It is possible that on non-Un*x / 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. If you want to, look at the hints files for
spoilers - this year we included most of the information included
by the submitter.</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 #define).</p>
<p>Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.</p>
<h2>Remarks on some of the winners</h2>
<p>This year&rsquo;s Best of Show (carlini) is such a novel way of obfuscation that it would be
worth of a special mention in the (future) Best of IOCCC list!</p>
<p>For some reason, this year&rsquo;s set of winners contains three nostalgic games,
Asteroids (tsoj), Minesweeper (endoh1), and Snake (ferguson1).</p>
<p>An entry (kurdyukov1) pays homage to a previous winner (2015/hou).</p>
<p>&hellip;We&rsquo;ll stop spouting spoilers now. Have fun exploring all the entries!</p>
<h2>Remarks on some of submissions that did not win</h2>
<p>As a rule, we try to compile the entries on a variety of platforms.
Quite a few entries this year could not be built or executed on some of them due to reliance on
library internals or the system runtime.</p>
<p>A few entries were violating the &ldquo;2053 significant bytes&rdquo; rule. If an entry could not be brought to
compliance within a few seconds of looking at the source, it was disqualified.</p>
<p>One entry tried to get around the size limit by putting the code into
makefile variables and using -D. This is already called out as discouraged
technique in the guidelines, but it is worth a reminder.</p>
<p>Several promising entries attempted to make use of the <code>syscall</code> function using literal syscall numbers.
This is utterly non-portable.</p>
<p>A note to the authors: when submitting multiple entries, don&rsquo;t let us easily correlate them by
coding style or documentation content, and definitely don&rsquo;t submit nearly identical versions
of your program separately. As we try to judge the entries anonymously, the similarities will cause such
entries to compete against one another, making each less likely to win.</p>
<p>We hope the authors of non-winning entries will refine their entries and
perhaps re-submit them for the next IOCCC.</p>
<h2>Final Comments</h2>
<p>One more thing that feels dated is digraphs and trigraphs.</p>
<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>
<blockquote><p> <a href="http://www.ioccc.org/contact.html">http://www.ioccc.org/contact.html</a></p></blockquote>
<p>For news of the next contest watch:</p>
<blockquote><p> <a href="http://www.ioccc.org/">http://www.ioccc.org/</a></p></blockquote>
<BR>
<HR>
<TABLE><TR>
<TD><a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="/png/by-sa-3.0-88x31.png" /></a></TD>
<TD><P>&copy; Copyright 1984-2020,
<A HREF="/judges.html">Leo Broukhis, Simon Cooper, Landon Curt Noll</A>
- All rights reserved<BR>
This work is licensed under a <a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P></TD>
<TD>&nbsp;<!--<a href="https://validator.w3.org/check?uri=referer"><img src="https://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional" height="31" width="88"></a>--></TD>
</TR></TABLE>
</body>
</html>
2020/iocccsize-test.sh
+385
View File
@@ -0,0 +1,385 @@
#!/usr/bin/env bash
#
# iocccsize-test.sh - IOCCC Size Tool Tests
#
# "You are not expected to understand this" :-)
#
# This IOCCC size tool source file is version 2019-06-20-v27.
#
# Public Domain 1992, 2015, 2019 by Anthony Howe. All rights released.
# With IOCCC minor mods in 2019 by chongo (Landon Curt Noll) ^oo^
export PATH='/bin:/usr/bin:/usr/local/bin:/usr/pkg/bin'
export ENV=''
export CDPATH=''
export LANG=C
usage()
{
echo 'usage: iocccsize-test.sh [-bv][-t tool]'
exit 2
}
__tool="./iocccsize"
__verbose=false
while getopts 'bvt:' opt; do
case "$opt" in
(b)
__build="distclean"
;;
(v)
__verbose=true
__tool_args="-v"
;;
(t)
__tool="$OPTARG"
;;
(*)
usage
esac
done
shift $(($OPTIND - 1))
#if [ $# -lt 1 ]; then
# usage
#fi
make -f iocccsize.mk ${__build} all
if [ ! -d test ]; then
mkdir test
fi
get_wc()
{
typeset file="$1"
typeset field="$2"
wc $file | sed -e's/^ *//; s/ */ /g' | cut -d' ' -f$field
}
test_size()
{
typeset file="test/$1"
typeset expect="$2"
typeset gross_count
typeset got
got=$($__tool $__tool_args <$file 2>&1 >/dev/null)
if $__verbose ; then
gross_count=$(echo $got | cut -d' ' -f2)
bytes=$(get_wc $file 3 $filter)
if [ $gross_count != $bytes ]; then
echo "FAIL $file: got $gross_count != wc $bytes"
return
fi
else
got=$(echo $got | cut -d' ' -f1)
expect=$(echo $expect | cut -d' ' -f1)
fi
if [ "$expect" = "$got" ]; then
echo "-OK- $file: $got"
else
echo "FAIL $file: got $got != expect $expect"
fi
}
#######################################################################
cat <<EOF >test/splitline0.c
#define FOO \\
int a = 666;
FOO;
EOF
test_size splitline0.c "19 36 1"
#######################################################################
cat <<EOF >test/comment0.c
// comment one line "with a comment string" inside
int x;
EOF
test_size comment0.c "44 58 1"
#######################################################################
cat <<EOF >test/comment1.c
/* comment block same line 'with a comment string' */
int x;
EOF
test_size comment1.c "46 61 1"
#######################################################################
cat <<EOF >test/comment2.c
/*
comment block
multiline
*/
int x;
EOF
test_size comment2.c "27 37 1"
#######################################################################
cat <<EOF >test/comment3.c
a//foo
EOF
test_size comment3.c "6 7 0"
#######################################################################
cat <<EOF >test/comment4.c
/*/ int if for /*/
EOF
test_size comment4.c "14 19 0"
#######################################################################
cat <<EOF >test/comment5.c
'"' "/*" foobar "*/"
EOF
test_size comment5.c "17 21 0"
#######################################################################
cat <<EOF >test/comment6.c
char str[] = "string /* with */ comment";
EOF
test_size comment6.c "30 42 1"
#######################################################################
cat <<EOF >test/comment7.c
// comment with backslash newline \\
int a = 666;
EOF
test_size comment7.c "37 49 0"
#######################################################################
cat <<EOF >test/quote0.c
char str[] = "and\"or";
EOF
test_size quote0.c "16 24 1"
#######################################################################
cat <<EOF >test/quote1.c
char squote = '\'';
EOF
test_size quote1.c "12 20 1"
#######################################################################
cat <<EOF >test/quote2.c
char str[] = "'xor'";
EOF
test_size quote2.c "14 22 1"
#######################################################################
cat <<EOF >test/digraph.c
char str<::> = "'xor'";
EOF
test_size digraph.c "14 24 1"
#######################################################################
cat <<EOF >test/trigraph0.c
char str??(??) = "'xor'";
EOF
test_size trigraph0.c "14 26 1"
#######################################################################
# Example from https://en.wikipedia.org/wiki/Digraphs_and_trigraphs#C
cat <<EOF >test/trigraph1.c
// Will the next line be executed????????????????/
int a = 666;
EOF
test_size trigraph1.c "49 64 0"
#######################################################################
# Example from https://en.wikipedia.org/wiki/Digraphs_and_trigraphs#C
cat <<EOF >test/trigraph2.c
/??/
* A comment *??/
/
EOF
test_size trigraph2.c "12 24 0"
#######################################################################
cat <<EOF >test/trigraph3.c
#define FOO ??/
int a = 666;
FOO;
EOF
test_size trigraph3.c "19 38 1"
#######################################################################
cat <<EOF >test/main0.c
int
main(int argc, char **argv)
{
return 0;
}
EOF
test_size main0.c "22 47 4"
#######################################################################
cat <<EOF >test/hello.c
#include <stdio.h>
int
main(int argc, char **argv)
{
(void) printf("Hello world!\n");
return 0;
}
EOF
test_size hello.c "58 101 6"
#######################################################################
# Digraph for #include and curlys. Digraphs are tokens and are not
# translated like trigraphs.
cat <<EOF >test/hello_digraph.c
%: include <stdio.h>
int
main(int argc, char **argv)
<%
(void) printf("Hello world!\n");
return 0;
%>
EOF
test_size hello_digraph.c "60 108 6"
#######################################################################
# Trigraph for #include and curlys. Trigraphs are translated, unlike
# digraphs which are tokens.
cat <<EOF >test/hello_trigraph.c
??= include <stdio.h>
int
main(int argc, char **argv)
??<
(void) printf("Hello world!\n");
return 0;
??>
EOF
test_size hello_trigraph.c "58 111 6"
#######################################################################
cat <<EOF >test/include0.c
# include <stdio.h>
EOF
test_size include0.c "10 21 1"
#######################################################################
cat <<EOF >test/include1.c
# include <stdio.h>
#/*hi*/include <ctype.h>
EOF
test_size include1.c "26 46 2"
#######################################################################
cat <<EOF >test/curly0.c
char str = "{ curly } ";
EOF
test_size curly0.c "12 25 1"
#######################################################################
# No spaces after curly braces in array initialiser.
cat <<EOF >test/curly1.c
#include <stdlib.h>
#define STRLEN(s) (sizeof (s)-1)
typedef struct {
size_t length;
const char *word;
} Word;
Word list[] = {
{STRLEN("abutted curly"), "abutted curly"},
{0, NULL}
};
EOF
test_size curly1.c "119 192 6"
#######################################################################
# Spaces after curly braces in array initialiser.
cat <<EOF >test/curly2.c
#include <stdlib.h>
#define STRLEN(s) (sizeof (s)-1)
typedef struct {
size_t length;
const char *word;
} Word;
Word list[] = {
{ STRLEN("spaced curly"), "spaced curly"} ,
{ 0, NULL}
} ;
EOF
test_size curly2.c "113 196 6"
#######################################################################
cat <<EOF >test/semicolon0.c
char str = "; xor; ";
EOF
test_size semicolon0.c "10 22 1"
#######################################################################
# Spaces after semicolons in for( ; ; ).
cat <<EOF >test/semicolon1.c
#include <stdio.h>
int
main(int argc, char **argv)
{
int i;
for (i = 0; i < 3; i++) {
(void) printf("%d\n", i);
}
return 0;
}
EOF
test_size semicolon1.c "65 133 8"
#######################################################################
# No spaces after semicolons in for(;;).
cat <<EOF >test/semicolon2.c
#include <stdio.h>
int
main(int argc, char **argv)
{
int i;
for (i=0;i<3;i++) {
(void) printf("%d\n", i);
}
return 0;
}
EOF
test_size semicolon2.c "67 127 8"
#######################################################################
# END
#######################################################################
2020/iocccsize.c
+477
View File
@@ -0,0 +1,477 @@
/*
* iocccsize - IOCCC Source Size Tool
*
* "You are not expected to understand this" :-)
*
* Public Domain 1992, 2015, 2018, 2019 by Anthony Howe. All rights released.
* With IOCCC minor mods in 2019 by chongo (Landon Curt Noll) ^oo^
*
* SYNOPSIS
*
* iocccsize [-ihv] < input
*
* -i ignored for backward compatibility
* -h print usage message in stderr and exit
* -v turn on some debugging to stderr; -vv or -vvv for more
*
* The source is written to stdout, with possible translations ie. trigraphs.
* The IOCCC net count rule 2b is written to stderr; with -v, net count (2b),
* gross count (2a), number of keywords counted as 1 byte; -vv or -vvv write
* more tool diagnostics.
*
* DESCRIPION
*
* Reading a C source file from standard input, apply the IOCCC
* source size rules as explained in the Guidelines. The source
* code is passed through on standard output. The source's net
* length is written to standard error; with -v option the net
* length, gross length, and matched keyword count are written.
*
* The entry's gross size in bytes must be less than equal to 4096
* bytes in length.
*
* The entry's net size in bytes must be less than equal to 2053
* bytes (first prime after 2048). The net size is computed as
* follows:
*
* The size tool counts most C reserved words (keyword, secondary,
* and selected preprocessor keywords) as 1. The size tool counts all
* other octets as 1 excluding ASCII whitespace, and excluding any
* ';', '{' or '}' followed by ASCII whitespace, and excluding any
* ';', '{' or '}' octet immediately before the end of file.
*/
#define DIGRAPHS
#define TRIGRAPHS
/*
* IOCCC Judge's remarks:
*
* This code contains undocumented features. On the other hand, this code
* is RTFS (for certain values of RTFS). One might say that this code
* perfectly documents itself. :-)
*
* Many thanks to Anthony Howe for taking the time to put his OCD
* (Obfuscated Coding Determination) into this code!
*/
/*
* HINT: The algorithm implemented by this code may or not be obfuscated.
* The algorithm may not or may appear to be obfuscated.
*
* In particular:
*
* We did not invent the algorithm.
* The algorithm consistently finds Obfuscation.
* The algorithm killed Obfuscation.
* The algorithm is banned in C.
* The algorithm is from Bell Labs in Jersey.
* The algorithm constantly finds Obfuscation.
* This is not the algorithm.
* This is close.
*/
#include <err.h>
#include <ctype.h>
#include <getopt.h>
#include <string.h>
#include <stdio.h>
#define WORD_BUFFER_SIZE 64
#define MAX_SIZE 4096 /* IOCCC Rule 2a */
#define MAX_COUNT 2053 /* IOCCC Rule 2b */
#define STRLEN(s) (sizeof (s)-1)
#define NO_COMMENT 0
#define COMMENT_EOL 1
#define COMMENT_BLOCK 2
static char usage[] =
"usage: iocccsize [-ihv] < prog.c\n"
"\n"
"-i\t\tignored for backward compatibility\n"
"-h\t\tprint usage message in stderr and exit\n"
"-v\t\tturn on some debugging to stderr; -vv or -vvv for more\n"
"\n"
"The source is written to stdout, with possible translations ie. trigraphs.\n"
"The IOCCC net count rule 2b is written to stderr; with -v, net count (2b),\n"
"gross count (2a), number of keywords counted as 1 byte; -vv or -vvv write\n"
"more tool diagnostics.\n"
"\n"
"Version: 2019-06-20-v27"
;
static int debug;
static char *out_fmt = "%lu\n";
/*
* C reserved words, plus a few #preprocessor tokens, that count as 1
*
* NOTE: For a good list of reserved words in C, see:
*
* http://www.bezem.de/pdf/ReservedWordsInC.pdf
*
* by Johan Bezem of JB Enterprises:
*
* See http://www.bezem.de/en/
*/
typedef struct {
size_t length;
const char *word;
} Word;
static Word cwords[] = {
/* Yes Virginia, we left #define off the list on purpose! */
{ STRLEN("#elif"), "#elif" } ,
{ STRLEN("#else"), "#else" } ,
{ STRLEN("#endif"), "#endif" } ,
{ STRLEN("#error"), "#error" } ,
{ STRLEN("#ident"), "#ident" } ,
{ STRLEN("#if"), "#if" } ,
{ STRLEN("#ifdef"), "#ifdef" } ,
{ STRLEN("#ifndef"), "#ifndef" } ,
{ STRLEN("#include"), "#include" } ,
{ STRLEN("#line"), "#line" } ,
{ STRLEN("#pragma"), "#pragma" } ,
{ STRLEN("#sccs"), "#sccs" } ,
{ STRLEN("#warning"), "#warning" } ,
{ STRLEN("_Alignas"), "_Alignas" } ,
{ STRLEN("_Alignof"), "_Alignof" } ,
{ STRLEN("_Atomic"), "_Atomic" } ,
{ STRLEN("_Bool"), "_Bool" } ,
{ STRLEN("_Complex"), "_Complex" } ,
{ STRLEN("_Generic"), "_Generic" } ,
{ STRLEN("_Imaginary"), "_Imaginary" } ,
{ STRLEN("_Noreturn"), "_Noreturn" } ,
{ STRLEN("_Pragma"), "_Pragma" } ,
{ STRLEN("_Static_assert"), "_Static_assert" } ,
{ STRLEN("_Thread_local"), "_Thread_local" } ,
{ STRLEN("alignas"), "alignas" } ,
{ STRLEN("alignof"), "alignof" } ,
{ STRLEN("and"), "and" } ,
{ STRLEN("and_eq"), "and_eq" } ,
{ STRLEN("auto"), "auto" } ,
{ STRLEN("bitand"), "bitand" } ,
{ STRLEN("bitor"), "bitor" } ,
{ STRLEN("bool"), "bool" } ,
{ STRLEN("break"), "break" } ,
{ STRLEN("case"), "case" } ,
{ STRLEN("char"), "char" } ,
{ STRLEN("compl"), "compl" } ,
{ STRLEN("const"), "const" } ,
{ STRLEN("continue"), "continue" } ,
{ STRLEN("default"), "default" } ,
{ STRLEN("do"), "do" } ,
{ STRLEN("double"), "double" } ,
{ STRLEN("else"), "else" } ,
{ STRLEN("enum"), "enum" } ,
{ STRLEN("extern"), "extern" } ,
{ STRLEN("false"), "false" } ,
{ STRLEN("float"), "float" } ,
{ STRLEN("for"), "for" } ,
{ STRLEN("goto"), "goto" } ,
{ STRLEN("if"), "if" } ,
{ STRLEN("inline"), "inline" } ,
{ STRLEN("int"), "int" } ,
{ STRLEN("long"), "long" } ,
{ STRLEN("noreturn"), "noreturn" } ,
{ STRLEN("not"), "not" } ,
{ STRLEN("not_eq"), "not_eq" } ,
{ STRLEN("or"), "or" } ,
{ STRLEN("or_eq"), "or_eq" } ,
{ STRLEN("register"), "register" } ,
{ STRLEN("restrict"), "restrict" } ,
{ STRLEN("return"), "return" } ,
{ STRLEN("short"), "short" } ,
{ STRLEN("signed"), "signed" } ,
{ STRLEN("sizeof"), "sizeof" } ,
{ STRLEN("static"), "static" } ,
{ STRLEN("static_assert"), "static_assert" } ,
{ STRLEN("struct"), "struct" } ,
{ STRLEN("switch"), "switch" } ,
{ STRLEN("thread_local"), "thread_local" } ,
{ STRLEN("true"), "true" } ,
{ STRLEN("typedef"), "typedef" } ,
{ STRLEN("union"), "union" } ,
{ STRLEN("unsigned"), "unsigned" } ,
{ STRLEN("void"), "void" } ,
{ STRLEN("volatile"), "volatile" } ,
{ STRLEN("while"), "while" } ,
{ STRLEN("xor"), "xor" } ,
{ STRLEN("xor_eq"), "xor_eq" } ,
{ 0, NULL }
};
static Word *
find_member(Word *table, const char *string)
{
Word *w;
for (w = table; w->length != 0; w++) {
if (strcmp(string, w->word) == 0) {
return w;
}
}
return NULL;
}
static int
read_ch(FILE *fp)
{
int ch;
while ((ch = fgetc(fp)) != EOF && ch == '\r') {
/* Discard bare CR and those part of CRLF. */
}
if (ch == '\0' || 128 <= ch) {
errx(1, "NUL or non-ASCII characters");
}
return ch;
}
static void
rule_count(FILE *fp)
{
char word[WORD_BUFFER_SIZE];
size_t gross_count = 0, net_count = 0, keywords = 0, wordi = 0;
int ch, next_ch, quote = 0, escape = 0, is_comment = NO_COMMENT;
while ((ch = read_ch(fp)) != EOF) {
/* Future gazing. */
next_ch = read_ch(fp);
#ifdef TRIGRAPHS
if (ch == '?' && next_ch == '?') {
/* ISO C11 section 5.2.1.1 Trigraph Sequences */
const char *t;
static const char trigraphs[] = "=#([)]'^<{!|>}-~/\\";
ch = fgetc(fp);
for (t = trigraphs; *t != '\0'; t += 2) {
if (ch == t[0]) {
/* Mapped trigraphs count as 1 byte. */
next_ch = fgetc(fp);
gross_count += 2;
ch = t[1];
break;
}
}
/* Unknown trigraph, push back the 3rd character. */
if (*t == '\0') {
if (ch != EOF && ungetc(ch, fp) == EOF) {
errx(1, "ungetc error: bad \?\?%c trigraph", ch);
}
ch = '?';
}
}
#endif
if (ch == '\\' && next_ch == '\n') {
/* ISO C11 section 5.1.1.2 Translation Phases
* point 2 discards backslash newlines.
*/
gross_count += 2;
continue;
}
if (next_ch != EOF && ungetc(next_ch, fp) == EOF) {
/* ISO C ungetc() guarantees one character (byte) pushback.
* How does that relate to UTF8 and wide-character library
* handling? An invalid trigraph results in 2x ungetc().
*/
errx(1, "ungetc error: @SirWumpus goofed");
}
/* Within quoted string? */
if (quote != 0) {
/* Escape _this_ character. */
if (escape) {
escape = 0;
}
/* Escape next character. */
else if (ch == '\\') {
escape = 1;
}
/* Close matching quote? */
else if (ch == quote) {
quote = 0;
}
}
/* Within comment to end of line? */
else if (is_comment == COMMENT_EOL && ch == '\n') {
if (debug > 1) {
(void) fprintf(stderr, "~~NO_COMMENT\n");
}
is_comment = NO_COMMENT;
}
/* Within comment block? */
else if (is_comment == COMMENT_BLOCK && ch == '*' && next_ch == '/') {
if (debug > 1) {
(void) fprintf(stderr, "~~NO_COMMENT\n");
}
is_comment = NO_COMMENT;
}
/* Start of comment to end of line? */
else if (is_comment == NO_COMMENT && ch == '/' && next_ch == '/') {
if (debug > 1) {
(void) fprintf(stderr, "~~COMMENT_EOL\n");
}
is_comment = COMMENT_EOL;
/* Consume next_ch. */
(void) fputc(ch, stdout);
ch = fgetc(fp);
gross_count++;
net_count++;
}
/* Start of comment block? */
else if (is_comment == NO_COMMENT && ch == '/' && next_ch == '*') {
if (debug > 1) {
(void) fprintf(stderr, "~~COMMENT_BLOCK\n");
}
is_comment = COMMENT_BLOCK;
/* Consume next_ch. */
(void) fputc(ch, stdout);
ch = fgetc(fp);
gross_count++;
net_count++;
}
/* Open single or double quote? */
else if (is_comment == NO_COMMENT && (ch == '\'' || ch == '"')) {
quote = ch;
}
(void) fputc(ch, stdout);
#ifdef DIGRAPHS
/* ISO C11 section 6.4.6 Punctuators, digraphs handled during
* tokenization, but map here and count as 1 byte, like their
* ASCII counter parts.
*/
if (is_comment == NO_COMMENT && quote == 0) {
const char *d;
static const char digraphs[] = "[<:]:>{<%}%>#%:";
for (d = digraphs; *d != '\0'; d += 3) {
if (ch == d[1] && next_ch == d[2]) {
(void) fputc(next_ch, stdout);
(void) fgetc(fp);
gross_count++;
ch = d[0];
break;
}
}
}
#endif
/* Sanity check against file size and wc(1) byte count. */
gross_count++;
/* End of possible keyword? Care with #word as there can
* be whitespace or comments between # and word.
*/
if ((word[0] != '#' || 1 < wordi) && !isalnum(ch) && ch != '_' && ch != '#') {
if (find_member(cwords, word) != NULL) {
/* Count keyword as 1. */
net_count = net_count - wordi + 1;
keywords++;
if (debug > 1) {
(void) fprintf(stderr, "~~keyword %zu \"%s\"\n", keywords, word);
}
}
word[wordi = 0] = '\0';
}
/* Ignore all whitespace. */
if (isspace(ch)) {
if (debug > 2) {
(void) fprintf(stderr, "~~ignore whitespace %#02x\n", ch);
}
continue;
}
/* Ignore begin/end block and end of statement. */
if (strchr("{;}", ch) != NULL && (isspace(next_ch) || next_ch == EOF)) {
if (debug > 2) {
(void) fprintf(stderr, "~~ignore %c\n", ch);
}
continue;
}
/* Collect next word not in a string or comment. */
if (quote == is_comment && (isalnum(ch) || ch == '_' || ch == '#')) {
if (sizeof (word) <= wordi) {
wordi = 0;
}
word[wordi++] = (char) ch;
word[wordi] = '\0';
}
net_count++;
}
/*
* The original author was not entirely in agreement with printing
* these warnings, since he believes that its the programmer's job to
* be cognisant of the rules, guidelines, and the state of their work.
*
* The IOCCC judges observe that enough IOCCC submitters are not so
* cognizant (cognisant) and so make these warnings manditory in the
* hopes it will reduce the number of entries that violate the IOCCC
* size rules.
*/
if (debug == 0) {
if (MAX_SIZE < gross_count) {
(void) fprintf(stderr, "warning: size %zu exceeds Rule 2a %u\n", gross_count, MAX_SIZE);
}
if (MAX_COUNT < net_count) {
(void) fprintf(stderr, "warning: count %zu exceeds Rule 2b %u\n", net_count, MAX_COUNT);
}
}
(void) fprintf(stderr, out_fmt, net_count, gross_count, keywords);
}
int
main(int argc, char **argv)
{
int ch;
while ((ch = getopt(argc, argv, "6ihv")) != -1) {
switch (ch) {
case 'i': /* ignored for backward compatibility */
break;
case 'v':
debug++;
out_fmt = "%lu %lu %lu\n";
break;
case '6': /* You're a RTFS master! Congrats. */
errx(6, "There is NO... Rule 6!\nI'm not a number!\nI'm a free(void *man)!\n");
case 'h':
default:
errx(2, "%s", usage);
}
}
(void) setvbuf(stdin, NULL, _IOLBF, 0);
/* The Count - 1 Muha .. 2 Muhaha .. 3 Muhahaha ... */
rule_count(stdin);
/*
* All Done!!! All Done!!! -- Jessica Noll, age 2
*/
return 0;
}
2020/iocccsize.mk
+61
View File
@@ -0,0 +1,61 @@
#!/usr/bin/env make
#
# iocccsize - IOCCC Source Size Tool
#
# This IOCCC size tool source file is version 2019-06-20-v27.
#
# "You are not expected to understand this" :-)
#
# Public Domain 1992, 2015, 2018, 2019 by Anthony Howe. All rights released.
# With IOCCC minor mods in 2019 by chongo (Landon Curt Noll) ^oo^
.POSIX :
O := .o
E :=
.SUFFIXES :
.SUFFIXES : .c .h .i $O $E
########################################################################
### No further configuration beyond this point.
########################################################################
top_srcdir := ..
PROJ := iocccsize
TAR_I := -T
CFLAGS := -g -std=c11 -Wall -Wextra -Wno-char-subscripts -pedantic
CFLAGS89 := -g -std=c89 -Wall -Wextra -Wno-char-subscripts -pedantic
CPPFLAGS :=
LIBS :=
.c.i:
${CC} -E ${CFLAGS} ${CPPFLAGS} $*.c >$*.i
.c$E:
${CC} ${CFLAGS} ${CPPFLAGS} -o$*$E $*.c
#######################################################################
all: build
@true
build: ${PROJ}
clean:
-rm -f ${PROJ}.i ${PROJ}$O *.stackdump *.core
clobber: distclean
distclean: clean
-rm -fr ${PROJ}$E test a.out
-rm -fr decom a.out iocccsize.dSYM
test: ./${PROJ}-test.sh ${PROJ}
./${PROJ}-test.sh -v
unittest: test
./${PROJ}-test.sh -v
version:
git describe --tags --abbrev=0 >VERSION
2020/rules.txt
+278
View File
@@ -0,0 +1,278 @@
| 27th International Obfuscated C Code Contest Official Rules
| Copyright (C) 2006-2019 Leonid A. Broukhis, Simon Cooper, Landon Curt Noll
All Rights Reserved. Permission for personal, education or non-profit use is
granted provided this this copyright and notice are included in its entirety
and remains unaltered. All other uses must receive prior permission in
writing from the contest judges.
Obfuscate: tr.v. -cated, -cating, -cates. 1. a. To render obscure.
b. To darken. 2. To confuse: his emotions obfuscated his
judgment. [LLat. obfuscare, to darken : ob(intensive) +
Lat. fuscare, to darken < fuscus, dark.] -obfuscation n.
obfuscatory adj.
| This rules file is version 2019-06-15-v27.
Most of the changes from the previous IOCCC rule set have
been marked with a "|" on the left hand side of the line.
GOALS OF THE CONTEST:
* To write the most Obscure/Obfuscated C program under the rules below.
* To show the importance of programming style, in an ironic way.
* To stress C compilers with unusual code.
* To illustrate some of the subtleties of the C language.
* To provide a safe forum for poor C code. :-)
This IOCCC runs from:
| 2019-Dec-26 06:01:41 UTC
to:
| 2020-Mar-15 06:26:49 UTC
Until the start of this IOCCC, these rules, guidelines and iocccsize.c tool
should be considered provisional BETA versions and may be adjusted
at any time.
The IOCCC submission URL is:
https://submit.ioccc.org/
| The submit URL should be active on or slightly before 2020-Jan-15 12:21:37 UTC.
Please wait to submit your entries until after that time.
The official rules, guidelines and iocccsize.c tool will be available
on the official IOCCC web site on or slightly before start of this IOCCC.
Please check the IOCCC web site "How to enter" link:
http://www.ioccc.org/index.html#enter
on or after the start of this IOCCC to be sure you are using the correct
versions of these items before using the IOCCC entry submission URL.
RULES:
To help us with the volume of entries, we ask that you follow these rules:
1) Your entry must be a complete program.
| 2) This size rule requires your entry to satisfy BOTH rule 2a and rule 2b:
2a) The size of your program source must be <= 4096 bytes in length.
2b) When your program source is fed as input to the current IOCCC size
tool, and the IOCCC size tool -i command line option is used, the
value printed shall not exceed 2053.
The source to the current IOCCC size tool is found at this URL:
| http://www.ioccc.org/2020/iocccsize.c
3) Submissions should be performed using the instructions outlined at:
https://submit.ioccc.org/
| The submit URL should be active on or slightly before 2020-Jan-15 12:21:37 UTC.
Please wait to submit your entries until after that time.
4) If your entry is selected as a winner, it will be modified as follows:
Your 'build' instructions will be incorporated into a makefile.
Your source code will be the file prog.c. The compiled binary
will be called prog.
5) Your entry must not modify the content or filename of any part of your
original entry including, but not limited to prog.c, the Makefile
(we create from your how to build instructions), as well as any data
files you submit.
If you entry wishes to modify such content, it must first copy the
file to a new filename and then modify that copy.
6) I am not a rule, I am a free(void *man)!
| while (!understand(ioccc(rule(you(are(number(6))))))) { ha_ha_ha(); }
7) The obfuscated C program must be an original work that you own.
You (the authors) must own the contents of your submission OR
you must have permission from the owners to submit their content
under the Creative Commons Attribution-ShareAlike 3.0 Unported
(CC BY-SA 3.0) license (see rule 18).
If you submit any content that is owned by others, you MUST
detail that ownership (i.e., who owns what) and document the
permission you obtained.
Please note that the IOCCC size tool is not an original work.
| 8) Entries must be received prior to the end of this IOCCC which is:
| 2020-Mar-15 06:26:49 UTC
A confirmation of submission will be sent to the submitter
email address before the close of the contest.
| 9) Each person may submit up to and including 8.000000 entries per contest.
Each entry must be submitted separately.
10) Entries requiring human interaction to be initially compiled are
not permitted.
11) Programs that require special privileges (setuid, setgid, super-user,
special owner, special group, etc.) are still highly discouraged. We
do not guarantee these functions will behave as you expect on our test
platforms. If your program needs special permissions please document
them in the remarks file.
12) Legal abuse of the rules is somewhat encouraged. An entry that, in
the opinion of the judges, violates the rules will be disqualified.
Entries that attempt to abuse the rules must try to justify why
their rule abuse is legal in the remarks file.
13) Any C source that fails to compile because of unescaped octets with
the high bit set (octet value >= 128) will be rejected.
14) Any C source that fails to compile because of lines with trailing
control-M's (i.e., lines with a tailing octet 015) will be rejected.
Please do not put trailing control-M's on remarks file lines.
Please check to be sure, before submitting, that you have removed
any control-M at the end of remark file lines.
15) When you submit your entry you must have a valid email address
that can both send and receive email. The online submission
method is a two phase process that requires the use of an
approval code. This code will be emailed to you as part of
phase 1.
Entries submitted without a working or valid email address will
be disqualified.
The judges are not responsible for delays in email, please plan
enough time for one automated exchange of email as part of your
submission.
After your email address has been confirmed, the submission code will
be valid for submitting and editing the entry for the lifetime of the
competition.
16) You are STRONGLY encouraged to submit a previously unpublished and
original entry. Submissions that are similar to previous entries are
discouraged. As we judge anonymously, submissions that have already
been published may be disqualified.
17) The total size of your submission: the sum of the size of the program,
hints, comments, build and info files MUST be less than or equal
to 1048576 octets in size.
18) The entirety of your entry must be submitted under the Creative Commons
Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0):
http://creativecommons.org/licenses/by-sa/3.0/
You must not submit anything that cannot be submitted under that license.
19) The remarks file must be written in markdown format. See:
http://daringfireball.net/projects/markdown/basics
for more information.
We currently use "Discount" to convert markdown to HTML
http://www.pell.portland.or.us/~orc/Code/discount/
20) The how to build instructions must be in make form.
The target of the make file must be called prog. The original
C source file must be called prog.c.
To invoke the C compiler, use ${CC}.
To invoke the C preprocessor use ${CPP}.
Do not assume that . (the current directory) is in the $PATH.
Use a shell command syntax that is compatible with bash.
Assume that commands commonly found in POSIX-like / Linux-like systems
are available in the search path.
Do not assume any particular given value of ${CFLAGS} or other
commonly used make variables.
21) Your entry must not create nor modify files above the current directory
with the exception of the /tmp and the /var/tmp directories. Your entry
may create subdirectories below the current directory, or in /tmp,
or in /var/tmp provided that "." is not the first octet in any
directory name.
22) Catch 22:
Your source code, data files, remarks and program output must NOT
identify the authors of your code. The judges STRONGLY prefer to
not know who is submitting entries to the IOCCC.
Even if you are a previous IOCCC winner, catch 22 still applies.
Identifying the authors of your entry in an obvious way anywhere
within 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.
Yes, Virginia, we really mean it!
23) This prime rule number is reserved for future use.
24) Even though 24 is not prime, you should still see rule #23.
| 25) The IOCCC rule set consists of at least 26 rules.
| 26) Rule 26 is also a rule.
FOR MORE INFORMATION:
The judging will be done by Leonid A. Broukhis, Simon Cooper,
Landon Curt Noll.
Please send questions or comments about the contest, to:
| q.2020@ioccc.org (for questions only!)
You must include the words:
| ioccc 2020 question
| in the subject of your Email message when sending Email to the judges.
The rules and the guidelines may (and often do) change from year to
year. You should be sure you have the current rules and guidelines
prior to submitting entries. To obtain them, visit the IOCCC web page:
http://www.ioccc.org
It has rules, guidelines and winners of previous contests (1984 to date).
For the updates and breaking IOCCC news, you are encouraged to follow
the twitter handle:
@IOCCC
You do not have to be a twitter user to follow @IOCCC. Non-twitter
users should access:
https://twitter.com/ioccc
Non-twitter users should force their browsers to reload the above URL
to be sure they are seeing the most recent tweets.
Leonid A. Broukhis
Simon Cooper
chongo (Landon Curt Noll) /\cc/\
2020/whowon.html
+131
View File
@@ -0,0 +1,131 @@
<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
<HTML>
<HEAD>
<META http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<META name="description" content="International Obfuscated C Code Contest">
<META name="keywords" content="International, Obfuscated, C, c, IOCCC,ioccc, obfuscated, Obfuscate, obfuscate, Landon Curt Noll, chongo, Leonid A. Broukhis, leob, Simon Cooper, sc">
<link rel="stylesheet"
type="text/css"
href="hint.css" />
<TITLE>The 27<sup>th</sup> IOCCC Winners</TITLE>
</HEAD>
<BODY TEXT="#000000">
<CENTER>
<IMG SRC="/png/ioccc.png" ALT="IOCCC" height=78 width=267>
<P><FONT size="6"><I>The International Obfuscated C Code Contest</I></FONT></P>
<div id="bar">
<ul>
<li><a href="index.html">About the 27th IOCCC</a></li>
<li><a href="whowon.html">27th IOCCC Winners</a></li>
<li><a href="/index.html">IOCCC home</a></li>
<li><a href="/winners.html">List of All Winners</a></li>
<li><a href="/judges.html">The Judges</a></li>
</ul>
</div>
<P><FONT size="6"><B>The 27<sup>th</sup> IOCCC Winners</B></FONT></P>
</CENTER>
<P>Here are the names and categories for the winners of the 27<sup>th</sup> IOCCC:</P>
<UL>
<LI>
<A HREF="burton/index.html"><B>Best one-liner</B></A>
<BLOCKQUOTE>Dave Burton (US) - Byte to binary, no loops, 1-liner</BLOCKQUOTE>
<LI>
<A HREF="kurdyukov1/index.html"><B>Best utility</B></A>
<BLOCKQUOTE>Ilya Kurdyukov (RU) - MD5 checksum</BLOCKQUOTE>
<LI>
<A HREF="endoh1/index.html"><B>Most explosive</B></A>
<BLOCKQUOTE>Yusuke Endoh (JP) - Minesweeper solver</BLOCKQUOTE>
<LI>
<A HREF="tsoj/index.html"><B>Most misleading indentation</B></A>
<BLOCKQUOTE> tsoj (DE) - Asteroids</BLOCKQUOTE>
<LI>
<A HREF="endoh3/index.html"><B>Most head-turning</B></A>
<BLOCKQUOTE>Yusuke Endoh (JP) - ASCII clock</BLOCKQUOTE>
<LI>
<A HREF="ferguson1/index.html"><B>Don't tread on me award</B></A>
<BLOCKQUOTE>Cody Boone Ferguson (US) - Snake game</BLOCKQUOTE>
<LI>
<A HREF="kurdyukov4/index.html"><B>Best abuse of lámatyávë</B></A>
<BLOCKQUOTE>Ilya Kurdyukov (RU) - Markov chain text generator</BLOCKQUOTE>
<LI>
<A HREF="ferguson2/index.html"><B>Most enigmatic</B></A>
<BLOCKQUOTE>Cody Boone Ferguson (US) - Enigma machine</BLOCKQUOTE>
<LI>
<A HREF="giles/index.html"><B>Most phony</B></A>
<BLOCKQUOTE>Edward Giles (AU) - DTMF encoder/decoder</BLOCKQUOTE>
<LI>
<A HREF="kurdyukov3/index.html"><B>Bset slaml prragom</B></A>
<BLOCKQUOTE>Ilya Kurdyukov (RU) - Letter permuter</BLOCKQUOTE>
<LI>
<A HREF="endoh2/index.html"><B>Best perspective</B></A>
<BLOCKQUOTE>Yusuke Endoh (JP) - Star Wars crawler</BLOCKQUOTE>
<LI>
<A HREF="kurdyukov2/index.html"><B>Least detailed</B></A>
<BLOCKQUOTE>Ilya Kurdyukov (RU) - Image segmenter</BLOCKQUOTE>
<LI>
<A HREF="otterness/index.html"><B>Most percussive</B></A>
<BLOCKQUOTE>Nathan Otterness (US) - MIDI improver</BLOCKQUOTE>
<LI>
<A HREF="yang/index.html"><B>Best abuse of CPP</B></A>
<BLOCKQUOTE>Don Yang (US) - PIN-protected program generator</BLOCKQUOTE>
<LI>
<A HREF="carlini/index.html"><B>Best of show - abuse of libc</B></A>
<BLOCKQUOTE>Nicholas Carlini (US) - printf machine</BLOCKQUOTE>
</UL>
<P>The <a href="index.html">Judges annoucement and notes</a> for the 27<sup>th</sup> IOCCC.</p>
<P>
<HR SIZE="1">
<!-- Authored by: <A HREF="http://www.sfik.com">sc</A> -->
<TABLE>
<TR>
<TD>
<a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="/png/by-sa-3.0-88x31.png" /></a>
</TD>
<TD><P>This work by <A HREF="/judges.html">Landon Curt Noll, Simon Cooper, and Leonid A. Broukhis</A>
is licensed under a <a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P>
</TD>
</TR>
</TABLE>
</BODY>
</HTML>