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.

1995/esde/esde.c

@@ -0,0 +1,22 @@
+                                     		           #include <stdio.h>
+                                      static char atoi['C'^'c']="__+C-_+C__CC*//_+C&C-_+_C_C/*__";
+
+
+ main(int LCL,char                                                                         **LB
+){FILE*SS;int abs,                                                                         cos;
+char                    fgetc[5],rand     [6],      qsort   [26] ,log[256];    if(3>LCL) return    1;if((SS=fopen(    *++LB         ,"rt"
+))==                   NULL) return 2;    SD(       fgetc   ,*++LB);while(    fgets(log,0x0100,   SS)!=NULL){ abs^=    abs;        abs--;
+while                 ((int)abs<     (int)strlen    (log      )){cos  ^=cos;    while   (!(       isalpha   (log[      ++abs])  ))if(       !(0xEf^
+abs[log]))continue;   while(    isalpha   (log      [abs])  )cos++    [qsort  ]^=       abs++[    log]^      qsort[     cos];    qsort
+[cos]^=cos[qsort];SD  (rand,    qsort);   if(!      (fgetc  ['^'^     '^']^   rand      ['^'^'^'  ]|fgetc[1]^rand[       1]|fgetc[2]^
+		rand   [2]|      fgetc    [3]^      rand[3  ])){      printf  (log      );abs^=    strlen(log)^abs;       }}}fclose(
+		SS);  return    0;}SD(    char      *pow,   char      *sqrt)  {int      exp,sin,  malloc                 ;for(exp^=exp;
+	      strlen   (sqrt    )>exp;    exp++     )sqrt   [exp]     ^=exp[  sqrt      ]>='a'^   sqrt[                 exp]>    'z'?'C'
+^'c':'^'^'^'; pow[1]  ^=pow[1];pow[2]&=   pow[1];pow[3]^=  pow[3]    ^pow[2]  ;pow[0]^=sqrt[0]^   pow[2][pow];if(!(   (malloc    ^=strlen
+(sqrt)^malloc,malloc   ?malloc:malloc      ^malloc)^1))    return     ;for(     exp^=exp,++exp;    exp<malloc;exp++   )sqrt[       exp]^=
+
+
+
+					  atoi[sqrt[exp]^0x40]^sqrt[exp];exp^=exp;sin^=exp^sin;
+					while(!!(~exp&3)&(malloc>++sin))if((sin[sqrt]^'_')&&(sqrt
+					  [sin-1]^sqrt[sin+0]))pow[exp]^=sin[sqrt]^pow[++exp];}

1995/esde/esde.data

@@ -0,0 +1,16 @@
+Johnson
+Mike
+Steve Jonsun
+Dolly
+Stephany
+Steven
+Mick
+Michael
+Dorroty
+Katty Johnsone
+Denis
+Dennis
+Jahansen
+Deorowicz
+Dorowicz
+Deodorowicz

1995/esde/esde.data2

@@ -0,0 +1,3 @@
+Can't figure esde does?  
+Read the source ...
+until your eyes grow red.

1995/esde/esde.hint

@@ -0,0 +1,64 @@
+Interesting Algorithm:
+
+    Sebastian Deorowicz
+    ul. Radzionkowska 71a
+    42-605 Tarnowskie Gory 
+    Poland
+
+
+Judges' comments:
+
+    To use:
+	make esde
+
+    Try: 
+	esde esde.data Johanson
+	esde esde.data2 read
+	esde esde.hint date
+
+    In general:
+
+	esde data-file word
+
+    where data-file contains lines of < 255 chars in length.
+
+    When reading the source be careful to distinguish between variable
+    names and library functions.  
+    
+    If you still don't know what it does, try:
+
+	http://avian.dars.muohio.edu/~kaelbesa/soundex.html
+	http://avian.dars.muohio.edu/~kaelbesa/coder.html
+
+
+Selected notes from the author:
+
+    0) what this program does.
+       This program searches in the file words which have the same Soundex code
+       like the given word, and print out lines with these words.
+
+       The Soundex code is using to find similar sounds words.
+
+       Soundex code begins with the first letter of the word followed by a
+       three-digit code. There is the algorithm:
+
+       a) Every letter in the word change by a digit (excluding the first
+          letter).
+       b) Replace all pairs of the same code by single code
+          (ex. R011235 -> R01235).
+       c) Remove all 0-codes (ex. R01235 -> R1235).
+       d) If lenght of code is > 4, get only first 4 codes (ex. R1235 -> R123).
+       e) If lenght of code is < 4, add zeros (ex. T12 -> T120).
+
+       There is the codes:
+              0  =  A, E, H, I, O, U, W, Y
+              1  =  B, P, F, V
+              2  =  C, S, G, J, K, Q, X, Z
+              3  =  D, T
+              4  =  L
+              5  =  M, N
+              6  =  R
+
+    1) information about an info file.
+       An info file should be a text file consisting of lines (max. 256 bytes
+       in each line).