Move 1988-2004 entries into subdirs

We we move 1988-2004 entries from all of a year's winning entries
in a single directory to each winner being in their own sub-directory
under the given year directory.

1998/schnitzi/schnitzi.c

@@ -0,0 +1,56 @@
+typedef void e();
+
+e *w,*l,*u,*_o,*j,*t,*O,exit,b,c_,b_,a_,c,a,z_,x_,d,y_,_m;
+int q,m,_d,z,k,h,f[99];
+char y[26],_p[40][26],_q,r[2],*_,**s,*i,
+
+*x[]= { "\n", ")", "if (", "}\n", ");\n\n", "    ", ",&", "\"",
+  ",", " %%d", ";\n\n    scanf(\"%%d", "%%d ", "else ", ",", "<",
+  ");\n", "printf(\"", "main()\n{\n    int a" };
+
+void  g(){ O=j; printf(_); }
+void _j(){ O=_o; m=!m; h=h+m*(long)t; }
+void _u(){ O=g; _=x[0]; j=b; }
+void _r(){ O=g; _=x[1]; j=_u; }
+void _f(){ O=g; *r=y[k-1]; _=r; j=_r; }
+void _l(){ O=g; _=x[2]; j=x_; }
+void _c(){ O=(e*)h; }
+void  n(){ O=_j; t=w; _o=_c; }
+void  p(){ O=_j; h=0; t=l; _o=n; }
+void _b(){ O=p; q=*i+q*10-'0'; i=i+1; m=*i; w=_b; l=c; }
+void _s(){ O=g; _=x[3]; j=exit; }
+void  v(){ O=p; z=z-1; m=z; w=z_; l=_s; }
+void _a(){ O=g; _=x[4]; *y=x[17][1]; z=0; j=b; }
+void _z(){ O=g; _=x[5]; j=p; k=k-1; m=k; w=_z; l=u; }
+void _h(){ O=g; _=x[6]; j=a_; }
+void _e(){ O=g; _=x[7]; k=0; j=_h; }
+void _t(){ O=g; _=x[8]; j=d; }
+void _g(){ O=g; _=x[7]; j=_t; k=0; }
+void _k(){ O=_z; k=f[z]; _q=y[k]; y[k]=y[k-1]; y[k-1]=_q; u=b_; k=z; }
+void d_(){ O=_k; y[z+1]=x[17][1]+z; f[z]=z+1; }
+void b (){ O=p; z=z+1; m=q-z; w=c_; k=z; l=_z; u=a; }
+void e_(){ O=g; _=x[9]; k=k+1; m=k<q; w=e_; l=_e; j=p; }
+void f_(){ O=g; _=x[10]; k=1; j=e_; }
+void g_(){ O=g; _=x[11]; j=p; k=k-1; m=k; w=g_; l=_g; }
+void h_(){ O=p; _p[z][k]=y[k]; k=k+1; m=k<=z; w=h_; l=d_; }
+void i_(){ O=p; y[k]=_p[z][k]; k=k+1; m=k<=z; w=i_; l=v; }
+void j_(){ O=i_; k=0; }
+void k_(){ O=p; m=k>1; w=_l; l=_u; }
+void l_(){ O=g; _=x[12]; j=k_; }
+void m_(){ O=g; _=x[13]; j=y_; }
+void n_(){ O=p; k=k+1; m=k<q; w=_h; l=_a; }
+void o_(){ O=g; _=x[14]; j=_f; }
+void c_(){ O=h_; k=0; }
+void p_(){ O=g; _=x[15]; j=v; }
+void b_(){ O=p; k=f[z]; m=k<=z; w=l_; l=k_; }
+void a_(){ O=g; *r=x[17][1]+k; _=r; j=n_; }
+void q_(){ O=p; k=k+1; m=k<q; w=m_; l=f_; }
+void c (){ O=g; r[1]=0; k=1; j=m_; }
+void a (){ O=g; k=z; j=g_; _=x[16]; }
+void z_(){ O=p; f[z]=f[z]-1; m=f[z]; w=_k; l=j_; }
+void x_(){ O=g; *r=y[k-2]; _=r; j=o_; }
+void d (){ O=g; *r=y[k]; _=r; k=k+1; m=k<z; w=_t; l=p_; j=p; }
+void y_(){ O=g; *r=x[17][1]+k; _=r; j=q_; }
+void r_(){ O=_b; _=x[17]; s=(char**)_d; s=s+1; i=*s; q=0; }
+main(v,c){ O=r_; _d=c;
+  x: (O)(); goto x; }

1998/schnitzi/schnitzi.hint

@@ -0,0 +1,92 @@
+Best Flow Control:
+
+    Mark Schnitzius
+    ISX Corporation
+    1280 West Peachtree St. Apt. 1507
+    Atlanta, GA 30309
+    USA
+
+    http://east.isx.com/~schnitzi/
+
+
+Judge's Comments:
+
+    To build:
+
+	make schnitzi
+
+    To use:
+
+	./schnitzi 5 > sort.c
+	cc sort.c -o sort
+	echo 123 > data
+	echo 234 >> data
+	echo 413 >> data
+	echo 134 >> data
+	echo 324 >> data
+	./sort < data
+
+    This is a beautiful program.  How can a program with no conditional
+    behavior at all have output which depends on anything?
+
+    For hints on deciphering this, see below past the Author's Comments;
+    they're a nice summary, but they leave the mystery intact.
+
+
+Selected Author's Comments:
+
+    In literary circles, there is a poetic form called a "lipogram",
+    which is a poem in which a specific letter has been distinctly
+    avoided.  This principle can be applied in other ways.  For
+    instance, in this paragraph, the vowel which immediately follows
+    't' in the alphabet is nowhere to be seen.  There is even an
+    entire novel (E. V. Wright's "Gadsby") in which no word contains
+    the letter 'e'.
+
+    The IOCCC has been no stranger to this concept.  Several winning
+    entries from years past have accomplished interesting feats while
+    completely avoiding the use of certain C constructs thought to
+    be essential (e.g. 1988's robison.c).  If you have to ask why they
+    would do it this way, then this contest just isn't for you.
+
+    In continuing with this fine tradition, this program suggests to
+    the ANSI committee some new practical simplifications for the C
+    language.  For instance, it appears that CONDITIONAL BRANCHING isn't
+    really necessary.  So, we can do away with while, do...while, for,
+    if/else, switch, ?:, or anything else that might cause any kind of
+    nondeterministic jump in the code.  There's too much uncertainty
+    in the world anyway.
+
+    Function parameters and return types just confuse people anyway, so
+    get rid of them.  Same with local variables.  In fact, all you really
+    need are assignment statements, and maybe one printf() and one goto.
+
+    This style of programming is also ideal for systems with limited
+    memory capacity, since the function call stack never goes beyond
+    a depth of one.
+
+    So what does it do?  Give it an integer (1 < n < 27) on the command
+    line, such as
+
+    	schnitzi 5
+
+    The output will itself be a lipographic program, one which inputs
+    (in this case) five numbers and prints them out sorted.  It sorts
+    them, however, using only "if/else" statements, without arrays or
+    looping.  To see the resulting program run, redirect the output from
+    "schnitzi" into another file, like this
+
+    	schnitzi 4 > sort.c
+
+    and then compile it.
+
+Spoilers And Hints:
+
+    The big key to this program is figuring out what the names of the
+    functions ought to be; a bit of research may allow you to guess at
+    a few crucial ones.
+
+    The only function ever called is "O", but "O" is just set to point to
+    other functions all the time.  Or, almost all the time.
+
+    So how does 'h' get set, and what to?