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?).

1985/august/Makefile

@@ -0,0 +1,26 @@
+# %W% %G% %U%
+#
+# 1985 makefile
+#
+# Copyright (c) 1985, 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}
+
+install: all
+	@echo are you kidding'??'

1985/august/august.c

@@ -0,0 +1,14 @@
+#define p struct c
+#define q struct b
+#define h a->a
+#define i a->b
+#define e i->c
+#define o a=(*b->a)(b->b,b->c)
+#define s return a;}q*
+#define n (d,b)p*b;{q*a;p*c;
+#define z(t)(t*)malloc(sizeof(t))
+q{int a;p{q*(*a)();int b;p*c;}*b;};q*u n a=z(q);h=d;i=z(p);i->a=u;i->b=d+1;s
+v n c=b;do o,b=i;while(!(h%d));i=c;i->a=v;i->b=d;e=b;s
+w n o;c=i;i=b;i->a=w;e=z(p);e->a=v;e->b=h;e->c=c;s
+t n for(;;)o,main(-h),b=i;}main(b){p*a;if(b>0)a=z(p),h=w,a->c=z(p),a->c->a=u,
+a->c->b=2,t(0,a);putchar(b?main(b/2),-b%2+'0':10);}

1985/august/hint.html

@@ -0,0 +1,20 @@
+<h1>The most obscure program</h1>
+
+<p>Lennart Augustsson
+&lt;chalmers!augustss></p>
+
+<h2>Judges' comments:</h2>
+
+<p>An interesting use of a recursive call to main.  Compile and execute
+without args.  What is the initial value of b, and does it alter the
+action of the program?</p>
+
+<p>If you let it, the program will continue to print a numerical sequence
+(can you guess in what base it is printed?) until you run out of
+memory or until they sell your computer, which ever comes first.</p>
+
+<p>Copyright &copy; 1985, 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>

1985/august/hint.text

@@ -0,0 +1,20 @@
+# The most obscure program
+
+Lennart Augustsson
+<chalmers!augustss> 
+
+## Judges' comments:
+
+An interesting use of a recursive call to main.  Compile and execute
+without args.  What is the initial value of b, and does it alter the
+action of the program?
+
+If you let it, the program will continue to print a numerical sequence
+(can you guess in what base it is printed?) until you run out of
+memory or until they sell your computer, which ever comes first.
+
+Copyright (c) 1985, 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.