Add preview of 1984-2019
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
1 parent
28efc67f5d
commit
c0663537cb
1683 files changed
+220064
No files matched your search
@@ -0,0 +1,286 @@
|
||||
#!/usr/bin/env make
|
||||
#
|
||||
# 2018 makefile
|
||||
#
|
||||
# This work by Landon Curt Noll, Simon Cooper, and Leonid A. Broukhis
|
||||
# is licensed under:
|
||||
#
|
||||
# Creative Commons Attribution-ShareAlike 3.0 Unported License.
|
||||
#
|
||||
# See: http://creativecommons.org/licenses/by-sa/3.0/
|
||||
|
||||
|
||||
################
|
||||
# tool locations
|
||||
################
|
||||
#
|
||||
SHELL= /bin/bash
|
||||
CP= cp
|
||||
CPP= cpp
|
||||
GUNZIP= gunzip
|
||||
BUNZIP2= bunzip2
|
||||
GZIP_PROG= gzip
|
||||
BZIP2= bzip2
|
||||
CURL= curl
|
||||
DD= dd
|
||||
LD= ld
|
||||
MAKE= make
|
||||
RM= rm
|
||||
SED= sed
|
||||
TAR= tar
|
||||
TRUE= true
|
||||
MKDIR= mkdir
|
||||
MV= mv
|
||||
TR= tr
|
||||
GREP= grep
|
||||
SORT= sort
|
||||
UNIQ= uniq
|
||||
|
||||
# Set X11_LIBDIR to the directory where the X11 library resides
|
||||
#
|
||||
#X11_LIBDIR= /usr/X11R6/lib
|
||||
#X11_LIBDIR= /usr/X11/lib
|
||||
X11_LIBDIR= /opt/X11/lib
|
||||
|
||||
# Set X11_INCLUDEDIR to the directory where the X11 include files reside
|
||||
#
|
||||
#X11_INCDIR= /usr/X11R6/include
|
||||
#X11_INCDIR= /usr/X11/include
|
||||
X11_INCDIR= /opt/X11/include
|
||||
|
||||
# Compiler warnings
|
||||
#
|
||||
#CWARN=
|
||||
#CWARN= -Wall
|
||||
#CWARN= -Wall -Wextra
|
||||
CWARN= -Wall -Wextra -pedantic ${CSILENCE}
|
||||
#CWARN= -Wall -Wextra -Weverything
|
||||
#CWARN= -Wall -Wextra -Weverything -pedantic
|
||||
#CWARN= -Wall -Wextra -Weverything -pedantic ${CSILENCE}
|
||||
|
||||
# Silence warnings that ${CWARN} would normally complain about
|
||||
#
|
||||
CSILENCE=
|
||||
#CSILENCE= -Wno-implicit-int
|
||||
|
||||
# compiler standard
|
||||
#
|
||||
#CSTD=
|
||||
#CSTD= -ansi
|
||||
CSTD= -std=c11
|
||||
|
||||
# compiler bit architecture
|
||||
#
|
||||
# Some entries require 32-bitness:
|
||||
# ARCH= -m32
|
||||
#
|
||||
# Some entries require 64-bitness:
|
||||
# ARCH= -m64
|
||||
#
|
||||
# By default we assume nothing:
|
||||
#
|
||||
ARCH=
|
||||
|
||||
# defines that are needed to compile
|
||||
#
|
||||
CDEFINE=
|
||||
#CDEFINE= -DIOCCC=25
|
||||
|
||||
# include files that are needed to compile
|
||||
#
|
||||
CINCLUDE=
|
||||
#CINCLUDE= -include stdlib.h
|
||||
#CINCLUDE= -include stdio.h
|
||||
#CINCLUDE= -include stdlib.h -include stdio.h
|
||||
#CINCLUDE= -I ${X11_INCDIR}
|
||||
|
||||
# optimization
|
||||
#
|
||||
# Most compiles will safely use -O2. Some can use only -O1 or -O.
|
||||
# A few compilers have broken optimizers or this entry make break
|
||||
# under those buggy optimizers and thus you may not want anything.
|
||||
# Reasonable compilers will allow for -O3.
|
||||
#
|
||||
#OPT=
|
||||
#OPT= -O
|
||||
#OPT= -O1
|
||||
#OPT= -O2
|
||||
OPT= -O3
|
||||
|
||||
# default flags for ANSI C compilation
|
||||
#
|
||||
CFLAGS= ${CSTD} ${CWARN} ${ARCH} ${CDEFINE} ${CINCLUDE} ${OPT}
|
||||
|
||||
# Libraries needed to build
|
||||
#
|
||||
LIBS=
|
||||
#LIBS= -L ${X11_LIBDIR}
|
||||
|
||||
# ANSI compiler
|
||||
#
|
||||
# Set CC to the name of your ANSI compiler.
|
||||
#
|
||||
# Some entries seem to need gcc. If you have gcc, set
|
||||
# both CC and MAY_NEED_GCC to gcc.
|
||||
#
|
||||
# If you do not have gcc, set CC to the name of your ANSI compiler, and
|
||||
# set MAY_NEED_GCC to either ${CC} (and hope for the best) or to just :
|
||||
# to disable such programs.
|
||||
#
|
||||
CC= cc
|
||||
#CC=clang
|
||||
MAY_NEED_GCC= gcc
|
||||
|
||||
|
||||
##############################
|
||||
# Special flags for this entry
|
||||
##############################
|
||||
#
|
||||
OBJ= prog.o
|
||||
DATA=
|
||||
TARGET= prog
|
||||
#
|
||||
ALT_OBJ= prog.orig.o
|
||||
ALT_TARGET= prog.orig
|
||||
|
||||
|
||||
#################
|
||||
# build the entry
|
||||
#################
|
||||
#
|
||||
all: ${TARGET} ${DATA}
|
||||
@${TRUE}
|
||||
|
||||
prog: prog.c
|
||||
${CC} ${CFLAGS} $< -o $@ ${LIBS}
|
||||
|
||||
# alternative executable
|
||||
#
|
||||
alt: ${ALT_TARGET}
|
||||
@${TRUE}
|
||||
|
||||
prog.orig: prog.orig.c
|
||||
${CC} ${CFLAGS} $< -o $@ ${LIBS}
|
||||
|
||||
# data files
|
||||
#
|
||||
data: ${DATA}
|
||||
@${TRUE}
|
||||
|
||||
|
||||
###############
|
||||
# utility rules
|
||||
###############
|
||||
#
|
||||
everything: all alt
|
||||
|
||||
clean:
|
||||
${RM} -f ${OBJ} ${ALT_OBJ}
|
||||
|
||||
clobber: clean
|
||||
${RM} -f ${TARGET} ${ALT_TARGET}
|
||||
@-if [ -e sandwich ]; then \
|
||||
${RM} -f sandwich; \
|
||||
echo 'ate sandwich'; \
|
||||
fi
|
||||
|
||||
nuke: clobber
|
||||
@${TRUE}
|
||||
|
||||
dist_clean: nuke
|
||||
@${TRUE}
|
||||
|
||||
install:
|
||||
@echo "Surely you are performing, Dr. May!"
|
||||
@${TRUE}
|
||||
|
||||
# backwards compatibility
|
||||
#
|
||||
build: all
|
||||
@${TRUE}
|
||||
|
||||
|
||||
##################
|
||||
# 133t hacker rulz
|
||||
##################
|
||||
#
|
||||
love:
|
||||
@echo 'not war?'
|
||||
@${TRUE}
|
||||
|
||||
haste:
|
||||
$(MAKE) waste
|
||||
@${TRUE}
|
||||
|
||||
waste:
|
||||
@echo 'haste'
|
||||
@${TRUE}
|
||||
|
||||
make:
|
||||
@echo 'Attend a maker faire'
|
||||
@${TRUE}
|
||||
|
||||
easter_egg:
|
||||
@echo you expected to often mis-understand this $${RANDOM} magic
|
||||
@echo chongo '<was here>' "/\\oo/\\"
|
||||
@echo Eggy
|
||||
|
||||
fabricate fashion form frame manufacture produce: make
|
||||
@${TRUE}
|
||||
|
||||
sandwich:
|
||||
@if [ `id -u` -eq 0 ]; then \
|
||||
echo 'Okay.'; \
|
||||
echo $${RANDOM}`date +%s`$${RANDOM} > $@; \
|
||||
else \
|
||||
echo 'What? Make it yourself.'; \
|
||||
exit 1; \
|
||||
fi
|
||||
|
||||
# Understand the history of the Homebrew Computer Club
|
||||
# as well as the West Coast Computer Faire and
|
||||
# you might be confused different. :-)
|
||||
#
|
||||
supernova: nuke
|
||||
@-if [ -r .code_anal ]; then \
|
||||
${RM} -f .code_anal_v6; \
|
||||
else \
|
||||
echo "planet deniers, like some members of the IAU, are so cute when they try to defend their logic"; \
|
||||
fi
|
||||
@echo A $@ helps ${MAKE} the elements that help form planets
|
||||
@${TRUE}
|
||||
|
||||
deep_magic:
|
||||
@-if [ -r .code_anal ]; then \
|
||||
ccode_analysis --deep_magic 3a3fabb90892eeb2f610ae0f74a35a970060665a063ab702bd686c17c4ae07f6 --FNV1a_hash_256_bit "prog"; \
|
||||
else \
|
||||
echo "Wrong! Do it again!"; \
|
||||
sleep 2; \
|
||||
echo "Wrong! Do it again!"; \
|
||||
sleep 2; \
|
||||
echo "Wrong! Do it again!"; \
|
||||
fi
|
||||
@${TRUE}
|
||||
|
||||
magic: deep_magic
|
||||
@-if [ -r .code_anal ]; then \
|
||||
ccode_analysis --mode 216091 --level 216193 --FNV1a_hash_256_bit "prog"; \
|
||||
else \
|
||||
echo "If you don't eat yer meat, you can't have any pudding!"; \
|
||||
echo "How can you have any pudding if you don't eat yer meat?!"; \
|
||||
fi
|
||||
@${TRUE}
|
||||
|
||||
# The IOCCC resident astronomer states
|
||||
#
|
||||
charon: supernova
|
||||
@echo $@ is a dwarf planet
|
||||
@echo dwarf is a type of planet
|
||||
@echo $@ is a planet
|
||||
|
||||
pluto: supernova
|
||||
${MAKE} charon
|
||||
@echo $@ is a dwarf planet
|
||||
@echo dwarf is a type of planet
|
||||
@echo $@ is a planet
|
||||
@echo get used to having lots of planets because a $< can ${MAKE} a lot of them
|
||||
@@ -0,0 +1,99 @@
|
||||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
|
||||
<html>
|
||||
<head>
|
||||
<meta name="GENERATOR" content="mkd2html 2.1.5a DL=DISCOUNT">
|
||||
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=utf-8">
|
||||
<link rel="stylesheet"
|
||||
type="text/css"
|
||||
href="../hint.css">
|
||||
<title>Most able to divine code gaps</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1>Most able to divine code gaps</h1>
|
||||
|
||||
<p>Derek Anderson</p>
|
||||
|
||||
<h2>Judges' comments:</h2>
|
||||
|
||||
<h3>To use:</h3>
|
||||
|
||||
<pre><code>make
|
||||
./prog < textfile
|
||||
</code></pre>
|
||||
|
||||
<h3>Try:</h3>
|
||||
|
||||
<pre><code>./prog < prog.c
|
||||
./prog < prog.orig.c
|
||||
./prog < hint.text
|
||||
</code></pre>
|
||||
|
||||
<h3>Selected Judges Remarks:</h3>
|
||||
|
||||
<p>With this entry, you won’t need to turn your monitor <a href="http://en.wikipedia.org/wiki/River_%28typography%29">upside down</a>!</p>
|
||||
|
||||
<p>Compare <code>prog.c</code> and <code>prog.orig.c</code> and find out why we had to modify the entry, and what confused the author
|
||||
(see the author’s remarks). No, it was not the shape of the Roman V that we, or the compiler, didn’t like.</p>
|
||||
|
||||
<h2>Author’s comments:</h2>
|
||||
|
||||
<h2>Compiling the program</h2>
|
||||
|
||||
<pre><code>gcc -Wall -Wextra -Wpedantic -O3 -std=c11 prog.c -o prog
|
||||
</code></pre>
|
||||
|
||||
<p>Also works with a standard of c99, but c90/c89 will not compile due to
|
||||
for loop initial declarations, along with additional warnings about
|
||||
variable length arrays and lack of a return statement.</p>
|
||||
|
||||
<h2>Additional info</h2>
|
||||
|
||||
<p>This small program, when given text on stdin, will produce a pattern of
|
||||
squiggly lines. This pattern is deterministic, and it shouldn’t be too
|
||||
difficult to determine from whence they come. There is even a comment
|
||||
that describes the highlighted phenomena in the source, for those that
|
||||
require a small nudge. With denser text blocks, such as an essay or
|
||||
similar prose, the output can be rather pretty, in an chaotic emergence
|
||||
sort of way. Try using this file, or the source file as inputs.</p>
|
||||
|
||||
<p>In its current form, this program can handle lines of length 255; to
|
||||
adjust this limit, change the variable <code>a</code> at the top of the source.
|
||||
Other adjustments, such as the exact printed characters, are rather
|
||||
easy, once sufficient reverse engineering has occurred. Improvements
|
||||
such as proper handling of tabs are left as an exercise to the reader.</p>
|
||||
|
||||
<p>In developing this program, the author found a potentially interesting
|
||||
bug. If the expression <code>(j=k,j)</code> (near the middle of the source) is
|
||||
changed to <code>(j=k,k)</code>, the program produces different output. The author
|
||||
used compiler gcc 5.4.0, compiled for x86_64-linux-gnu. Enabling or
|
||||
disabling optimization produces the same results. The author is not
|
||||
sure who is the culprit, but instead shrugged and moved on with life.
|
||||
Of course, YMMV with your own environment.</p>
|
||||
|
||||
<p>The structure of this program, as you may have deduced, is two for
|
||||
loops, one nested in the other. There is also a bunch of direct
|
||||
variable assignment, such as <code>j=k</code>. There is some filler fluff, such as
|
||||
<code>0-0+0</code>, but all that sort should be rather easy to spot. It was mostly
|
||||
added for the purpose of making certain things line up right, and only
|
||||
secondarily to obfuscate.</p>
|
||||
|
||||
<hr />
|
||||
|
||||
<!--
|
||||
(c) Copyright 1984-2018, [Leo Broukhis, Simon Cooper, Landon Curt Noll][judges] - All rights reserved
|
||||
This work is licensed under a [Creative Commons Attribution-ShareAlike 3.0 Unported License][cc].
|
||||
|
||||
[judges]: http://www.ioccc.org/judges.html
|
||||
[cc]: http://creativecommons.org/licenses/by-sa/3.0/
|
||||
-->
|
||||
|
||||
<TABLE><TR>
|
||||
<TD><a rel="license" href="http://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by-sa/3.0/88x31.png" /></a></TD>
|
||||
<TD><P>© Copyright 1984-2018,
|
||||
<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="http://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P></TD>
|
||||
<TD> <!--<a href="http://validator.w3.org/check?uri=referer"><img src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional" height="31" width="88"></a>--></TD>
|
||||
</TR></TABLE>
|
||||
</body>
|
||||
</html>
|
||||
@@ -0,0 +1,73 @@
|
||||
# Most able to divine code gaps
|
||||
|
||||
Derek Anderson
|
||||
|
||||
|
||||
## Judges' comments:
|
||||
### To use:
|
||||
|
||||
make
|
||||
./prog < textfile
|
||||
|
||||
### Try:
|
||||
|
||||
./prog < prog.c
|
||||
./prog < prog.orig.c
|
||||
./prog < hint.text
|
||||
|
||||
### Selected Judges Remarks:
|
||||
|
||||
With this entry, you won't need to turn your monitor [upside down](http://en.wikipedia.org/wiki/River_%28typography%29)!
|
||||
|
||||
Compare `prog.c` and `prog.orig.c` and find out why we had to modify the entry, and what confused the author
|
||||
(see the author's remarks). No, it was not the shape of the Roman V that we, or the compiler, didn't like.
|
||||
|
||||
|
||||
## Author's comments:
|
||||
## Compiling the program
|
||||
|
||||
gcc -Wall -Wextra -Wpedantic -O3 -std=c11 prog.c -o prog
|
||||
|
||||
Also works with a standard of c99, but c90/c89 will not compile due to
|
||||
for loop initial declarations, along with additional warnings about
|
||||
variable length arrays and lack of a return statement.
|
||||
|
||||
## Additional info
|
||||
|
||||
This small program, when given text on stdin, will produce a pattern of
|
||||
squiggly lines. This pattern is deterministic, and it shouldn't be too
|
||||
difficult to determine from whence they come. There is even a comment
|
||||
that describes the highlighted phenomena in the source, for those that
|
||||
require a small nudge. With denser text blocks, such as an essay or
|
||||
similar prose, the output can be rather pretty, in an chaotic emergence
|
||||
sort of way. Try using this file, or the source file as inputs.
|
||||
|
||||
In its current form, this program can handle lines of length 255; to
|
||||
adjust this limit, change the variable `a` at the top of the source.
|
||||
Other adjustments, such as the exact printed characters, are rather
|
||||
easy, once sufficient reverse engineering has occurred. Improvements
|
||||
such as proper handling of tabs are left as an exercise to the reader.
|
||||
|
||||
In developing this program, the author found a potentially interesting
|
||||
bug. If the expression `(j=k,j)` (near the middle of the source) is
|
||||
changed to `(j=k,k)`, the program produces different output. The author
|
||||
used compiler gcc 5.4.0, compiled for x86_64-linux-gnu. Enabling or
|
||||
disabling optimization produces the same results. The author is not
|
||||
sure who is the culprit, but instead shrugged and moved on with life.
|
||||
Of course, YMMV with your own environment.
|
||||
|
||||
The structure of this program, as you may have deduced, is two for
|
||||
loops, one nested in the other. There is also a bunch of direct
|
||||
variable assignment, such as `j=k`. There is some filler fluff, such as
|
||||
`0-0+0`, but all that sort should be rather easy to spot. It was mostly
|
||||
added for the purpose of making certain things line up right, and only
|
||||
secondarily to obfuscate.
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
<!--
|
||||
(c) Copyright 1984-2018, [Leo Broukhis, Simon Cooper, Landon Curt Noll][judges] - All rights reserved
|
||||
This work is licensed under a [Creative Commons Attribution-ShareAlike 3.0 Unported License][cc].
|
||||
|
||||
[judges]: http://www.ioccc.org/judges.html
|
||||
[cc]: http://creativecommons.org/licenses/by-sa/3.0/
|
||||
-->
|
||||
@@ -0,0 +1,16 @@
|
||||
#include<stdio.h>
|
||||
int a = 256;int main(){for(char b[a+a+a],
|
||||
*c=b ,*d=b+ a ,*e=b+a+a,*f,*g=fgets(e,(b[
|
||||
a]=b [a+a] =a- a,a) , stdin);c[0]=a-a,f=c
|
||||
,c=d ,d=e ,e=f, f= g,g =0,g = fgets(e,a+a
|
||||
-a+ a -a+a -a+ a- +a,stdin ),f +a-a ; pu\
|
||||
tchar(+10)) { for( int h= 1,i=1,j, k=0 ,l
|
||||
=e[0]==32,m,n=0,o=c [ 0]== 32, p, q=0;d[q
|
||||
];j=k,k=l,m=n,n=o,p=(j)+(k* 2 )+(l =(i =
|
||||
e[ q]&&i ) &&e[q +1 ]== 32,l*4)+(m* 8 )+(
|
||||
16* n )+( o =(h =c[ q]&&h)&&c[q+1]==
|
||||
32,o* (16+16) )+0-0 +0, putchar(" ......"
|
||||
/*\ ( ||| ) |/|/ / */".')|)\\\\\\\\'"
|
||||
"" "|||" "|||" "|'" ")|)\\\\\\\\'/|/(/"
|
||||
"(/'/|/\\|\\|'/|/(/(/'/|/\\|\\|"[d[q++]==
|
||||
32?p:0]));}}/* typographic tributaries */
|
||||
@@ -0,0 +1,16 @@
|
||||
#include<stdio.h>
|
||||
int a = 256;int main(){for(char b[a+a+a],
|
||||
*c=b ,*d=b+ a ,*e=b+a+a,*f,*g=fgets(e,(b[
|
||||
a]=b [a+a] =a- a,a) , stdin);c[0]=a-a,f=c
|
||||
,c=d ,d=e ,e=f, f= g,g =g,g = fgets(e,a+a
|
||||
-a+ a -a+a -a+ a- +a,stdin ),f +a-a ; pu\
|
||||
tchar(+10)) { for( int h= 1,i=1,j, k=0 ,l
|
||||
=e[0]==32,m,n=0,o=c [ 0]== 32, p, q=0;d[q
|
||||
];p=(j=k,j)+(k=l,k*2)+(l=(i = i&&e [q] )
|
||||
&& e[q+1 ] ==32, l *4)+( m=n,m*8)+( n =o,
|
||||
16* n )+( o =(h =c[ q]&&h)&&c[q+1]==
|
||||
32,o* (16+16) )+0-0 +0, putchar(" ......"
|
||||
/*\ ( ||| ) |/|/ / */".')|)\\\\\\\\'"
|
||||
"" "|||" "|||" "|'" ")|)\\\\\\\\'/|/(/"
|
||||
"(/'/|/\\|\\|'/|/(/(/'/|/\\|\\|"[d[q++]==
|
||||
32?p:0]));}}/* typographic tributaries */
|
||||
Reference in new issue
Block a user