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.

2000/briddlebane/briddlebane.c

@@ -0,0 +1,20 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <time.h>
+#define e(t, v, w) n t(u x, u y) { n a = sqrt(x+y); r ((v - a) * (w - a)); }
+#define w while(
+#define r return
+typedef char u; typedef short q; typedef double n;
+u *z = "Z\253\345\252\256\351\325\232\265f\256\246nyZf\253U^\266\232]z\352i\236\226i[m\266\351\252\255\246\235V\247e\235\226\276Z\371jUg\x3\362\212pX\254\251PH\253\332\225\373\235\b\v\336HO.\203Qf\201\x1d\207\211\357\367S7|)=\331n\x4!E<\233Z\246\x1flv\232d(r\263\274\375\313\305\200\361\302\327\274\375\300\201c\250-|\246]\304\253I\377W\227R^\251\350\x2""C\251\203\311O\346\242\vDh\r\357\306x\325\274\315\366c\th\325\272\376\311X+:\325\354q\263|\257\x1c\327\316g\204\266s\211\357\370A(\x11""D\321\x1d:\352\327\x1bk@\x11""E-\310s\271\235\304\273\x2+\x4I\274jT\256\363\214\307{\232a\3270\a+qm\270\aI\315\337\220\x17\x18\315G\217\371@\215\335\v[v\335\205\343\250-|\246\373:\225\f\2552Oe]\206U\272\355\x10\327)u\rY]\276>\243\333w{3\x19\v""acC8\3775\351\b\377\204lJnsy.:\330\2553rKx'\362'!%\302\271\376|\236skq\242C\251\263&\x15K\x4""fA\227\211\242r7]\371\333\200z%\277\207CJ\255^}\264\237\327\275Z\n;L\x1aN#\371N\354G\256skq\242K!\364\211E\214\x17\377\343z\340w\233\272\354eTD\262t\365\335[_\233\225J\313\2746\334\x3\b\244F&\240]\222\332\210\351\376rJs<\2265I;\203Xd\272\377\345\214\x17\263]2I\237\302\253\346\355\332\343\350G\327\"\350f}\301n\223\366\300\210\343j\247\316%\363\210\345\n\252\215c\255\314\3248\300\261\350RM7\203\261\371\265\r_\220\x17\x19\a(+u\x1d=I\235\314\331@\310Cl\x16\210\307\345\357\306\x1f""e\345R\354y\257\367\350!.\x1f`\345uW&\204\246\367>\226\335\205\353\x18\336;\302\334\266\213Fn\233\201vAE\325+qnVR\222e\237E<e\203!f\333\345[\x17#\205\273I\314\371n\340\304\205\225h\323\336\371\x1c""7\227\201%\327\201p\326\263\351f\x19\a\v\336;uI\312?\214\265I1$\302+\373\233v\336\x5\306,y\313OD\351d*\350f\357H\262]\x3\332l\365L\237Qs\320{\231\244\204d\352v\335\215\327\357\200\247\302W\x10", x, y;
+n g() { r (n)rand()/18972; } n t, v; q F, B, C; e(a, 0, 3.0) e(b, 3.0, 4.125) 
+e(c, 4.125, 9) u f(n (*h)()) { do { t=g() * 6.283184; v = sqrt(g() * 72); y = 
+sin(t) * v; x=cos(t)*v; } w (h(x*x,y*y)>=0)||(fabs(x) > 5) || (fabs(y) > 5));
+r ((y+5) * 11) + x + 7; } u k(q x, u l) { u o = 0; F = 0; w F < 189) { B =C =
+0; w 1) { y = ((z[F/4]>>((F++%4)*2))&3) - 1; if (y&2) 
+break; C = (C*2)+y, ++B; } if (!(C - x | B - l)) r (o<26)?o+0x61:((2108973>>(
+(o-26)*8))&47); ++o; } r 1; } u s[1079]; u *E(u v) { u *x = s; w v--)w *(x++)
+); r x; } main() { q A = 0, B = 0, C = 1078; u l = 0; u *p = s; srand(time( 0
+) ); w C) { A = (A*2) + ((((z[B/8+48]+114)^2)>>(7-(B++%8)))&1),++l; x = k(A,l
+); if (x-1) { *(p++)=x, A=l=0, C--; } } printf("%s%s %s%s%s\n", E(0), E(f(c))
+, E(f(a)), E(1), E(f(b))); }

2000/briddlebane/briddlebane.hint

@@ -0,0 +1,56 @@
+Best Abuse of User:
+
+    Moxen N. Briddlebane
+    24 Oxtree Ave.
+    The Xoemn, MN 68214
+
+    Lord Zarbon
+    24 Oxtree Ave.
+    The Xoemn, MN 68214
+
+
+Judges' Comments:
+
+    To build:
+
+       make briddlebane
+
+    To run:
+
+       ./briddlebane
+
+     One could argue that this program was a "diseased dumpster of tripe"
+     but I suspect that would only result in the judges being heckled as a
+     "scum-encrusted congress of obscurity" (but only if it was in the early
+     evening of Dec 22, 2000).
+
+     Can you find out how it stores the insult strings?  Can you then take
+     an insult and figure out when it will be uttered?
+
+     [sc] The code also contains a buffer overflow bug which I have fixed!
+     The array size of "s" should be 1079 characters long.  (From 0 to 1078
+     inclusive!).  Without this it results in an error in the encoding of
+     "decrepit" -- For a 32bit little endian machine using GCC (because of
+     the way it assigns variables to memory) it will terminate "decrepit"
+     with the character '\200' (the last value of F) instead of '\0'.
+
+
+Selected Author's Comments:
+
+    This program was broadcast from deep within the Zarbonic Cluster
+    and received at 9:03pm on March 21st, 2000 by Moxen N. Briddlebane.
+    The original author, as designated by other components of the
+    transmission, refers to himself simply as "Lord Zarbon", though
+    offers no information in relation to the significance of that
+    post. The sole purpose of this program appears to be to degrade
+    and humiliate the people of this planet by calling them names.
+    It takes no input, only produces a single line of slanderous output.
+
+    The program appears to be rather confused, internally. It is
+    unclear whether or not "Lord Zarbon" truly understands the
+    mechanics of programming. What is particularly disturbing is
+    the curious method of insult-encoding employed by this program.
+    Furthermore, it is ambiguous how said data is arranged and why
+    it is necessary to resort to trigonometric functions to handle
+    it.  One of the real mysteries involves the numbers "114" and
+    "2", which are, according to Lord Zarbon, very deliberate.

2000/briddlebane/briddlebane.orig.c

@@ -0,0 +1,20 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <time.h>
+#define e(t, v, w) n t(u x, u y) { n a = sqrt(x+y); r ((v - a) * (w - a)); }
+#define w while(
+#define r return
+typedef char u; typedef short q; typedef double n;
+u *z = "Zｫ蟐ｮ鰈垠fｮｦnyZfｫU^ｶ咯z麒椁i[mｶ鬪ｭｦ抃ｧe摶ｾZ�Ug\x3�pXｬｩPHｫﾚ方拿b\vﾞHO.ゲf―x1d㊨�S7|)=ﾙn\x4!E<媚ｦ\x1flv單(rｳｼ�ﾋﾅ€�ﾗｼ�ﾀ…ｨ-|ｦ]ﾄｫI�W由^ｩ鐔x2""CｩλO譴\vDh\r�xﾕｼﾍ�\thﾕｺ�ﾉX+:ﾕ�ｳ|ｯ\x1cﾗﾎg┯s会�(\x11""Dﾑ\x1d:�\x1bk@\x11""E-ﾈsｹ敍ｻ\x2+\x4IｼjTｮ�ﾇ{啾ﾗ0\a+qmｸ\aIﾍﾟ申x17\x18ﾍG錠@在\v[vﾝ�ｨ-|ｦ�:表fｭ2Oe]�ｺ偆x10ﾗ)u\rY]ｾ>｣ﾛw{3\x19\v""acC8�5饅b��Jnsy.:ﾘｭ3rKx'�'!%ﾂｹ�|枹kq｢Cｩｳ&\x15K\x4""fA莱｢r7]�€z%ｿ④Jｭ^}ｴ湶ｽZ\n;L\x1aN#��ｮskq｢K!�E圭x17�縻烱崋�TDｲt�[_尓Jﾋｼ6ﾜ\x3\b､F&�]嬬磯�rJs<�5I;スdｺ�蛹\x17ｳ]2I淞ｫ跫ﾚ肛Gﾗ\"鑁}ﾁn賑ﾀ医jｧﾎ%�藹nｪ皇ｭﾌﾔ8ﾀｱ鏗M7Τ�\r_申x17\x19\a(+u\x1d=I變ﾙ@ﾈCl\x16杏襃ﾆ\x1f""e薐�ｯ�!.\x1f`蛄W&┬�>餅�\x18ﾞ;ﾂﾜｶ祈n宦vAEﾕ+qnVR弾檸<e�!fﾛ藜\x17#�Iﾌ�狷�hﾓﾞ�x1c""7浴%ﾗ｝ﾖｳ馭\x19\a\vﾞ;uIﾊ?厳I1$ﾂ+蕙vﾞ\x5ﾆ,yﾋOD馘*鑁�ｲ]\x3ﾚl�櫺sﾐ{勁�黐ﾝ細�ｧﾂW\x10", x, y;
+n g() { r (n)rand()/18972; } n t, v; q F, B, C; e(a, 0, 3.0) e(b, 3.0, 4.125) 
+e(c, 4.125, 9) u f(n (*h)()) { do { t=g() * 6.283184; v = sqrt(g() * 72); y = 
+sin(t) * v; x=cos(t)*v; } w (h(x*x,y*y)>=0)||(fabs(x) > 5) || (fabs(y) > 5));
+r ((y+5) * 11) + x + 7; } u k(q x, u l) { u o = 0; F = 0; w F < 189) { B =C =
+0; w 1) { y = ((z[F/4]>>((F++%4)*2))&3) - 1; if (y&2) 
+break; C = (C*2)+y, ++B; } if (!(C - x | B - l)) r (o<26)?o+0x61:((2108973>>(
+(o-26)*8))&47); ++o; } r 1; } u s[1079]; u *E(u v) { u *x = s; w v--)w *(x++)
+); r x; } main() { q A = 0, B = 0, C = 1078; u l = 0; u *p = s; srand(time( 0
+) ); w C) { A = (A*2) + ((((z[B/8+48]+114)^2)>>(7-(B++%8)))&1),++l; x = k(A,l
+); if (x-1) { *(p++)=x, A=l=0, C--; } } printf("%s%s %s%s%s\n", E(0), E(f(c))
+, E(f(a)), E(1), E(f(b))); }