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.
This commit is contained in:
Landon Curt Noll committed
1 parent
1e82e8aa3e
commit
d2a42f42e8
478 files changed
No files matched your search
@@ -0,0 +1,67 @@
|
||||
char r[]="C#S3K+[;G'W7OB/_? ? « ( !IOCCC! ´ ³Ën £0 0 e÷|ÅtÑ%Ä ° 2u"
|
||||
" »¾ß mÔ/p ª c p) nm «¨ªúïµ!!¶â¡a £À3sîÜ 9sz2{ +§ 9_°0 © h0 ºÂ / "
|
||||
"¤)$1 ¬ a~ ) % y qÃ'¯ ¹â ° \" ! q 6 µy' 0 3;e{ Ì kãÔs¾,Ê 2~a q t"
|
||||
" 9dl 9 ¬.´ .ù_ &Á!ê '* · ; ·± µÁ = <eàª1à B:29 ¦ 6 n´ o®¨b:_2"
|
||||
" µ +úí h |÷t\177°#d`Ý l½Ù r )þÁ @ ·´Ö m d©ià ¤6 e¦ v¸½^ ¶` rq"
|
||||
"Á <'7Ã÷°ÅÙ ´[|äÈ=ñ@îp (², /ä^ c ¦ . ` £²î ¡ñ`fæ /= :ù]y÷¢·"
|
||||
" 2º » q ¢ v²4Õm³íÓ&=a¤¡ g ; dà,é+· +_¼ =È 5߬iêÔØû§ÌÌ r£"
|
||||
#define O(Q)p!O) { *i[25][41]|=U(642+Q); u e r[(Q)/2]&63); }
|
||||
"solÞÄ&¾X¼[Ý; }ï? º= &c} 9ȾóÀ2 >ü 5 ,Þ & Ã0 Úù*½ ³äÿgh";
|
||||
#define C( b)O(28+(B+b)%6)
|
||||
# define a >> B &M[i X]
|
||||
#include/* s */<stdio.h>
|
||||
#include/* s */<time.h>
|
||||
unsigned int long
|
||||
# define e putchar(
|
||||
B,E,M,A,Z,I,N,G
|
||||
# define g ! (32 a)
|
||||
# define u U(533);
|
||||
# define n (65 a)
|
||||
# define z for (
|
||||
[32768], i [32]
|
||||
# define p if(
|
||||
[48][3]={ { { 2} } } ; void**V,*D,*F[32][48];
|
||||
void*Q(void**O){ return*O?(*O=Q(*O)):O; } U(
|
||||
O){return E+=(O/=2)-1?U((A=A/2^57525273+(A&
|
||||
1^O&1)*9583591<<5,O)),0:O,16; } main(O){ A
|
||||
=O?time(D):953351751; z I=0; I<26; ++I){z
|
||||
N=I/2; N<30+I/2; ++N){ z M=0; M<3; ++M){
|
||||
p Z=O)z; (B=I+Z*!!M) <26&&N+Z*(M!=2)-B/
|
||||
2<30; B[G]=N<<7|Z++<<13|I*4+M)z; G[B=A
|
||||
# define X [ I+Z*!! M] [ N+Z*(M!= 2)]
|
||||
&32767]; )u p!Z&&M[i X]){ z B=0; B<6
|
||||
; B++){ p!g){ C(5)O(0)C(2)O(2)} C((
|
||||
B&1?!!n:4-3*g))p!g|n)O(4)O(7)} z B
|
||||
=0; B<6; B++){ p g&&!n)O(14)p!g)O
|
||||
(8)p B&1|g){ O=!n; O(10)O=!(1040
|
||||
a ); O(12 )O=0; } O(17+(B&1 ?!(
|
||||
1040 a)!=!n:g))} } } O(24)} O(
|
||||
21+(I&1))} O(26)p O)z E=0; E<
|
||||
1<<15; I=16){ B=E++[G]; D=Q(
|
||||
&F[I=B/4&31][N=B>>7&63]); M
|
||||
=B%4; Z=B>>=13; V=Q(&F X);
|
||||
p!(D==V|N[I[i]] [1]|i X[1
|
||||
])){ z; --Z&&!(*i X%9|*i
|
||||
X/9&*i X/9-1); ); p!Z){
|
||||
*V=D; *i X|=32>>M; Z=B
|
||||
; z*i X|=4>>M; --Z; i
|
||||
X[*i X?2-!i X [1]:!(
|
||||
F X=V)]=36>>M); } }
|
||||
} p!O){ u u z I=8;
|
||||
I--; )p(N=I[r]=(I
|
||||
>3?E:A)>>(I*9&24
|
||||
))==10||N==13){
|
||||
e 0 ); I =8; u
|
||||
u u u} e 1 );
|
||||
} z E =1333;
|
||||
++ I<8+469*
|
||||
!!O; e(N=I
|
||||
[r])-32|!
|
||||
O?N:r[++
|
||||
I]-N));
|
||||
return
|
||||
O &&
|
||||
main
|
||||
(!O
|
||||
);
|
||||
}
|
||||
@@ -0,0 +1,78 @@
|
||||
Best Encapsulation:
|
||||
|
||||
Bas de Bakker
|
||||
Pica, Centre for Library Automation
|
||||
Statenweg 154 B (home address)
|
||||
3039 JN Rotterdam
|
||||
The Netherlands
|
||||
|
||||
|
||||
Judges' comments:
|
||||
|
||||
To build:
|
||||
|
||||
make bas1
|
||||
|
||||
To use:
|
||||
|
||||
If lpr on your system can print PostScript:
|
||||
|
||||
./bas1 | gunzip | lpr
|
||||
|
||||
else, while in X Window System,
|
||||
|
||||
./bas1 | gunzip | gv -
|
||||
or:
|
||||
./bas1 | gunzip | gs -sDEVICE=pgmraw -sOutputFile='|xv -' -
|
||||
|
||||
The output is supposed to be a 3D maze, but it is somewhat more
|
||||
than that. If you've seen any of the Maurits Escher's works,
|
||||
you'll know what we're talking about.
|
||||
|
||||
When trying to run the program with command line arguments, be generous.
|
||||
|
||||
|
||||
Selected Author's Comments:
|
||||
|
||||
BEMAZING
|
||||
========
|
||||
|
||||
"You're in a twisty little maze of beams, all different."
|
||||
|
||||
Bemazing is "amazing" taken one step (letter) further. Bemazing
|
||||
creates a 3D maze of beams. Try to go from the entrance (the
|
||||
unfinished beam in one corner) to the exit (the unfinished beam in the
|
||||
opposite corner) or vice versa.
|
||||
|
||||
For maximum portability, Bemazing is not tied to any window system,
|
||||
but creates postscript. The picture it makes will fit on either A4 or
|
||||
letter size paper.
|
||||
|
||||
In addition, because postscript is rather verbose, Bemazing creates
|
||||
the postscript in gzip format, in order to save precious bits on your
|
||||
hard disk for the latest version of GNU Emacs (after all, you wouldn't
|
||||
want to use an editor without a psychoanalyze-pinhead function, now
|
||||
would you). Again for maximum portability, Bemazing will take special
|
||||
care that the binary output will not contain any newline or return
|
||||
characters that may get weird treatment on systems that do not use the
|
||||
One True Line Separator.
|
||||
|
||||
NOTES
|
||||
=====
|
||||
|
||||
Be sure to view the source with something that can display characters
|
||||
\240-\377. Use LESSCHARSET=latin1, M-x standard-display-european in
|
||||
GNU Emacs etc. The source does not use characters in the range
|
||||
\200-\237 (we are not an unnamed word processor that tends to create
|
||||
HTML containing these control characters).
|
||||
|
||||
Because this is not the obfuscated postscript contest, the postscript
|
||||
does not contain any "for", "if" or other control structures. All the
|
||||
logic is in the C code. There are only a few straightforward "def"s,
|
||||
because otherwise the output would become much larger.
|
||||
|
||||
Try running Bemazing with command line arguments and see what
|
||||
happens. (But note that the program only guarantees that there
|
||||
actually is a route from entrance to exit if you run it without
|
||||
command line arguments.)
|
||||
|
||||
Reference in new issue
Block a user