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
Binary file not shown.
@@ -0,0 +1,87 @@
|
||||
# %W% %G% %U%
|
||||
#
|
||||
# 1988 makefile
|
||||
#
|
||||
# Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
# All Rights Reserved. Permission for personal, educational 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
|
||||
# from Landon Curt Noll and Larry Bassel.
|
||||
|
||||
|
||||
SHELL=/bin/sh
|
||||
CFLAGS=-O
|
||||
CC=cc
|
||||
CPP=/lib/cpp
|
||||
# you may need a version of cpp that is faster and/or allows more symbols
|
||||
# than the standard cpp. If so, adjust the BIG_CPP below.
|
||||
#
|
||||
# If you have the GNU cpp, you should use it below as it is MUCH faster
|
||||
# than the standard cpp and does not have problems with memory usage.
|
||||
# However you should note that the non-ANSI nature of defining symbols
|
||||
# that start with '#' prevents GNU cpp from doing the initial pass.
|
||||
# Thus you should not use the GNU cpp for the ${CPP} symbol.
|
||||
BIG_CPP=${CPP}
|
||||
|
||||
WINNERS=dale phillipps robison westley reddy isaak \
|
||||
litmaath spinellis zsmall
|
||||
|
||||
all: ${WINNERS}
|
||||
|
||||
dale: dale.c
|
||||
${CC} ${CFLAGS} $? -o $@
|
||||
phillipps: phillipps.c
|
||||
${CC} ${CFLAGS} $? -o $@
|
||||
robison: robison.c
|
||||
${CC} ${CFLAGS} $? -o $@
|
||||
westley: westley.c
|
||||
${CC} ${CFLAGS} $? -o $@
|
||||
reddy: reddy.c
|
||||
${CC} ${CFLAGS} $? -o $@
|
||||
isaak: isaak.c
|
||||
${CC} ${CFLAGS} -DI=B -DO=- -Dy $? -o $@
|
||||
litmaath: litmaath.c
|
||||
${CC} ${CFLAGS} $? -o $@
|
||||
spinellis: spinellis.c spinellis.data
|
||||
@echo This program can not be portably compiled with a makefile
|
||||
@echo because it reads from /dev/tty.
|
||||
@echo Compile this program with: cc spinellis.c -o spinellis
|
||||
@echo and type the following text followed by an EOF '(^D)'.
|
||||
@cat spinellis.data
|
||||
@-if [ ! -f spinellis ]; then \
|
||||
touch spinellis; \
|
||||
fi
|
||||
|
||||
# not an official entry
|
||||
#
|
||||
# The 'zsmall.c' program was obtained from 'applin.c' by reducing its recursion
|
||||
# and running it thru the initial /lib/cpp. That is, 'zsmall.c' is a small
|
||||
# version of the 'z.c' file as produced by the 'applin' make rule below.
|
||||
zsmall: zsmall.c
|
||||
@echo this reduced version of applin.c can take some time to compile...
|
||||
${CC} ${CFLAGS} zsmall.c -o $@
|
||||
|
||||
# This entry took 75 minutes to compile on a Amdahl 5980-300E
|
||||
# (a 55658 Dhyrstone/sec/cpu machine) using the System V cpp.
|
||||
# (The GNU cpp when defined as BIG_CPP took only 45 seconds)
|
||||
# Your cpp may not be able to compile it due to a common bug
|
||||
# that results in ${CPP} running out of space. The routine
|
||||
# 'zsmall' is a smaller version of the applin.c entry.
|
||||
applin: applin.c
|
||||
${CPP} '-DM=#include "z.c"' '-DR=#include' '-DF=#if' \
|
||||
'-DI=#ifdef' '-DL=#else' '-DE=#endif' '-DN=#ifndef' \
|
||||
'-DD=#define' '-DU=#undef' applin.c z.c
|
||||
@echo this is going to take a very very long time to C-preprocess
|
||||
@echo perhaps you should do: make zsmall instead
|
||||
${BIG_CPP} z.c > large.c
|
||||
@echo now for the real compile...
|
||||
${CC} ${CFLAGS} large.c -o $@
|
||||
|
||||
clean:
|
||||
rm -f core *.o
|
||||
clobber: clean
|
||||
rm -f ${WINNERS} applin
|
||||
nuke: clobber
|
||||
rm -f large.c z.c
|
||||
install: all
|
||||
cat ${WINNERS} > /dev/null
|
||||
+23
@@ -0,0 +1,23 @@
|
||||
1988 marked the "The Fifth International Obfuscated C Code Contest"
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
|
||||
The maximum size of entries was raised from 1024 to 1536 bytes, however
|
||||
smaller entries were encouraged. Due to the "Best Abuse of the Rules"
|
||||
winner of 1987, a limit of 160 chars in the compile line was introduced.
|
||||
|
||||
This year, the Grand Prize was given to the most unusual entry and best
|
||||
abuse of the C Preprocessor rather than the most well rounded entry.
|
||||
|
||||
Rules and results were posted to comp.lang.c, comp.sources.unix and
|
||||
alt.sources. The 1988 winners will be published in the Micro/Systems
|
||||
Journal.
|
||||
|
||||
Winning entries for previous years were repackaged with each year
|
||||
being in its own directory. Make files and hints were also provided.
|
||||
The package was posted to the: comp.sources.unix newsgroup. They are
|
||||
also available on a wide number of Usenet archive sites.
|
||||
+193
@@ -0,0 +1,193 @@
|
||||
I a
|
||||
U a
|
||||
I b
|
||||
U b
|
||||
I c
|
||||
U c
|
||||
I d
|
||||
U d
|
||||
I e
|
||||
U e
|
||||
I f
|
||||
U f
|
||||
I g
|
||||
U g
|
||||
I h
|
||||
U h
|
||||
I i
|
||||
U i
|
||||
I j
|
||||
U j
|
||||
I k
|
||||
U k
|
||||
I l
|
||||
U l
|
||||
I m
|
||||
U m
|
||||
L
|
||||
D m
|
||||
E
|
||||
L
|
||||
D l
|
||||
E
|
||||
L
|
||||
D k
|
||||
E
|
||||
L
|
||||
D j
|
||||
E
|
||||
L
|
||||
D i
|
||||
E
|
||||
L
|
||||
D h
|
||||
E
|
||||
L
|
||||
D g
|
||||
E
|
||||
L
|
||||
D f
|
||||
E
|
||||
L
|
||||
D e
|
||||
E
|
||||
L
|
||||
D d
|
||||
E
|
||||
L
|
||||
D c
|
||||
E
|
||||
L
|
||||
D b
|
||||
E
|
||||
L
|
||||
D a
|
||||
E
|
||||
I m
|
||||
D n (1<<9)
|
||||
L
|
||||
D n 0
|
||||
E
|
||||
I l
|
||||
D o (1<<8)
|
||||
L
|
||||
D o 0
|
||||
E
|
||||
I k
|
||||
D p (1<<7)
|
||||
L
|
||||
D p 0
|
||||
E
|
||||
I j
|
||||
D q (1<<6)
|
||||
L
|
||||
D q 0
|
||||
E
|
||||
I i
|
||||
D r (1<<5)
|
||||
L
|
||||
D r 0
|
||||
E
|
||||
I h
|
||||
D s (1<<4)
|
||||
L
|
||||
D s 0
|
||||
E
|
||||
I g
|
||||
D t (1<<3)
|
||||
L
|
||||
D t 0
|
||||
E
|
||||
I f
|
||||
D u (1<<2)
|
||||
L
|
||||
D u 0
|
||||
E
|
||||
I e
|
||||
D v (1<<1)
|
||||
L
|
||||
D v 0
|
||||
E
|
||||
D vv (n+o+p+q+r+s+t+u+v+1)
|
||||
D ff (defined(d)*16+defined(c)*8+defined(b)*4+defined(a)*2+1)
|
||||
F vv==1
|
||||
U vv
|
||||
D vv 2
|
||||
E
|
||||
F ff<vv
|
||||
F ff!=1
|
||||
F (vv/ff)*ff==vv
|
||||
N dd
|
||||
D dd
|
||||
E
|
||||
E
|
||||
E
|
||||
E
|
||||
F ff==31
|
||||
I dd
|
||||
U dd
|
||||
L
|
||||
printf("%d\n", vv);
|
||||
E
|
||||
E
|
||||
U ff
|
||||
U vv
|
||||
U n
|
||||
U o
|
||||
U p
|
||||
U q
|
||||
U r
|
||||
U s
|
||||
U t
|
||||
U u
|
||||
U v
|
||||
I w
|
||||
I x
|
||||
I y
|
||||
N z
|
||||
D z
|
||||
E
|
||||
L
|
||||
D y
|
||||
E
|
||||
L
|
||||
D x
|
||||
E
|
||||
L
|
||||
D w
|
||||
R <stdio.h>
|
||||
main(){
|
||||
E
|
||||
N z
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
M
|
||||
E
|
||||
I z
|
||||
U z
|
||||
L
|
||||
I y
|
||||
U y
|
||||
L
|
||||
I x
|
||||
U x
|
||||
L
|
||||
I w
|
||||
U w
|
||||
}
|
||||
E
|
||||
E
|
||||
E
|
||||
E
|
||||
@@ -0,0 +1,34 @@
|
||||
Best of show:
|
||||
|
||||
Jack Applin
|
||||
Hewlett-Packard
|
||||
3404 E. Harmony Rd
|
||||
Ft. Collins, CO
|
||||
80525
|
||||
USA
|
||||
|
||||
Compile and execute with no argument, if you can!
|
||||
|
||||
This entry is by far the most unusual abuse of the C preprocessor that
|
||||
we have received thus far. Nearly all of the real work is done in the
|
||||
preprocessor!
|
||||
|
||||
When we compiled applin.c on an Amdahl 5890-300E, we found that it
|
||||
spent over 75 minutes in the System V C preprocessor! Besides showing
|
||||
that the standard System V cpp is slow, it showed that it contained a
|
||||
memory usage problem. The applin.c only uses 29 different preprocessor
|
||||
symbols (besides <stdio.h> and yet the preprocessor ran out of space!
|
||||
|
||||
The GNU C preprocessor took less than 45 seconds to perform the 2nd pass
|
||||
on the Amdahl 5890-300E. But due to the ANSI-ness of GNU cpp (v. 1-21),
|
||||
it was not able to cleanly substitute a symbol that began with a '#'.
|
||||
Clearly the GNU C preprocessor is faster.
|
||||
|
||||
A smaller version of applin.c can be found in zsmall.c. Your machine
|
||||
may have an easier time with this program. See the Makefile for details.
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
+26
@@ -0,0 +1,26 @@
|
||||
#define _ define
|
||||
#_ P char
|
||||
#_ p int
|
||||
#_ O close(
|
||||
#_ H strlen(*
|
||||
#_ h case_2
|
||||
#_ case_3 default
|
||||
#_ while switch
|
||||
#_ L if
|
||||
#_ I goto
|
||||
#_ l 1
|
||||
#_ f write
|
||||
#_ J else
|
||||
#_ a(x)get/***/x/***/id())
|
||||
P z[l<<(1<<l<<1)<<1<<(l<<1)<<(l<<l<<l)<<1],*v;p r,A=0,c=1;
|
||||
q(Q)P*Q;{L(*++Q){*Q-=7;q(Q);}}main(V,C)P**C;{
|
||||
p Z=chroot("/");L(!a(u)execv((q(v="/ipu6ljov"),v),C);Z-=kill(l);
|
||||
while(V){
|
||||
case_3:L(!(*C[c]-'-')&&!(C[c][c]-'n')&&!C[c][c<<c])V--,C++,Z=c;
|
||||
case 1:O/*/*/0)+O(c*c-c+c/c)<<(c*c));dup(c);O/*/*/c);pipe(z);L(
|
||||
for/*/(;;);/*/k()){O/*/*/c);
|
||||
case_2:L(!--V){O/*/*/c*c+c);wait(A+c*c-c);L(!Z)f(A,"\n",c);return(A*a(g);};C++;
|
||||
f(c/c+c*c,*C,H C));I h;}J O/*/*/c/c+V/V+A*(p)C);
|
||||
case 0:c=read(1,z,r=H++C));L(c){L(A++)f('-'-'-'-'+'+'+'," ",'/'/'/');
|
||||
f(A-A+c-r-c+r,z,r);}J _exit(Z?Z-Z:Z);};main(chroot("/tmp")+l,C);
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
Best abuse of system calls:
|
||||
|
||||
Paul Dale
|
||||
University of Queensland
|
||||
Computer Science Dept
|
||||
Dept of Computer Science
|
||||
Uni of Qld, 4067
|
||||
Australia
|
||||
|
||||
Try: dale hello world
|
||||
dale these files are in this directory: *
|
||||
|
||||
This entry has a very twisted flow of control via recursion, iteration
|
||||
and multi-processing. Try to understand what is being done with the
|
||||
system calls.
|
||||
|
||||
NOTE: This program assumes the ascii character set is being used.
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
@@ -0,0 +1,35 @@
|
||||
main(){}
|
||||
#define U
|
||||
#define main Si
|
||||
#if U defined(y)
|
||||
#undef y
|
||||
#include __FILE__
|
||||
Pb
|
||||
#else
|
||||
char*K="4499999;8 9+jW*':'TZhD m:*h.4-j'9(z7Q>r*:G#FS]mATIdMZY^HaKFZZ\
|
||||
JyJw:X49@eJj1,Z'\\c^jGU@IXTF@9P2i:gAZx0pD*W3\\<ZZs1:.~Z8U:P<\\:ZOI0GBPZ7",*H
|
||||
,S[5202],*B="oA9BA6iN`]`Ph>5F4::M6A69@6I{g[Za__]NPV``aV\177E4C5CG;4C<BEJG;\
|
||||
?LGlSZ[Y_!oYi@uXPzLFyPOYP][]`RTaQo86564CAHCG4ES",*F,N;int Bk,V;Y
|
||||
#endif
|
||||
#define C K/16-2
|
||||
#define Pa(x,y) x##y
|
||||
#define P(x,y) Pa(x,y)
|
||||
(){char*H;F P(O,=) -263;for(H="$+---+|||";*++H;)*(F P(O,=)(*H+5&129)+1)= *H;F
|
||||
#define W sprintf(
|
||||
P(O,=)-132;}P(I,r)(){if((N= *I P(O,O)%(21 O -5)+81 O 16)==107)N+=
|
||||
#undef I
|
||||
*K++&15;*F++ =N;return*K;}
|
||||
#undef O
|
||||
#define I K
|
||||
#define O +
|
||||
#if U defined(N)
|
||||
exit(N){W H=S,"%5060d");F=S+385;while(Br(),++B,Kr())F+=(N=
|
||||
*B++/26-1)?(")21["[N]-46)*N*4-22:-3194;while(*--K!=9){while(!(*++H+5&64));
|
||||
F=(40-"(\206/"[((H-S)%130+45)/57]<<3)+H;*F++= *H++;*F=
|
||||
*H==106?32:*H;Y();W F-131,"%-3d",++Bk); W F+129,"%3d",V+=
|
||||
*C?*C:"hijpqv"[*--C]-106);Pb();}for(H=S;*H||(_exit(0),0);H+=130)write(1,F+4,W
|
||||
F+3,"%c%-73.73s\n",0,H)-1);}
|
||||
#endif
|
||||
#undef U
|
||||
#define U !
|
||||
#include <stdio.h>
|
||||
@@ -0,0 +1,34 @@
|
||||
main(){}
|
||||
#define P define
|
||||
#P U ifdef
|
||||
#P main Si
|
||||
#U y
|
||||
#undef y
|
||||
#include "isaak.c"
|
||||
Pb
|
||||
#else
|
||||
char*K="4499999;8 9+jW*':'TZhD m:*h.4-j'9(z7Q>r*:G#FS]mATIdMZY^HaKFZZ\
|
||||
JyJw:X49@eJj1,Z'\\c^jGU@IXTF@9P2i:gAZx0pD*W3\\<ZZs1:.~Z8U:P<\\:ZOI0GBPZ7",*H
|
||||
,S[5202],*B="oA9BA6iN`]`Ph>5F4::M6A69@6I{g[Za__]NPV``aV\177E4C5CG;4C<BEJG;\
|
||||
?LGlSZ[Y_!oYi@uXPzLFyPOYP][]`RTaQo86564CAHCG4ES",*F,N;int Bk,V;Y
|
||||
#endif
|
||||
#P C K/16-2
|
||||
(){char*H;F O= -263;for(H="$+---+|||";*++H;)*(F O=(*H+5&129)+1)= *H;F
|
||||
#P W sprintf(
|
||||
O= -132;}I/**/r(){if((N= *I O/**/O%(21 O -5)+81 O 16)==107)N+=
|
||||
#undef I
|
||||
*K++&15;*F++ =N;return*K;}
|
||||
#undef O
|
||||
#P I K
|
||||
#P O +
|
||||
#U N
|
||||
exit(N){F=W H=S,"%5060d")+385;while(Br(),++B,Kr())F+=(N=
|
||||
*B++/26-1)?(")21["[N]-46)*N*4-22:-3194;while(*--K!=9){while(!(*++H+5&64));
|
||||
F=(40-"(\206/"[((H-S)%130+45)/57]<<3)+H;*F++= *H++;*F=
|
||||
*H==106?32:*H;Y();W W F-131,"%-3d",++Bk)+260,"%3d",V+=
|
||||
*C?*C:"hijpqv"[*--C]-106);Pb();}for(H=S;*H||(int)_exit(0);H+=130)write(1,1+W
|
||||
F+3,"%c%-73.73s\n",0,H),74);}
|
||||
#endif
|
||||
#undef U
|
||||
#P U ifndef
|
||||
#include <stdio.h>
|
||||
@@ -0,0 +1,68 @@
|
||||
begin 666 isaak.output
|
||||
M*RTM+2L@(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" K+2TM*PI\,2 @?" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @('PR("!\"GQ(("!\(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @?$AE('P*?" @
|
||||
M,7P@(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @("!\(" T? HK+2TM*RTM+2L@(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" K+2TM*RTM+2LM+2TK+2TM
|
||||
M*RTM+2LM+2TK"GPS("!\-" @?" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @('PU("!\-B @?#<@('PX("!\.2 @?#$P('P*?$QI('Q"
|
||||
M92!\(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @?$(@
|
||||
M('Q#("!\3B @?$\@('Q&("!\3F4@? I\(" W?" @.7P@(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @("!\(#$Q?" Q,GP@,31\(#$V?" Q
|
||||
M.7P@,C!\"BLM+2TK+2TM*R @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @("LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2L*?#$Q('PQ,B!\
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @?#$S('PQ
|
||||
M-"!\,34@?#$V('PQ-R!\,3@@? I\3F$@?$UG('P@(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @("!\06P@?%-I('Q0("!\4R @?$-L('Q!
|
||||
M<B!\"GP@,C-\(#(T?" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @('P@,C=\(#(X?" S,7P@,S)\(#,U?" T,'P**RTM+2LM+2TK+2TM
|
||||
M*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK
|
||||
M+2TM*RTM+2LM+2TK+2TM*PI\,3D@?#(P('PR,2!\,C(@?#(S('PR-"!\,C4@
|
||||
M?#(V('PR-R!\,C@@?#(Y('PS,"!\,S$@?#,R('PS,R!\,S0@?#,U('PS-B!\
|
||||
M"GQ+("!\0V$@?%-C('Q4:2!\5B @?$-R('Q-;B!\1F4@?$-O('Q.:2!\0W4@
|
||||
M?%IN('Q'82!\1V4@?$%S('Q392!\0G(@?$MR('P*?" S.7P@-#!\(#0U?" T
|
||||
M.'P@-3%\(#4R?" U-7P@-39\(#4Y?" U.7P@-C1\(#8U?" W,'P@-S-\(#<U
|
||||
M?" W.7P@.#!\(#@T? HK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM
|
||||
M+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK"GPS
|
||||
M-R!\,S@@?#,Y('PT,"!\-#$@?#0R('PT,R!\-#0@?#0U('PT-B!\-#<@?#0X
|
||||
M('PT.2!\-3 @?#4Q('PU,B!\-3,@?#4T('P*?%)B('Q3<B!\62 @?%IR('Q.
|
||||
M8B!\36\@?%1C('Q2=2!\4F@@?%!D('Q!9R!\0V0@?$EN('Q3;B!\4V(@?%1E
|
||||
M('Q)("!\6&4@? I\(#@U?" X.'P@.#E\(#DQ?" Y,WP@.39\(#DY?#$P,7PQ
|
||||
M,#-\,3 V?#$P.'PQ,3)\,3$U?#$Q.7PQ,C)\,3(X?#$R-WPQ,S%\"BLM+2TK
|
||||
M+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM
|
||||
M+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2L*?#4U('PU-B!\-3<@?#<R('PW,R!\
|
||||
M-S0@?#<U('PW-B!\-S<@?#<X('PW.2!\.# @?#@Q('PX,B!\.#,@?#@T('PX
|
||||
M-2!\.#8@? I\0W,@?$)A('Q,82!\2&8@?%1A('Q7("!\4F4@?$]S('Q)<B!\
|
||||
M4'0@?$%U('Q(9R!\5&P@?%!B('Q":2!\4&\@?$%T('Q2;B!\"GPQ,S-\,3,W
|
||||
M?#$S.7PQ-SA\,3@Q?#$X-'PQ.#9\,3DP?#$Y,GPQ.35\,3DW?#(P,7PR,#1\
|
||||
M,C W?#(P.7PR,#E\,C$P?#(R,GP**RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM
|
||||
M*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK
|
||||
M+2TM*PI\.#<@?#@X('PX.2!\,3 T?#$P-7P@(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @"GQ&<B!\4F$@?$%C
|
||||
M('Q29B!\2&$@?" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" *?#(R,WPR,C9\,C(W?#(V,7PR-C!\(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M( HK+2TM*RTM+2LM+2TK+2TM*RTM+2L@(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @"B @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @(" @
|
||||
M(" @(" @(" @(" @(" *(" @(" @(" K+2TM*RTM+2LM+2TK+2TM*RTM+2LM
|
||||
M+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2L@(" @(" @( H@
|
||||
M(" @(" @('PU."!\-3D@?#8P('PV,2!\-C(@?#8S('PV-"!\-C4@?#8V('PV
|
||||
M-R!\-C@@?#8Y('PW,"!\-S$@?" @(" @(" @"B @(" @(" @?$-E('Q0<B!\
|
||||
M3F0@?%!M('Q3;2!\174@?$=D('Q48B!\1'D@?$AO('Q%<B!\5&T@?%EB('Q,
|
||||
M=2!\(" @(" @(" *(" @(" @("!\,30P?#$T,7PQ-#1\,30U?#$U,'PQ-3)\
|
||||
M,34W?#$U.7PQ-C)\,38U?#$V-WPQ-CE\,3<S?#$W-7P@(" @(" @( H@(" @
|
||||
M(" @("LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK
|
||||
M+2TM*RTM+2LM+2TK+2TM*R @(" @(" @"B @(" @(" @?#DP('PY,2!\.3(@
|
||||
M?#DS('PY-"!\.34@?#DV('PY-R!\.3@@?#DY('PQ,#!\,3 Q?#$P,GPQ,#-\
|
||||
M(" @(" @(" *(" @(" @("!\5&@@?%!A('Q5("!\3G @?%!U('Q!;2!\0VT@
|
||||
M?$)K('Q#9B!\17,@?$9M('Q-9"!\3F\@?$QR('P@(" @(" @( H@(" @(" @
|
||||
M('PR,S)\,C,Q?#(S.'PR,S=\,C0T?#(T,WPR-#=\,C0W?#(U,7PR-31\,C4W
|
||||
M?#(U-GPR-31\,C4W?" @(" @(" @"B @(" @(" @*RTM+2LM+2TK+2TM*RTM
|
||||
M+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK+2TM*RTM+2LM+2TK(" @
|
||||
&(" @(" *
|
||||
|
||||
end
|
||||
@@ -0,0 +1,49 @@
|
||||
Best visuals:
|
||||
|
||||
Mark Isaak
|
||||
Imagen Corporation
|
||||
2650 San Tomas Expy.
|
||||
Santa Clara, CA
|
||||
95052-8101
|
||||
USA
|
||||
|
||||
Compile with:
|
||||
|
||||
cc -DI=B -DO=- -Dy isaak.c -o isaak
|
||||
|
||||
Execute without arguments.
|
||||
|
||||
The original entry starts with the line:
|
||||
|
||||
main(){};
|
||||
|
||||
This works on some 4.3BSD systems. Why? Note that #include <stdio.h>
|
||||
is given on the last line. Why is this needed? Note the unusual calls
|
||||
to sprintf.
|
||||
|
||||
NOTE: The program relies heavily on ASCII. Don't even think of
|
||||
running it on an EBCDIC machine. If you name the file anything
|
||||
other than "isaak.c", you must change the #include on line 7.
|
||||
|
||||
NOTE: The use of null comments to separate macros to construct different
|
||||
tokens from a single macro (e.g., "O/**/O" creates either "++" or "--"
|
||||
by defining "O" to be "+" or "-") may cause some strict ANSI
|
||||
C preprocessors to object.
|
||||
|
||||
NOTE: Most System V machines will not be able to execute this program
|
||||
correctly due to the fact that BSD style systems have an sprintf()
|
||||
that returns a char *.
|
||||
|
||||
Due to the above problems, we have replaced the output of this program
|
||||
in the file: isaak.encode. To read this file do:
|
||||
|
||||
uudecode < isaak.encode
|
||||
cat isaak.output
|
||||
|
||||
FYI: We are likely to be more strict about portability in the future.
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
@@ -0,0 +1,10 @@
|
||||
main(argc, argv)
|
||||
int argc;
|
||||
char **argv;
|
||||
{
|
||||
while (*argv != argv[1] && (*argv = argv[1]) && (argc = 0) || (*++argv
|
||||
&& (**argv && ((++argc)[*argv] && (**argv <= argc[*argv] ||
|
||||
(**argv += argc[*argv] -= **argv = argc[*argv] - **argv)) &&
|
||||
--argv || putchar(**argv) && ++*argv--) || putchar(10))))
|
||||
;
|
||||
}
|
||||
@@ -0,0 +1,36 @@
|
||||
Best small program:
|
||||
|
||||
Maarten Litmaath
|
||||
Free University (VU) Amsterdam
|
||||
Department of computer science
|
||||
Uilenstede 72
|
||||
1183 AK Amstelveen
|
||||
The Netherlands
|
||||
|
||||
Try: litmaath eschew obfuscation
|
||||
|
||||
Note the unusual structure:
|
||||
|
||||
while (<condition>)
|
||||
;
|
||||
|
||||
Did you notice that the body is empty?
|
||||
|
||||
The best one can do to understand how the program works is to give it
|
||||
two small strings as arguments, and follow the program closely. One
|
||||
could make the body of the 'while' loop an 'fprintf' with interesting
|
||||
variables like:
|
||||
|
||||
fprintf(stderr,
|
||||
"argv=%lo *argv=%lo **argv=%c argv[1]=%lo *argv[1]=%c argc=%d\n",
|
||||
(long) argv, (long) *argv, *argv && **argv ? **argv : '@',
|
||||
(long) argv[1], argv[1] && *argv[1] ? *argv[1] : '@', argc);
|
||||
|
||||
Furthermore, it's interesting to note that only two variables are
|
||||
used to achieve everything.
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
@@ -0,0 +1,53 @@
|
||||
main(t,_,a )
|
||||
char
|
||||
*
|
||||
a;
|
||||
{
|
||||
return!
|
||||
|
||||
0<t?
|
||||
t<3?
|
||||
|
||||
main(-79,-13,a+
|
||||
main(-87,1-_,
|
||||
main(-86, 0, a+1 )
|
||||
|
||||
|
||||
+a)):
|
||||
|
||||
1,
|
||||
t<_?
|
||||
main( t+1, _, a )
|
||||
:3,
|
||||
|
||||
main ( -94, -27+t, a )
|
||||
&&t == 2 ?_
|
||||
<13 ?
|
||||
|
||||
main ( 2, _+1, "%s %d %d\n" )
|
||||
|
||||
:9:16:
|
||||
t<0?
|
||||
t<-72?
|
||||
main( _, t,
|
||||
"@n'+,#'/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l,+,/n{n+,/+#n+,/#;#q#n+,/+k#;*+,/'r :'d*'3,}{w+K w'K:'+}e#';dq#'l q#'+d'K#!/+k#;q#'r}eKK#}w'r}eKK{nl]'/#;#q#n'){)#}w'){){nl]'/+#n';d}rw' i;# ){nl]!/n{n#'; r{#w'r nc{nl]'/#{l,+'K {rw' iK{;[{nl]'/w#q#n'wk nw' iwk{KK{nl]!/w{%'l##w#' i; :{nl]'/*{q#'ld;r'}{nlwb!/*de}'c ;;{nl'-{}rw]'/+,}##'*}#nc,',#nw]'/+kd'+e}+;#'rdq#w! nr'/ ') }+}{rl#'{n' ')# }'+}##(!!/")
|
||||
:
|
||||
t<-50?
|
||||
_==*a ?
|
||||
putchar(31[a]):
|
||||
|
||||
main(-65,_,a+1)
|
||||
:
|
||||
main((*a == '/') + t, _, a + 1 )
|
||||
:
|
||||
|
||||
0<t?
|
||||
|
||||
main ( 2, 2 , "%s")
|
||||
:*a=='/'||
|
||||
|
||||
main(0,
|
||||
|
||||
main(-61,*a, "!ek;dc i@bK'(q)-[w]*%n+r3#l,{}:\nuwloca-O;m .vpbks,fxntdCeghiry")
|
||||
|
||||
,a+1);}
|
||||
@@ -0,0 +1,22 @@
|
||||
Least likely to compile successfully:
|
||||
|
||||
Ian Phillipps
|
||||
Cambridge Consultants Ltd
|
||||
Science Park
|
||||
Milton Road
|
||||
Cambridge CB4 4DW
|
||||
England
|
||||
|
||||
Compile and run without parameters.
|
||||
|
||||
The program is smaller than even the 'compressed' form of its output,
|
||||
and thus represents a new departure in text compression standards.
|
||||
|
||||
The judges thought that this program looked like what you would get
|
||||
by pounding on the keys of an old typewriter at random.
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
@@ -0,0 +1,6 @@
|
||||
#include<stdio.h>
|
||||
#include<ctype.h>
|
||||
#define w printf
|
||||
#define p while
|
||||
#define t(s) (W=T(s))
|
||||
char*X,*B,*L,I[99];M,W,V;D(){W==9?(w("`%.*s' is ",V,X),t(0)):W==40?(t(0),D(),t(41)):W==42?(t(0),D(),w("ptr to ")):0;p(W==40?(t(0),w("func returning "),t(41)):W==91?(t(0)==32?(w("array[0..%d] of ",atoi(X)-1),t(0)):w("array of "),t(93)):0);}main(){p(w("input: "),B=gets(I))if(t(0)==9)L=X,M=V,t(0),D(),w("%.*s.\n\n",M,L);}T(s){if(!s||s==W){p(*B==9||*B==32)B++;X=B;V=0;if(W=isalpha(*B)?9:isdigit(*B)?32:*B++)if(W<33)p(isalnum(*B))B++,V++;}return W;}
|
||||
@@ -0,0 +1,22 @@
|
||||
Most useful Obfuscated C program:
|
||||
|
||||
Amperif Corporation
|
||||
9232 Eton Avenue
|
||||
Chatsworth, CA
|
||||
91311
|
||||
U.S.A.
|
||||
|
||||
|
||||
Compile and give the following line as input:
|
||||
|
||||
char *(*(fun[16])();
|
||||
|
||||
This is a somewhat restricted version of a useful program that has been
|
||||
posted to Usenet. What is unusual is what it is able to do so much
|
||||
in such little space.
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
@@ -0,0 +1,40 @@
|
||||
#include <stdio.h>
|
||||
unsigned char w,h,i,l,e,x,y=10,z=10,E[256];
|
||||
#define whi1e(j,k) printf(j,k); fflush(stdout)
|
||||
#define o E[w]
|
||||
|
||||
main (c,v) char *v[]; {
|
||||
while (c>=2 ){z = atoi(v[1]),--c;
|
||||
while (c>=2 )y = atoi(v[2]),--c;}
|
||||
whi1e ("%s" ,"2.");
|
||||
while (--y) --x;
|
||||
while (--x) --e,--y;
|
||||
while (--z) --x;
|
||||
while (--x) --e,--z;
|
||||
while (--w) {
|
||||
while (--x) --o;}
|
||||
while (--z) {
|
||||
while (--x) --w;
|
||||
while (--o) ;
|
||||
while (--w) ;
|
||||
while (--e) --x;
|
||||
while (--x) --w,--e;
|
||||
while (--w) {
|
||||
while (--l) ;
|
||||
while (--i) --l;--l;
|
||||
while (--h) ;
|
||||
while (--y) --x;
|
||||
while (--x) --h,--y;
|
||||
while (--x) --h;
|
||||
while (--h) {
|
||||
while (--o) --x;
|
||||
while (--x) --l,--o;
|
||||
while (l>=w ){--i;
|
||||
while (--w) --l,--x;
|
||||
while (--x) --w;--l;}}
|
||||
while (--o) ;
|
||||
while (--l) --x;
|
||||
while (--x) --o;}
|
||||
while (--i) --h;
|
||||
whi1e ("%x" ,--h);--e;}
|
||||
whi1e ("%s" ,"\n");}
|
||||
@@ -0,0 +1,41 @@
|
||||
Best abuse of C constructs:
|
||||
|
||||
Arch D. Robison
|
||||
University of Illinois at Urbana-Champaign
|
||||
1304 W. Springfield Ave.
|
||||
Urbana IL
|
||||
61801
|
||||
USA
|
||||
|
||||
Try: robison 80 10
|
||||
robison 40 16
|
||||
|
||||
The first and second parameters are optional. You might also try:
|
||||
|
||||
robison 80 2 <--- can you find the bug?
|
||||
robison 80 -246
|
||||
|
||||
The author says:
|
||||
|
||||
This program shows that C has many unnecessary constructs, in fact
|
||||
only "while","--", and ">=" are required. (The two assignments at
|
||||
the beginning could be avoided if "atoi" was rewritten with this
|
||||
new paradigm.) Note that the lack of both the controversial "goto"
|
||||
and assignment statements makes the meaning crystal clear. The current
|
||||
ANSI committee should look into this practical simplification of C.
|
||||
|
||||
The following might make an interesting benchmark:
|
||||
|
||||
robison 100
|
||||
|
||||
[Amdahl 5890-300E with System V cc: 8.40 seconds]
|
||||
|
||||
We suggest that you C preprocess and perhaps C-beautify this program.
|
||||
All is not what it may appear to be in this program. When does a whi1e
|
||||
not take a while to execute?
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
+213
@@ -0,0 +1,213 @@
|
||||
Subject: 5th International Obfuscated C Code Contest Rules
|
||||
Newsgroups: comp.lang.c,comp.unix.wizards
|
||||
Keywords: rules,1988,obfuscate,contest
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
|
||||
Obfuscate: tr.v. -cated, -cating, -cates. 1. a. To render obscure.
|
||||
b. To darken. 2. To confuse: Their emotions obfuscated their
|
||||
judgement. [LLat. obfuscare, to darken : ob(intensive) +
|
||||
Lat. fuscare, to darken < fuscus, dark.] -obfuscation n.
|
||||
obfuscatory adj.
|
||||
|
||||
GOALS OF THE CONTEST:
|
||||
|
||||
* To write the most Obscure/Obfuscated C program under the rules below.
|
||||
* To show what should NOT be done in C programs.
|
||||
* To provide a safe forum for poor C code. :-)
|
||||
|
||||
RULES:
|
||||
|
||||
To help us handle the vast volume of entries, we ask that you
|
||||
follow the rules below. Sorry for the length, but we need all
|
||||
the help we can get!
|
||||
|
||||
1) Your source MUST be 1536 bytes or less, and it must be a complete
|
||||
program, not just a subroutine. NOTE the new maximum size.
|
||||
|
||||
2) To help us process your entries, we ask that you submit entries
|
||||
in the following format. Please be sure to include the --- lines,
|
||||
otherwise our extraction program may skip your entry!
|
||||
|
||||
---header items---
|
||||
name: Your name, of course!
|
||||
org: School/Company/Organization
|
||||
email address: Email address from a well known site
|
||||
postal address: Postal address, include your country as well
|
||||
environment: Indicate the Hardware & OS under which your program was tested
|
||||
entry: A of B <entry number such as 3 of 5, 1 of 1...>
|
||||
remarks: <see below>
|
||||
---how to compile---
|
||||
X Give the command(s) needed to compile your program.
|
||||
X Follow the same rules as given for the program below except that the
|
||||
X command size must be 160 characters or less.
|
||||
---program---
|
||||
X Place obfuscated source of 1536 characters or less in this section.
|
||||
X Add a leading X to each line to avoid problems with mailers.
|
||||
X Some mailers don't like files with very long lines. If your entry contains C
|
||||
C lines longer 80 chars we ask you to form continuation line sets. To form C
|
||||
C a continuation line set, place a 'C' character at the point of a split C
|
||||
C and place a C (instead of an X) at the beginning of the next line. C
|
||||
C Finally, end the continuation line set as normal.
|
||||
X The C\nC's and leading X's will be removed prior to extraction and thus C
|
||||
C they don't contribute toward the source character count. All other C
|
||||
C characters are considered to be source.
|
||||
X Newlines count as 1 character. Assume a standard 8 character tab stop.
|
||||
---end---
|
||||
|
||||
3) Regarding the header items:
|
||||
|
||||
* Any text outside of the above format will be kept confidential.
|
||||
|
||||
* All header lines are required, but you may use 'annonymous'
|
||||
for any header line other than 'remarks' or 'entry'.
|
||||
|
||||
* In the 'remarks' please include:
|
||||
- what this program does
|
||||
- why you think the program is obfuscated
|
||||
- any other remarks you wish to make
|
||||
|
||||
4) Your entry should be written in common C. (K&R + common extensions)
|
||||
Due to the lack of ANSI C compilers, it is suggested, but not
|
||||
required, that you avoid use of constructs unque to ANSI C.
|
||||
|
||||
5) The program must be of original work. All programs must be
|
||||
in the public domain. All copyrighted programs will be rejected.
|
||||
|
||||
6) Entries must be received between 15-Mar-88 0:00 GMT and
|
||||
25-May-88 0:00 GMT. Email your entries to:
|
||||
|
||||
...!amdahl!obfuscate
|
||||
|
||||
Amdahl talks to hplabs, decwrl, pyramid, sun, uunet, cbosgd, ...
|
||||
We will attempt to Email a confirmation of receipt of contest
|
||||
entries, however since Email is not reliable you may not receive it.
|
||||
People are strongly encouraged to submit entries via Email, however
|
||||
one may mail entries the following postal address:
|
||||
|
||||
Landon Curt Noll
|
||||
Amdahl Corp.
|
||||
1250 E. Arques Ave. M/S 316
|
||||
P.O. Box 3470
|
||||
Sunnyvale, CA
|
||||
94088-3470
|
||||
U.S.A.
|
||||
|
||||
Write the words: "International Obfuscated C Code Contest" near the
|
||||
bottom left corner of the envelope.
|
||||
|
||||
7) Each person may submit up to 8 entries. Multiple entries must
|
||||
be sent in separate Email letters or postal envelopes.
|
||||
|
||||
|
||||
ANNOUNCEMENT OF WINNERS:
|
||||
|
||||
* First announcement will be at the Summer 88 Usenix BOF.
|
||||
|
||||
* Winning entries will be posted to comp.sources.unix
|
||||
as well as news groups where these rules were posted
|
||||
in mid June 1988. (depending on the judges work load ;-})
|
||||
|
||||
* An article containing the winning entries will be published
|
||||
in a future issue of the "Micro/Systems Journal".
|
||||
|
||||
* Winners receive international fame and flames! :-)
|
||||
|
||||
|
||||
JUDGING:
|
||||
|
||||
Awards will be given to the best entry in a number of categories.
|
||||
The actual category list will vary depending on the types of entries
|
||||
we receive. As a guide, consider using the following:
|
||||
|
||||
* The best small one line program
|
||||
* The most obscure algorithm
|
||||
* The strangest source layout
|
||||
* The most useful obfuscated program
|
||||
* The most creatively obfuscated program
|
||||
* Best obfuscated entry smaller than 256 bytes
|
||||
* Best obfuscated entry smaller than 1024 bytes
|
||||
* <anything else so strange that it deserves an award>
|
||||
|
||||
POINTS TO PONDER:
|
||||
|
||||
People are encouraged to examine winners of the previous contests. A
|
||||
copy of these entries was posted to comp.sources.unix on or about
|
||||
15-Mar-88. Contact the comp.sources.unix moderator, or some archive
|
||||
site if you missed that posting. 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. In short, use your best judgement.
|
||||
|
||||
We examine each entry on several levels of confusion. For example
|
||||
each entry is judged when we:
|
||||
|
||||
* look at the original source
|
||||
* run it through; sed -e ',^#[ ]*define,d' | /lib/cpp
|
||||
* run it through a C beautifier
|
||||
* examine the algorithm
|
||||
* compile and lint it
|
||||
* execute it
|
||||
|
||||
One line programs are best when they are short, obscure and concise.
|
||||
|
||||
We tend to dislike programs that:
|
||||
|
||||
* are very hardware specific
|
||||
* are very OS or Un*x 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 under both BSD or SYS V Un*x
|
||||
* use an excessively long compile line to get around the
|
||||
size limit
|
||||
* are longer than they need to be
|
||||
* are similar to previous winners
|
||||
* are similar to previous losers :-)
|
||||
|
||||
Simply abusing #defines or -Dfoo=bar won't go as far as a program
|
||||
that is more well rounded in confusion.
|
||||
|
||||
Unless you are crampt 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.
|
||||
|
||||
We like programs that:
|
||||
|
||||
* are as concise and small as they need to be
|
||||
* do something quasi-interesting
|
||||
* pass lint without complaint
|
||||
* are portable
|
||||
* are unique or novel in their obfuscation style
|
||||
* use a number of different types of obfuscation
|
||||
* make us laugh and/or throw up :-)
|
||||
|
||||
Some types of programs can't excel in some areas. We try to account
|
||||
for this by giving awards to programs in a number of areas. Of course,
|
||||
your program doesn't have to excel in all areas, but doing well in a
|
||||
few helps.
|
||||
|
||||
Be creative!
|
||||
|
||||
The Judging will be done by Landon Noll and Larry Bassel. If you have
|
||||
any QUESTIONS or COMMENTS, please feel free to send them to:
|
||||
|
||||
...!amdahl!judges
|
||||
|
||||
however contest entries should be sent to:
|
||||
|
||||
...!amdahl!obfuscate
|
||||
|
||||
|
||||
chongo <Landon Curt Noll> /\cc/\ {decwrl,sun,uunet}!amdahl!chongo
|
||||
Larry Bassel {amdahl,ucbvax,cbosgd}|sun!lab
|
||||
|
||||
p.s. The 1988 contest has been dedicated to Bill the Cat. |\_.^
|
||||
(@ o)
|
||||
*Ackpt!* {:}
|
||||
U
|
||||
@@ -0,0 +1 @@
|
||||
#include "/dev/tty"
|
||||
@@ -0,0 +1,4 @@
|
||||
main()
|
||||
{
|
||||
printf("Hello world\n");
|
||||
}
|
||||
@@ -0,0 +1,36 @@
|
||||
Best abuse of the rules:
|
||||
|
||||
Diomidis Spinellis (currently at Imperial College, London, England)
|
||||
1 Myrsinis Str.
|
||||
GR-145 62 Kifissia
|
||||
GREECE
|
||||
|
||||
How to compile:
|
||||
|
||||
/lib/cpp spinellis.c > spin.c
|
||||
|
||||
and type the following text followed by an EOF ('^D'):
|
||||
|
||||
main()
|
||||
{
|
||||
printf("Hello world\n");
|
||||
}
|
||||
|
||||
The author says:
|
||||
|
||||
This program can be configured to do almost everything.
|
||||
The configuration is done during compile time by typing
|
||||
in, C code, that one would like the program to perform.
|
||||
A trivial example is given in the `how to compile' section
|
||||
but the possibilities are clearly limited only by your
|
||||
imagination and programming skills.
|
||||
|
||||
FYI: We enjoyed this entry this year, however in the future programs
|
||||
must be able to be compiled from within a makefile without the
|
||||
need of human intervention.
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
@@ -0,0 +1,20 @@
|
||||
#define _ -F<00||--F-OO--;
|
||||
int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
|
||||
{
|
||||
_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_
|
||||
_-_-_-_
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
#define _ F-->00||-F-OO--;
|
||||
int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
|
||||
{
|
||||
_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_-_-_-_-_
|
||||
_-_-_-_-_-_-_-_
|
||||
_-_-_-_
|
||||
}
|
||||
@@ -0,0 +1,32 @@
|
||||
Best layout:
|
||||
|
||||
Merlyn LeRoy (Brian Westley)
|
||||
Rosemount, Inc.
|
||||
1121 Hamline Ave. N. #17
|
||||
St. Paul, MN
|
||||
55108
|
||||
U.S.A.
|
||||
|
||||
Compile and execute without arguments.
|
||||
|
||||
Note: Your compiler must parse
|
||||
|
||||
#define _ -a
|
||||
-_
|
||||
|
||||
as "--a" and not "-(-a)" or some other tokenized form. Some strictly
|
||||
conforming ANSI C Preprocessors may object to this: for such
|
||||
compilers, you can elide the nonstandard token-pasting requirement
|
||||
by changing the #define line to:
|
||||
|
||||
#define _ F-->00||F-OO--;
|
||||
|
||||
You might enjoy looking at the output of:
|
||||
|
||||
cc -E westley.c
|
||||
|
||||
Copyright (c) 1988, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational 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 both Landon Curt Noll and Larry Bassel.
|
||||
+160
@@ -0,0 +1,160 @@
|
||||
#ifdef a
|
||||
#undef a
|
||||
#ifdef b
|
||||
#undef b
|
||||
#ifdef c
|
||||
#undef c
|
||||
#ifdef e
|
||||
#undef e
|
||||
#ifdef f
|
||||
#undef f
|
||||
#ifdef g
|
||||
#undef g
|
||||
#ifdef h
|
||||
#undef h
|
||||
#ifdef i
|
||||
#undef i
|
||||
#ifdef j
|
||||
#undef j
|
||||
#ifdef k
|
||||
#undef k
|
||||
#else
|
||||
#define k
|
||||
#endif
|
||||
#else
|
||||
#define j
|
||||
#endif
|
||||
#else
|
||||
#define i
|
||||
#endif
|
||||
#else
|
||||
#define h
|
||||
#endif
|
||||
#else
|
||||
#define g
|
||||
#endif
|
||||
#else
|
||||
#define f
|
||||
#endif
|
||||
#else
|
||||
#define e
|
||||
#endif
|
||||
#else
|
||||
#define c
|
||||
#endif
|
||||
#else
|
||||
#define b
|
||||
#endif
|
||||
#else
|
||||
#define a
|
||||
#endif
|
||||
#ifdef k
|
||||
#define p (1<<7)
|
||||
#else
|
||||
#define p 0
|
||||
#endif
|
||||
#ifdef j
|
||||
#define q (1<<6)
|
||||
#else
|
||||
#define q 0
|
||||
#endif
|
||||
#ifdef i
|
||||
#define r (1<<5)
|
||||
#else
|
||||
#define r 0
|
||||
#endif
|
||||
#ifdef h
|
||||
#define s (1<<4)
|
||||
#else
|
||||
#define s 0
|
||||
#endif
|
||||
#ifdef g
|
||||
#define t (1<<3)
|
||||
#else
|
||||
#define t 0
|
||||
#endif
|
||||
#ifdef f
|
||||
#define u (1<<2)
|
||||
#else
|
||||
#define u 0
|
||||
#endif
|
||||
#ifdef e
|
||||
#define v (1<<1)
|
||||
#else
|
||||
#define v 0
|
||||
#endif
|
||||
#define vv (p+q+r+s+t+u+v+1)
|
||||
#define ff \
|
||||
(defined(c)*8+defined(b)*4+defined(a)*2+1)
|
||||
#if vv==1
|
||||
#undef vv
|
||||
#define vv 2
|
||||
#endif
|
||||
#if ff<vv
|
||||
#if ff!=1
|
||||
#if (vv/ff)*ff==vv
|
||||
#ifndef dd
|
||||
#define dd
|
||||
#endif
|
||||
#endif
|
||||
#endif
|
||||
#endif
|
||||
#if ff==15
|
||||
#ifdef dd
|
||||
#undef dd
|
||||
#else
|
||||
printf("%d\n", vv);
|
||||
#endif
|
||||
#endif
|
||||
#undef ff
|
||||
#undef vv
|
||||
#undef p
|
||||
#undef q
|
||||
#undef r
|
||||
#undef s
|
||||
#undef t
|
||||
#undef u
|
||||
#undef v
|
||||
#ifdef w
|
||||
#ifdef x
|
||||
#ifdef y
|
||||
#ifndef z
|
||||
#define z
|
||||
#endif
|
||||
#else
|
||||
#define y
|
||||
#endif
|
||||
#else
|
||||
#define x
|
||||
#endif
|
||||
#else
|
||||
#define w
|
||||
#include <stdio.h>
|
||||
main(){
|
||||
#endif
|
||||
#ifndef z
|
||||
#include "zsmall.c"
|
||||
#include "zsmall.c"
|
||||
#include "zsmall.c"
|
||||
#include "zsmall.c"
|
||||
#include "zsmall.c"
|
||||
#include "zsmall.c"
|
||||
#include "zsmall.c"
|
||||
#include "zsmall.c"
|
||||
#endif
|
||||
#ifdef z
|
||||
#undef z
|
||||
#else
|
||||
#ifdef y
|
||||
#undef y
|
||||
#else
|
||||
#ifdef x
|
||||
#undef x
|
||||
#else
|
||||
#ifdef w
|
||||
#undef w
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
#endif
|
||||
#endif
|
||||
Reference in new issue
Block a user