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,93 @@
|
||||
|
||||
int
|
||||
X=320 ,Y=200,
|
||||
n=0,m, x,y, j=1024;
|
||||
double T=44.0 /7,P[
|
||||
333333 ],C[5] ={ 0,3,
|
||||
0,0,8} ,p=1, B=11.0
|
||||
/630, f=0,r = 3,g
|
||||
=7,b =13,*q=P, D,*J;
|
||||
unsigned char
|
||||
U[66666],*v=U,*h,l[5555]
|
||||
,c=0,*e,*a,*z;
|
||||
|
||||
#include <math.h>
|
||||
#define R1(t) t=(int)(t\
|
||||
*123456789 )%j; t/=j;
|
||||
#define Rl(C,t)\
|
||||
n++[C] = t*n/12;
|
||||
#define RI(C) B=-B; R1\
|
||||
(r)R1(g )R1(b )for(n\
|
||||
=0; n<j; ){ Rl(C ,r)Rl\
|
||||
(C,g)Rl(C ,b)++n; }
|
||||
|
||||
|
||||
|
||||
#ifdef __DJGPP__
|
||||
#include <sys/movedata.h>
|
||||
#include <dpmi.h>
|
||||
#include <pc.h>
|
||||
#define Q(u,v) u##portb(0x3##v
|
||||
#define W ; Q(out,C9),*h++/4)
|
||||
void F(int i){ __dpmi_regs r
|
||||
; if(i){ for(; i>=0; i-=8)while(
|
||||
~Q(in,DA)
|
||||
)&8^i); for(m=0,z
|
||||
=h+j; h <z; m ++){ Q(
|
||||
out,C8),m )W W W; ++h; } dosmemput
|
||||
(v,X*Y,0xA0000 ); } else{ r.x.ax=
|
||||
0x13; __dpmi_int( 0x10,&r); } }
|
||||
#elif defined(SDL)
|
||||
#include "SDL/SDL.h"
|
||||
SDL_Surface *s; void
|
||||
F(int i){ if (i){ SDL_SetColors(
|
||||
s,h,0,256); SDL_UpdateRect
|
||||
(s,0,0,0, 0); } else { SDL_Init(
|
||||
SDL_INIT_VIDEO); s=SDL_SetVideoMode
|
||||
(X,Y,8,0); v=s->pixels; } }
|
||||
#else
|
||||
#include "curses.h"
|
||||
void F(i){ if(i){ for(y=0;
|
||||
y<X*Y ; y++)
|
||||
{ move (y/X,y%X); addch
|
||||
((*(v +y)/ 32) [" ."
|
||||
",:+" "=@#" ]); } ; refresh
|
||||
(); } else{ initscr
|
||||
(),x= COLS&~1,X=x<X?x:X,y=
|
||||
LINES &~1,Y=y<Y?y:Y; } }
|
||||
#endif
|
||||
|
||||
main()
|
||||
{
|
||||
F(0);
|
||||
|
||||
for (x=-X/2,y=-Y/2;y<Y/2;++x>=X/2?x=-X/2,y++:4)
|
||||
{*q++ = sqrt(x*x+y*y);
|
||||
|
||||
*q++ = atan2(x,y);
|
||||
|
||||
}for (;n<j*2;l[n++]=0);
|
||||
for(;;)
|
||||
{
|
||||
a=l;z=l+j;e=l+j*2;
|
||||
if ((p+=B)>1){p=2-p;RI(l+j)}
|
||||
else if (p<0){p=-p;RI(l)}
|
||||
|
||||
while(a<l+j) D=p**a+++(1-p)**z++,*e++=D;
|
||||
h=l+j*2;
|
||||
|
||||
for (J=P,z=v; z<v+X*Y;){
|
||||
D = *J++;
|
||||
*z++=fabs(sin((*J+++C[1])*1.5+D*C[0]+C[2]*sin(C[3]+D/C[4]))*255);
|
||||
}F(8);
|
||||
|
||||
C[2]+=B; f+=T/360; C[3]+=f;
|
||||
|
||||
if (f>T)
|
||||
{C[1] += (f-T)/8;
|
||||
|
||||
if (f>T*2)
|
||||
C[0]=sin(f)+sin(f*2)/2;
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,70 @@
|
||||
Most Portable Output:
|
||||
|
||||
Thaddaeus Frogley
|
||||
Creature Labs
|
||||
164 Hornbeams,
|
||||
Harlow, Essex,
|
||||
UK
|
||||
|
||||
Gavin Buttimore
|
||||
Creature Labs
|
||||
9 Elizabeth Way,
|
||||
Cambridge,
|
||||
UK, CB4 1DE
|
||||
|
||||
|
||||
Judges' Comments:
|
||||
|
||||
To build:
|
||||
|
||||
make thadgavin
|
||||
|
||||
To run:
|
||||
|
||||
./thadgavin
|
||||
|
||||
This entry is a nice play by the rules. It can use curses, if the
|
||||
SDL graphic library is not present, and is quite good at that,
|
||||
but the colors used in graphic mode (16 bit depth) are unfortunately
|
||||
less than dazzling. We could not test this entry in DOS mode.
|
||||
|
||||
|
||||
Selected Author's Comments:
|
||||
|
||||
To run under DOS:
|
||||
|
||||
Compile using DJGPP as follows:
|
||||
|
||||
gcc thadgavin.c -o thadgavin.exe -Wall -lm -O6 -mpentium -fomit-frame-pointer
|
||||
-ffast-math
|
||||
|
||||
To run under Windows, X-Windows or MacOS using the
|
||||
Simple DirectMedia Layer:
|
||||
|
||||
For example:
|
||||
|
||||
gcc -O6 -lpthread -g -o thadgavin thadgavin.c -lSDL -DSDL -lm
|
||||
|
||||
|
||||
In gcc you may get the following warning:
|
||||
|
||||
prog.c:46: warning: passing arg 2 of `SDL_SetColors' from incompatible
|
||||
pointer type
|
||||
|
||||
In Microsoft Visual Studio you may get warnings as follows:
|
||||
|
||||
prog.c(46) : warning C4133: 'function' : incompatible types - from 'unsigned
|
||||
char *' to 'struct SDL_Color *'
|
||||
prog.c(63) : warning C4026: function declared with formal parameter list
|
||||
prog.c(77) : warning C4244: '=' : conversion from 'double ' to 'unsigned
|
||||
char ', possible loss of data
|
||||
|
||||
|
||||
But don't worry, this is completely normal.
|
||||
|
||||
Recommended dosage:
|
||||
|
||||
At least 3 minutes taken 3 times a day when tired.
|
||||
|
||||
Do not exceed 3 times recommended dose. May cause
|
||||
sickness, dizziness, nausea.
|
||||
@@ -0,0 +1,101 @@
|
||||
// Initially you will be calm and serene:
|
||||
|
||||
int
|
||||
X=320 ,Y=200,
|
||||
n=0,m, x,y, j=1024;
|
||||
double T=44.0 /7,P[
|
||||
333333 ],C[5] ={ 0,3,
|
||||
0,0,8} ,p=1, B=11.0
|
||||
/630, f=0,r = 3,g
|
||||
=7,b =13,*q=P, D,*J;
|
||||
unsigned char
|
||||
U[66666],*v=U,*h,l[5555]
|
||||
,c=0,*e,*a,*z;
|
||||
|
||||
#include <math.h>
|
||||
#define R1(t) t=(int)(t\
|
||||
*123456789 )%j; t/=j;
|
||||
#define Rl(C,t)\
|
||||
n++[C] = t*n/12;
|
||||
#define RI(C) B=-B; R1\
|
||||
(r)R1(g )R1(b )for(n\
|
||||
=0; n<j; ){ Rl(C ,r)Rl\
|
||||
(C,g)Rl(C ,b)++n; }
|
||||
|
||||
|
||||
// Later your brain will look more like this:
|
||||
|
||||
#ifdef __DJGPP__
|
||||
#include <sys/movedata.h>
|
||||
#include <dpmi.h>
|
||||
#include <pc.h>
|
||||
#define Q(u,v) u##portb(0x3##v
|
||||
#define W ; Q(out,C9),*h++/4)
|
||||
void F(int i){ __dpmi_regs r
|
||||
; if(i){ for(; i>=0; i-=8)while(
|
||||
~Q(in,DA)
|
||||
)&8^i); for(m=0,z
|
||||
=h+j; h <z; m ++){ Q(
|
||||
out,C8),m )W W W; ++h; } dosmemput
|
||||
(v,X*Y,0xA0000 ); } else{ r.x.ax=
|
||||
0x13; __dpmi_int( 0x10,&r); } }
|
||||
#elif defined(SDL)
|
||||
#include "SDL/SDL.h"
|
||||
SDL_Surface *s; void
|
||||
F(int i){ if (i){ SDL_SetColors(
|
||||
s,h,0,256); SDL_UpdateRect
|
||||
(s,0,0,0, 0); } else { SDL_Init(
|
||||
SDL_INIT_VIDEO); s=SDL_SetVideoMode
|
||||
(X,Y,8,0); v=s->pixels; } }
|
||||
#else
|
||||
#include "curses.h"
|
||||
void F(i){ if(i){ for(y=0;
|
||||
y<X*Y ; y++)
|
||||
{ move (y/X,y%X); addch
|
||||
((*(v +y)/ 32) [" ."
|
||||
",:+" "=@#" ]); } ; refresh
|
||||
(); } else{ initscr
|
||||
(),x= COLS&~1,X=x<X?x:X,y=
|
||||
LINES &~1,Y=y<Y?y:Y; } }
|
||||
#endif
|
||||
|
||||
main()
|
||||
{
|
||||
F(0);
|
||||
|
||||
for (x=-X/2,y=-Y/2;y<Y/2;++x>=X/2?x=-X/2,y++:4)
|
||||
{*q++ = sqrt(x*x+y*y);
|
||||
|
||||
// store result of atan2 of x and y in *q++
|
||||
*q++ = atan2(x,y);
|
||||
|
||||
}for (;n<j*2;l[n++]=0);
|
||||
for(;;)
|
||||
{
|
||||
a=l;z=l+j;e=l+j*2;
|
||||
if ((p+=B)>1){p=2-p;RI(l+j)}
|
||||
else if (p<0){p=-p;RI(l)}
|
||||
|
||||
// will the maintenance programmer get this?
|
||||
while(a<l+j) D=p**a+++(1-p)**z++,*e++=D;
|
||||
h=l+j*2;
|
||||
|
||||
// best way?
|
||||
for (J=P,z=v; z<v+X*Y;){
|
||||
D = *J++;
|
||||
*z++=fabs(sin((*J+++C[1])*1.5+D*C[0]+C[2]*sin(C[3]+D/C[4]))*255);
|
||||
}F(8);
|
||||
|
||||
// tidy up later
|
||||
C[2]+=B; f+=T/360; C[3]+=f;
|
||||
|
||||
// just in case
|
||||
if (f>T)
|
||||
{C[1] += (f-T)/8;
|
||||
|
||||
// sorry
|
||||
if (f>T*2)
|
||||
C[0]=sin(f)+sin(f*2)/2;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user