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 2020-12-30 16:57:03 -08:00
1 parent 28efc67f5d
commit c0663537cb
1683 files changed
+220064

No files matched your search

BIN
View File
Binary file not shown.
+72
View File
@@ -0,0 +1,72 @@
#!/usr/bin/env make
#
# 1986 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
LD= ld
MAKE= make
RM= rm
SED= sed
TAR= tar
TRUE= true
# ANSI compiler
#
# Set CC to the name of your ANSI compiler.
#
CC= cc
###############
# IOCCC winners
###############
#
WINNERS= marshall hague applin bright stein holloway august pawka wall
###################
# build all entries
###################
#
all:
@for i in ${WINNERS} ; do \
echo "(cd $$i && $(MAKE) $@)"; \
(cd $$i && $(MAKE) $@); \
done
###############
# utility rules
###############
#
clean:
@for i in ${WINNERS} ; do \
echo "(cd $$i && $(MAKE) $@)"; \
(cd $$i && $(MAKE) $@); \
done
clobber:
@for i in ${WINNERS} ; do \
echo "(cd $$i && $(MAKE) $@)"; \
(cd $$i && $(MAKE) $@); \
done
install:
@for i in ${WINNERS} ; do \
echo "(cd $$i && $(MAKE) $@)"; \
(cd $$i && $(MAKE) $@); \
done
+20
View File
@@ -0,0 +1,20 @@
The 1986 contest was named: "The Third International Obfuscated C Code Contest"
Copyright (c) 1986, 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 rules for 1986 suggested categories due to the success of the 1985
judging method. The maximum size was increased from 512 to 1024 bytes.
Larry Bassel joined as the second official judge.
A poll was taken for the worst code for BSD and System V program.
The Bourne Shell (/bin/sh) won for both systems. The BSD finger
program took third place.
Rules and results were posted to net.lang.c and net.unix-wizards.
Micro/Systems Journal published started regular publishing of the winners.
The practice of making first announcement of the winners at the Summer
Usenix BOF started this year. A notice was posted to net.announce.
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= applin
all: ${WINNERS}
applin: applin.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+15
View File
@@ -0,0 +1,15 @@
cat =13 /*/ >/dev/null 2>&1; echo "Hello, world!"; exit
*
* This program works under cc, f77, and /bin/sh.
*
*/; main() {
write(
cat-~-cat
/*,'(
*/
,"Hello, world!"
,
cat); putchar(~-~-~-cat); } /*
,)')
end
*/
+21
View File
@@ -0,0 +1,21 @@
<h1>Most adaptable program</h1>
<p>Jack Applin<br>
Hewlett-Packard<br>
Ft. Collins<br>
Colorado<br>
USA</p>
<h2>Judges' comments:</h2>
<p>Compile and/or execute as directed by the documentation.</p>
<p>The judges were so amused by this little program that we created an
award just for it. This program is portable to the C and Fortran 77
compilers as well as executable by the bourne shell!</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+21
View File
@@ -0,0 +1,21 @@
# Most adaptable program
Jack Applin
Hewlett-Packard
Ft. Collins
Colorado
USA
## Judges' comments:
Compile and/or execute as directed by the documentation.
The judges were so amused by this little program that we created an
award just for it. This program is portable to the C and Fortran 77
compilers as well as executable by the bourne shell!
Copyright (c) 1986, 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.
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= august
all: ${WINNERS}
august: august.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+26
View File
@@ -0,0 +1,26 @@
typedef struct n{int a:3,
b:29;struct n*c;}t;t*
f();r(){}m(u)t*u;{t*w,*z;
z=u->c,q(z),u->b=z->b*10,
w=u->c=f(),w->a=1,w->c=z->
c;}t*k;g(u)t*u;{t*z,*v,*p,
*x;z=u->c,q(z),u->b=z->b,v
=z->c,z->a=2,x=z->c=f(),x
->a=3,x->b=2,p=x->c=f(),p
->c=f(),p->c->a=1,p->c->c=
v;}int i;h(u)t*u;{t*z,*v,*
w;int c,e;z=u->c,v=z->c,q(
v),c=u->b,e=v->b,u->b=z->b
,z->a=3,z->b=c+1,e+9>=c&&(
q(z),e=z->b,u->b+=e/c,w=f(
),w->b=e%c,w->c=z->c,u->c=
w);}int(*y[4])()={r,m,g,h};
char *sbrk();main(){t*e,*p,*o;
o=f(),o->c=o,o->b=1,e=f(),
e->a=2,p=e->c=f(),p->b=2,
p->c=o,q(e),e=e->c,(void)write
(1,"2.",2);for(;;e=e->c){q(e),
e->b=write(1,&e->b["0123456789"],
1);}}t*f(){return i||(i=1000,
k=(t*)sbrk(i*sizeof(t))),k+--i;
}q(p)t*p;{(*y[p->a])(p);}
+23
View File
@@ -0,0 +1,23 @@
<h1>Best complex task done in a complex way</h1>
<p>Lennart Augustsson<br>
Dept. of Comp. Sci.<br>
Chalmers University of Technology,<br>
412 96 Gothenburg<br>
Sweden</p>
<h2>Judges' comments:</h2>
<p>This program computes a specific mathematical value. Simply compile
and give it an infinite amount of stack space and cpu time. Otherwise
just be satisfied with the approximation displayed just before the core
dump.</p>
<p>This program will pass lint on your system assuming your lint is brave
enough to try and parse it correctly.</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+23
View File
@@ -0,0 +1,23 @@
# Best complex task done in a complex way
Lennart Augustsson
Dept. of Comp. Sci.
Chalmers University of Technology,
412 96 Gothenburg
Sweden
## Judges' comments:
This program computes a specific mathematical value. Simply compile
and give it an infinite amount of stack space and cpu time. Otherwise
just be satisfied with the approximation displayed just before the core
dump.
This program will pass lint on your system assuming your lint is brave
enough to try and parse it correctly.
Copyright (c) 1986, 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.
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= bright
all: ${WINNERS}
bright: bright.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+47
View File
@@ -0,0 +1,47 @@
#include <stdio.h>
#define O1O printf
#define OlO putchar
#define O10 exit
#define Ol0 strlen
#define QLQ fopen
#define OlQ fgetc
#define O1Q abs
#define QO0 for
typedef char lOL;
lOL*QI[] = {"Use:\012\011dump file\012","Unable to open file '\x25s'\012",
"\012"," ",""};
main(I,Il)
lOL*Il[];
{ FILE *L;
unsigned lO;
int Q,OL[' '^'0'],llO = EOF,
O=1,l=0,lll=O+O+O+l,OQ=056;
lOL*llL="%2x ";
(I != 1<<1&&(O1O(QI[0]),O10(1011-1010))),
((L = QLQ(Il[O],"r"))==0&&(O1O(QI[O],Il[O]),O10(O)));
lO = I-(O<<l<<O);
while (L-l,1)
{ QO0(Q = 0L;((Q &~(0x10-O))== l);
OL[Q++] = OlQ(L));
if (OL[0]==llO) break;
O1O("\0454x: ",lO);
if (I == (1<<1))
{ QO0(Q=Ol0(QI[O<<O<<1]);Q<Ol0(QI[0]);
Q++)O1O((OL[Q]!=llO)?llL:QI[lll],OL[Q]);/*"
O10(QI[1O])*/
O1O(QI[lll]);{}
}
QO0 (Q=0L;Q<1<<1<<1<<1<<1;Q+=Q<0100)
{ (OL[Q]!=llO)? /* 0010 10lOQ 000LQL */
((D(OL[Q])==0&&(*(OL+O1Q(Q-l))=OQ)),
OlO(OL[Q])):
OlO(1<<(1<<1<<1)<<1);
}
O1O(QI[01^10^9]);
lO+=Q+0+l;}
}
D(l) { return l>=' '&&l<='\~';
}
+22
View File
@@ -0,0 +1,22 @@
<h1>Most useful obfuscation</h1>
<p>Walter Bright</p>
<h2>Judges' comments:</h2>
<p>Compile this program and give filenames as arguments. For example try:</p>
<pre><code>bright bright.c
bright bright
</code></pre>
<p>Mr. Bright exploits the c pre-processor, similar variables and
excessive shifting to obfuscate an otherwise useful binary display
program. This gives you a small example of what it is like to
maintain the Bourne shell! :-}</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+21
View File
@@ -0,0 +1,21 @@
# Most useful obfuscation
Walter Bright
## Judges' comments:
Compile this program and give filenames as arguments. For example try:
bright bright.c
bright bright
Mr. Bright exploits the c pre-processor, similar variables and
excessive shifting to obfuscate an otherwise useful binary display
program. This gives you a small example of what it is like to
maintain the Bourne shell! :-}
Copyright (c) 1986, 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.
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= hague
all: ${WINNERS}
hague: hague.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+28
View File
@@ -0,0 +1,28 @@
#define DIT (
#define DAH )
#define __DAH ++
#define DITDAH *
#define DAHDIT for
#define DIT_DAH malloc
#define DAH_DIT gets
#define _DAHDIT char
_DAHDIT _DAH_[]="ETIANMSURWDKGOHVFaLaPJBXCYZQb54a3d2f16g7c8a90l?e'b.s;i,d:"
;main DIT DAH{_DAHDIT
DITDAH _DIT,DITDAH DAH_,DITDAH DIT_,
DITDAH _DIT_,DITDAH DIT_DAH DIT
DAH,DITDAH DAH_DIT DIT DAH;DAHDIT
DIT _DIT=DIT_DAH DIT 81 DAH,DIT_=_DIT
__DAH;_DIT==DAH_DIT DIT _DIT DAH;__DIT
DIT'\n'DAH DAH DAHDIT DIT DAH_=_DIT;DITDAH
DAH_;__DIT DIT DITDAH
_DIT_?_DAH DIT DITDAH DIT_ DAH:'?'DAH,__DIT
DIT' 'DAH,DAH_ __DAH DAH DAHDIT DIT
DITDAH DIT_=2,_DIT_=_DAH_; DITDAH _DIT_&&DIT
DITDAH _DIT_!=DIT DITDAH DAH_>='a'? DITDAH
DAH_&223:DITDAH DAH_ DAH DAH; DIT
DITDAH DIT_ DAH __DAH,_DIT_ __DAH DAH
DITDAH DIT_+= DIT DITDAH _DIT_>='a'? DITDAH _DIT_-'a':0
DAH;}_DAH DIT DIT_ DAH{ __DIT DIT
DIT_>3?_DAH DIT DIT_>>1 DAH:'\0'DAH;return
DIT_&1?'-':'.';}__DIT DIT DIT_ DAH _DAHDIT
DIT_;{DIT void DAH write DIT 1,&DIT_,1 DAH;}
+25
View File
@@ -0,0 +1,25 @@
<h1>Worst abuse of the C preprocessor</h1>
<p>Jim Hague<br>
University of Kent at Canterbury<br>
Canterbury, Kent<br>
UK</p>
<h2>Judges' comments:</h2>
<p>Compile this program and feed ascii text into standard input. This
program is known to pass lint on some systems and abort lint on
others.</p>
<p>This program was selected for the 1987 t-shirt collection.</p>
<p>Think morse code when you ponder this program. Note how use of
similar variables can be obfuscating! The author notes that this
program implements the international morse standard. Now for extra
credit, what morse message does the program spell out?</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+25
View File
@@ -0,0 +1,25 @@
# Worst abuse of the C preprocessor
Jim Hague
University of Kent at Canterbury
Canterbury, Kent
UK
## Judges' comments:
Compile this program and feed ascii text into standard input. This
program is known to pass lint on some systems and abort lint on
others.
This program was selected for the 1987 t-shirt collection.
Think morse code when you ponder this program. Note how use of
similar variables can be obfuscating! The author notes that this
program implements the international morse standard. Now for extra
credit, what morse message does the program spell out?
Copyright (c) 1986, 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.
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= holloway
all: ${WINNERS}
holloway: holloway.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+19
View File
@@ -0,0 +1,19 @@
<h1>Best simple task performed in a complex way</h1>
<p>Bruce Holloway<br>
Digital Research, Inc.<br>
Monterey, CA<br>
USA</p>
<h2>Judges' comments:</h2>
<p>Believe it or not, this is the old standard &ldquo;Hello, world&rdquo; program
performed in a very complex way. The judges and the author defy you
do determine how it does it. It is a good thing that K&amp;R didn&rsquo;t use
this version as the first C program!</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+19
View File
@@ -0,0 +1,19 @@
# Best simple task performed in a complex way
Bruce Holloway
Digital Research, Inc.
Monterey, CA
USA
## Judges' comments:
Believe it or not, this is the old standard "Hello, world" program
performed in a very complex way. The judges and the author defy you
do determine how it does it. It is a good thing that K&R didn't use
this version as the first C program!
Copyright (c) 1986, 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.
+33
View File
@@ -0,0 +1,33 @@
#include "stdio.h"
#define e 3
#define g (e/e)
#define h ((g+e)/2)
#define f (e-g-h)
#define j (e*e-g)
#define k (j-h)
#define l(x) tab2[x]/h
#define m(n,a) ((n&(a))==(a))
long tab1[]={ 989L,5L,26L,0L,88319L,123L,0L,9367L };
int tab2[]={ 4,6,10,14,22,26,34,38,46,58,62,74,82,86 };
main(m1,s) char *s; {
int a,b,c,d,o[k],n=(int)s;
if(m1==1){ char b[2*j+f-g]; main(l(h+e)+h+e,b); printf(b); }
else switch(m1-=h){
case f:
a=(b=(c=(d=g)<<g)<<g)<<g;
return(m(n,a|c)|m(n,b)|m(n,a|d)|m(n,c|d));
case h:
for(a=f;a<j;++a)if(tab1[a]&&!(tab1[a]%((long)l(n))))return(a);
case g:
if(n<h)return(g);
if(n<j){n-=g;c='D';o[f]=h;o[g]=f;}
else{c='\r'-'\b';n-=j-g;o[f]=o[g]=g;}
if((b=n)>=e)for(b=g<<g;b<n;++b)o[b]=o[b-h]+o[b-g]+c;
return(o[b-g]%n+k-h);
default:
if(m1-=e) main(m1-g+e+h,s+g); else *(s+g)=f;
for(*s=a=f;a<e;) *s=(*s<<e)|main(h+a++,(char *)m1);
}
}
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= marshall
all: ${WINNERS}
marshall: marshall.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+23
View File
@@ -0,0 +1,23 @@
<h1>Best layout</h1>
<p>Eric Marshall<br>
System Development Corporation, a Burroughs Company<br>
P.O. Box 517<br>
Paoli, PA.<br>
19301</p>
<h1>Judges' comments:</h1>
<p>This program prints the name of the picture. The layout is somewhat
pretty through it is not the usual sort of output one would expect
from printing a program!</p>
<p>This program was selected for the 1987 t-shirt collection.</p>
<p>This program is known to give some C compilers a problems.</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+23
View File
@@ -0,0 +1,23 @@
# Best layout
Eric Marshall
System Development Corporation, a Burroughs Company
P.O. Box 517
Paoli, PA.
19301
# Judges' comments:
This program prints the name of the picture. The layout is somewhat
pretty through it is not the usual sort of output one would expect
from printing a program!
This program was selected for the 1987 t-shirt collection.
This program is known to give some C compilers a problems.
Copyright (c) 1986, 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.
+14
View File
@@ -0,0 +1,14 @@
extern int
errno
;char
grrr
;main( r,
argv, argc ) int argc ,
r ; char *argv[];{int P( );
#define x int i, j,cc[4];printf(" choo choo\n" ) ;
x ;if (P( ! i ) | cc[ ! j ]
& P(j )>2 ? j : i ){* argv[i++ +!-i]
; for (i= 0;; i++ );
_exit(argv[argc- 2 / cc[1*argc]|-1<<4 ] ) ;printf("%d",P(""));}}
P ( a ) char a ; { a ; while( a > " B "
/* - by E ricM arsh all- */); }
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= pawka
all: ${WINNERS}
pawka: pawka.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+18
View File
@@ -0,0 +1,18 @@
<h1>Most illegible code</h1>
<p>Michael H. Pawka<br>
Naval Ocean Systems Center<br>
San Diego, Ca<br>
92152</p>
<h2>Judges' comments:</h2>
<p>The judges found this entry to be one of hardest to read without the
aid of <code>/lib/cpp</code> and a good editor. When run, the program asks if it
is obfuscated, of all things!</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+18
View File
@@ -0,0 +1,18 @@
# Most illegible code
Michael H. Pawka
Naval Ocean Systems Center
San Diego, Ca
92152
## Judges' comments:
The judges found this entry to be one of hardest to read without the
aid of `/lib/cpp` and a good editor. When run, the program asks if it
is obfuscated, of all things!
Copyright (c) 1986, 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.
+18
View File
@@ -0,0 +1,18 @@
#include "stdio.h"
#define xyxx char
#define xyyxx putchar
#define xyyyxx while
#define xxyyyx int
#define xxxyyx main
#define xyxyxy if
#define xyyxyy '\n'
xyxx *xyx [] = {
"]I^x[I]k\\I^o[IZ~\\IZ~[I^|[I^l[I^j[I^}[I^n[I]m\\I]h",
"]IZx\\IZx[IZk\\IZk[IZo_IZ~\\IZ~[IZ|_IZl_IZj\\IZj]IZ}]IZn_IZm\\IZm_IZh",
"]IZx\\IZx[I^k[I\\o]IZ~\\IZ~\\I]|[IZl_I^j]IZ}]I^n[IZm\\IZm_IZh",
"]IZx\\IZx[IZk\\IZk[IZo_IZ~\\IZ~_IZ|[IZl_IZj\\IZj]IZ}]IZn_IZm\\IZm]IZh",
"]I^x[I]k\\IZo_I^~[I^|[I^l[IZj\\IZj]IZ}]I^n[I]m^IZh",'\0'};/*xyyxyxyxxxyxxxyy*/
xyxx *xyyx; xxyyyx xyyyx,xyyyyx,xyyyyyx=0x59,xyyyyyyx=0x29,/*yxxyxyyyxxyyyxyy*/
xxyx=0x68;xxxyyx(){xyyyyx=0;xyyyxx(xyx[xyyyyx]){xyyx=xyx[xyyyyx++];/*xyyyxxyx*/
xyyyxx(*xyyx){xyyyx= *xyyx++-xyyyyyx;xyyyxx(xyyyx--)xyyxx(*xyyx-xyyyyyyx);/*x*/
xyxyxy(*xyyx==xxyx)xyyxx(xyyxyy);*xyyx++;}}}/*xyxyxyyyyxxyxxxyyyxyyyxyxxyyy*/
+109
View File
@@ -0,0 +1,109 @@
Copyright (c) 1986, 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.
WARNING: The rules and mailing address for the contest change from year
to year. Be sure that you consult the current set of rules
before submitting entries.
-------------------------------------------------------------------------------
Subject: Third International Obfuscated C Code Contest Rules
Newsgroups: net.lang.c
Keywords: rules,1986,obfuscate,contest
GOAL: To write the most Obscure working C program following the rules below:
RULES: 1) The source must be 1024 bytes or less. NO exceptions!
2) Include in your letter:
a) Name (or anonymous), Company/School, City, State and Country.
b) Your path from a major network site, if applicable.
c) A brief statement of what the program should do.
d) The Machine(s)/Operating system(s) on which it runs.
e) Enclose your source between the following lines:
---start of program---
<place obfuscated source of 1024 bytes or less here>
---end of program---
3) The entry should be written in common C. (K&R + common extensions)
4) The program must be of original work. All programs must be
in the public domain. All copyrighted programs will be rejected.
5) Entries must be received between 31-Mar-86 and 30-May-86 0:00 GMT.
Email your entries to:
decwrl!nsc!obfuscate
Entries sent by UUCP Email will be confirmed starting 1-May-86.
People are encouraged to submit entries via Email, however one may
mail entries the following address:
International Obfuscated C Code Contest
National Semiconductor
Attn: Landon Noll Mail Stop: 7c266
1135 Kern Ave.
Sunnyvale, CA 94086
U.S.A.
AWARDS: Winners of each category and the best of Show will be posted to
net.announce as well as being published in the May 86 issue of the
"Micro/Systems Journal". Winners also get to receive international
fame/flame for their efforts!
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. At the moment, we are considering using the following:
* The most obscure algorithm
* The worst abuse of the C preprocessor
* The strangest source layout
* The best small one line program
* The most useful program
* <anything else we need to give recognition to a good entry>
Judging will be done by myself, Larry Bassel and other local people
who are willing to help out.
We will attempt to run each of them on a Vax 785/4.2BSD system.
Don't let the lack of such a system stop you! Try to avoid operating
system/machine specific code if you do not have such a system.
Extra points will be given for programs which:
a) pass lint without complaint
b) do something quasi-interesting
c) are portable
A larger program size was selected to allow for a wider range of
program ideas. However if you don't need 1024 bytes don't use them.
Given two programs with similar techniques and similar levels of
obfuscation, we will tend to favor the more concise entry.
POLL: We want to know what you think is the most poorly coded utility
released with 4.xBSD and/or Sys V. The top results plus the
best flames will be posted along with the contest results.
To vote, please follow the guidelines below:
1) Include at the top of the letter:
a) Name (or anonymous), Company/School, City, State and Country.
b) Your path from a major network site, if applicable.
c) the name of the poorly coded utility
d) the name of the operating system on which it is found
e) the line: <<<FLAME ON>>>
f) up to 1024 bytes of flames
g) the line: <<<FLAME OFF>>>
2) Confine your vote to the standard set of commands. I.e., don't
flame about local commands or user contributed software.
3) Submit your votes via Email to:
for 4.xBSD: decwrl!nsc!bsd_util
for Sys V: decwrl!nsc!sysV_util
or, you may send your votes by letter to the same address used by
the contest. Please place your votes on different sheets of paper.
chongo <C> /\cc/\
+27
View File
@@ -0,0 +1,27 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= stein
all: ${WINNERS}
stein: stein.c
-rm -f a.out
cc $? -o $@
-ln $@ a.out
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+25
View File
@@ -0,0 +1,25 @@
<h1>Best one liner</h1>
<p>Jan Stein</p>
<p>Judges' comments:</p>
<blockquote><p>NOTE: to avoid problems with news and mail, the single line was split
into 3 lines. Join all lines into a single line to recreate
the original file.</p></blockquote>
<p>Compile and link to a filename called &lsquo;a.out&rsquo;. Try the program with the
following argument:</p>
<pre><code>a.out ^N^N
</code></pre>
<p>(^N is ASCII control-N). One some machines, ^M<sup>L</sup> is needed to get it to
output cleanly. Your system may require another set of characters.
In time, you will figure out what it does. :-)</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+24
View File
@@ -0,0 +1,24 @@
# Best one liner
Jan Stein
Judges' comments:
> NOTE: to avoid problems with news and mail, the single line was split
> into 3 lines. Join all lines into a single line to recreate
> the original file.
Compile and link to a filename called 'a.out'. Try the program with the
following argument:
a.out ^N^N
(^N is ASCII control-N). One some machines, ^M^L is needed to get it to
output cleanly. Your system may require another set of characters.
In time, you will figure out what it does. :-)
Copyright (c) 1986, 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.
+3
View File
@@ -0,0 +1,3 @@
typedef char*z;O;o;_=33303285;main(b,Z)z Z;{b=(b>=0||(main(b+1,Z+1),*Z=O%(o=(_%
25))+'0',O/=o,_/=25))&&(b<1||(O=time(&b)%0250600,main(~5,*(z*)Z),write(1,*(z*)Z
,9)));}
+25
View File
@@ -0,0 +1,25 @@
# %W% %G% %U%
#
# 1986 makefile
#
# Copyright (c) 1986, 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
WINNERS= wall
all: ${WINNERS}
wall: wall.c
cc $? -o $@
clean:
rm -f core
clobber: clean
rm -f ${WINNERS} a.out
install: all
@echo are you kidding'??'
+25
View File
@@ -0,0 +1,25 @@
<h1>The grand prize in most well-rounded in confusion</h1>
<p>Larry Wall<br>
System Development Corporation<br>
Santa Monica<br>
California<br>
US of A</p>
<h2>Judges' comments:</h2>
<p>The original version did not have a &lsquo;;&rsquo; character in the first line.
This caused a number of System V C pre-preprocessors to gripe about a
syntax error.</p>
<p>This program is a masterpiece of obfuscation and humor. Larry Wall
(the hacker who gave us rn and patch) asks you to compile and consider
the warning message generated by the C compiler. Then execute the
program and type charters into its standard input. You will see why
the compiler documents the program.</p>
<p>Copyright &copy; 1986, Landon Curt Noll &amp; 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.</p>
+25
View File
@@ -0,0 +1,25 @@
# The grand prize in most well-rounded in confusion
Larry Wall
System Development Corporation
Santa Monica
California
US of A
## Judges' comments:
The original version did not have a ';' character in the first line.
This caused a number of System V C pre-preprocessors to gripe about a
syntax error.
This program is a masterpiece of obfuscation and humor. Larry Wall
(the hacker who gave us rn and patch) asks you to compile and consider
the warning message generated by the C compiler. Then execute the
program and type charters into its standard input. You will see why
the compiler documents the program.
Copyright (c) 1986, 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.
+78
View File
@@ -0,0 +1,78 @@
#define _c(C)_ (C)&('|'+3):c_()(C)>>('\n'-3) __; /**/
#define C char*
#define keyboard ",,B3-u;.(&*5., /(b*(1\036!a%\031m,,,,,\r\n"
#define main(o,oo)oo(o){
#define _ ;case
C
#define c_(cc)c cc=
#define C_(sand)_O(sand)witch
o=keyboard;
#define __ ;break;
C
ccc(
cc)
C
cc;
{
C
cccc=
cc;int
#ifndef lint
#define keyboard "dijs QH.soav Vdtnsaoh DmfpaksoQz;kkt oa, -dijs"
#endif
c;
main(;c_(=(*cc);*cc++)c,for);
#define _O(s)s
main(0xb+(c>>5),C_(s))
_'\v'
:__ _'\f':
main(c,C_(s));
_c(8098)_c(6055)_c(14779)_c(10682)
#define O_(O)_O(O)stem(ccc(
_c(15276)_c(11196)_c(15150)
#define _C ;return
_c(11070)_c(15663)_c(11583)
}
__
default
:c_(+)o[c&__LINE__-007];
main(c_(-)'-'-1,C_(s))_
0214
:_
0216
:c_(+)025 _
0207
:c_(-)4 _
0233
:c_(+)' '-1;
}}c_(&)'z'+5;
}_C cccc;
}main(,cc)
C
#define O write(1,
c="O";
O_(sy) keyboard));
main(;;,for);
read(0,
c,1);*
c_(&)'~'+1
;O ccc(
c),
'\0');
main(*c,
C_(s));_
4
:O_(sy)";kkt -oa, dijszdijs QQ"))_C
_
13
:O o+' ',
3
)
#undef main
__ _ 127:O"\b \b",3)__
default
:O
c,1)
__}}}main(){
cc();
}