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,73 @@
|
||||
#include <X11/Xlib.h>
|
||||
#include <unistd.h>
|
||||
typedef long O; typedef struct { O b,f,u,s,c,a,t,e,d; } C;
|
||||
Display *d; Window w; GC g; XEvent e;
|
||||
char Q[] = "Level %d Score %d", m[222];
|
||||
#define N(r) (random()%(r))
|
||||
#define U I[n++]=L[n]=l; n%=222
|
||||
#define K c=-l.u; l=I[i]; l.t=0; c+=l.u
|
||||
#define E l.e--&&!--L[l.e].d&&(L[l.e].t=3)
|
||||
#define M(a,e,i,o) a[0]=e,(a[1]=i)&&XFillPolygon(d,w,g,(void*)a,o,1,1)
|
||||
#define F return
|
||||
#define R while(
|
||||
#define Y if(l.t
|
||||
|
||||
|
||||
O p ,B,
|
||||
D,A=6,Z ,S=0,v=
|
||||
0,n=0,W=400 ,H=300,a[7]
|
||||
={ 33,99, 165, 231,297,363} ;
|
||||
XGCValues G={ 6,0 ,~0L,0,1} ; short
|
||||
T[]={ 0,300,-20,0,4 ,-20,4,10,4,-5,4,5,
|
||||
4,-20,4,20,4,-5,4,5,4, -10,4,20},b[]={ 0,0,4,
|
||||
0,-4,4,-4,-4,4,-4,4,4} ; C L[222],I[222];dC(O x){
|
||||
M(T,a[x],H,12); } Ne(C l,O s) { l.f=l.a=1; l.b=l.u=s;
|
||||
l.t=16; l.e=0; U; } nL(O t,O a,O b,O x,O y,O s,O p){ C l;
|
||||
l.d=0; l.f=s; l.t=t; y-=l.c=b; l.e=t==2?x:p; x-=l.s=a;s=(x|1)
|
||||
%2*x; t=(y|1)%2*y; l.u=(a=s>t?s: t)>>9;l.a=(x<<9)/a;l.b=(y<<9)/a;
|
||||
U; } di(C I){ O p,q,r,s,i=222;C l; B=D=0; R i--){ l=L[i]; Y>7){ p=I.s
|
||||
-l.s>>9; q=I.c-l.c>>9; r=l.t==8?l.b: l.a; s=p*p+q*q; if(s<r*r||I.t==2&&s<
|
||||
26) F S+=10; s=(20<<9)/(s|1); B+=p*s; D+=q*s; }} F 0; } hi(O x,O d){ O i=A;
|
||||
R i--&&(x<a[i]-d||x>a[i]+d)); F i; } dL(){ O c,r=0, i=222,h; C l; R i--){ l=L[i];
|
||||
Y){ r++;c=l.f; Y==3){c=l.u; l.t=0; E; }R c--){-- l.u;h=l.c>>9; Y>7){XDrawArc(d,w,g,
|
||||
(l.s>>9)-++l.a,h-l.a,l.a*2,l.a*2,0 ,90<<8); if(!l.u){ I[i].t-=8; l=I[i]; } } else Y==2)M
|
||||
(b,l.s>>9,h,6); else XDrawPoint(d ,w,g,(l.s+=l.a)>>9, h=(l.c+=l.b)>>9); Y==4&&!l.u){ Ne
|
||||
(l,20); K; } Y&&l.t<3&&(di(l)||h> H)){ if(h>H&&(c=hi( l.s>>9,25))>=0){ dC(c); a[c]=a[--
|
||||
A]; }Ne(l,30); Y==1){ E;K; } else c=l.t=0;} Y==1&&h<H -75&&!N(p*77)){ do{ nL(1,l.s,l.c,
|
||||
N(W<<9),H<<9,1,i+
|
||||
1); I[i].d++;
|
||||
}R N(3)
|
||||
|
||||
); K;
|
||||
l.u=c; c=0; } Y
|
||||
==2){ l.s+=l.a+B;
|
||||
l.a= (l.e-l.s)/((H+
|
||||
20-h)|1); l.c+=l.b+D;
|
||||
M(b,l.s>>9,l.c>>9,6); }
|
||||
} L[i]=l; } } F r; } J(){
|
||||
R A) { XFlush(d); v&&sleep(
|
||||
3); Z=++v*10; p=50-v; v%2&&hi
|
||||
((a[A]=N(W-50)+25),50)<0 &&A++;
|
||||
XClearWindow (d,w); for(B=0; B<A;
|
||||
dC(B++)); R Z|dL()){ Z&&!N(p)&&(Z--
|
||||
,nL(1+!N(p),N(W<<9), 0,N(W<<9),H<<9,1
|
||||
,0)); usleep(p*200); XCheckMaskEvent(d,
|
||||
4,&e)&&A&&--S&&nL(4,a[N(A)]<<9,H-10<<9,e.
|
||||
xbutton.x<<9,e.xbutton.y<<9,5,0);}S+=A*100;
|
||||
B=sprintf(m,Q,v,S); XDrawString(d,w
|
||||
,g,W/3,H/2,m,B); } }
|
||||
|
||||
main ()
|
||||
{
|
||||
O i=2;
|
||||
d=XOpenDisplay(0);
|
||||
w=RootWindow(d,0);
|
||||
R i--) XMapWindow(d,w=XCreateSimpleWindow(d,w,0,0,W,H,0,0,0));
|
||||
XSelectInput(d,w,4|1<<15);
|
||||
XMaskEvent(d,1<<15,&e);
|
||||
g=XCreateGC(d,w,829,&G);
|
||||
srandom(time(0));
|
||||
J();
|
||||
puts(m);
|
||||
}
|
||||
|
||||
@@ -0,0 +1,58 @@
|
||||
Best Graphic Game:
|
||||
|
||||
John Williams
|
||||
941 E 25 S
|
||||
Lindon UT 84042
|
||||
USA
|
||||
|
||||
|
||||
Judge's Remarks:
|
||||
|
||||
To build:
|
||||
|
||||
make williams
|
||||
|
||||
Try:
|
||||
|
||||
./williams
|
||||
|
||||
The only way to win is not to play. No, really; you can't actually win.
|
||||
:)
|
||||
|
||||
The formatting really wants a wide screen; if you can't read it that way,
|
||||
it's the standard "three triangles around a circular" logo for nukes.
|
||||
|
||||
This is a pretty straightforward game.
|
||||
|
||||
|
||||
Selected Author's Comments:
|
||||
|
||||
What this program does:
|
||||
|
||||
It plays Missile Command, complete with MIRVs, smart bombs,
|
||||
extra cities, and scoring.
|
||||
|
||||
Command line arguments and input files are ignored.
|
||||
|
||||
To play, just point and click where you want your ABMs to explode.
|
||||
|
||||
The score is 10 points for each missile which is destroyed before
|
||||
it reaches the ground, -1 point for each ABM used, and 100 bonus
|
||||
points for each city left at the end of a level.
|
||||
|
||||
The game ends when you lose all your cities, although you will have
|
||||
to wait until the level finishes raining down to see your final score.
|
||||
|
||||
|
||||
|
||||
The main obfuscation technique is the need to compress the code to fit
|
||||
all the functionality within the size limits. I could not have included
|
||||
smart bombs without the rule excluding { } ; characters in the counts.
|
||||
All of the #defines are there to reduce code size.
|
||||
|
||||
On the other hand, I did waste a few characters in order to include
|
||||
some rather obfuscated math in the program. It uses fixed-point
|
||||
arithmetic, resulting in the overuse of bitwise shift operators.
|
||||
Another example is (x|1), which is used in a couple different ways.
|
||||
The purpose of A/(x|1) is probably obvious, but what does (x|1)%2 do?
|
||||
|
||||
Reference in new issue
Block a user