Files
Landon Curt Noll 09750f8899 release winning entries of IOCCC28 under the year 2024
Congratulations to:

* 2024/anders - Prize in sound coding - layered music generator
* 2024/burton - Prize in pentagrammatology - wordle hard mode solver
* 2024/cable1 - Prize in bot talk - LLM inference engine
* 2024/cable2 - Prize in murky waters - salmon recipe
* 2024/carlini - Prize in perfect timing - Intel 4004 emulation
* 2024/codemeow - Prize in tray planting - bonsai generator
* 2024/endoh1 - Prize in patient pointillism - slow ray tracer in CPP
* 2024/endoh2 - Prize in solid body physics - rotating rigid body simulation
* 2024/ferguson1 - Prize in diabolical logistics - Oregon trail pact with the devil
* 2024/ferguson2 - Prize in yil-tas - Navajo code talker translator
* 2024/howe - Nice accent eh-ward - mini vi
* 2024/kramer - Prize in linguistic arithmetic - natural language numerical calculator
* 2024/kurdyukov1 - Prize in phased periodicity - phase of the Moon
* 2024/kurdyukov2 - Prize in art restoration - JPEG artifact removal
* 2024/kurdyukov3 - Prize in virtual quietus - gaming VM and doom
* 2024/kurdyukov4 - Prize in embiggening - encode without literals
* 2024/maffiodo - Prize in creative interpretation - Jav\*script interpreter
* 2024/mills - Prize in ℤ₃ - Infocom v3 story interpreter
* 2024/stedolan - Best one liner - icon from MD5
* 2024/straadt - Prize in imitative rebooting - OpenRISC CPU and Linux
* 2024/tmarrec - Prize in cyclonic coding - 3D tornado simulation
* 2024/tompng - Prize in quasi bijection - vortex encryptor decryptor
* 2024/weaver - Sur prize - rickroll

Ran `make update` to perform the above.
 	new file:   2024/burton/.entry.json
2025-08-02 14:43:07 -07:00

33 lines
1.7 KiB
C

#include <stdio.h>
#include <math.h>
#define o(x,o)x##o
char X[
1<<16
][4],Z[1<<20],*N= X[1]
,*P=Z,*H,A[12];char*C(int i,o(u
,nsigned) x){char*B =0,*
D;if((x >>16)|| 0==*
(B=X[x ])){int a,b =(sqrt (x)+
0.5), c=x-b*b;D=C(0,65535 &b);o (spr
,intf )(A,"%s" "*%s%c%" "s",D ,D,c
?c<0 ?45:43 :0,C(0 ,c<0? -c:c
));B =B?a= *N,b= N[1], c=N[2 ],*B
=a+!b -90?a =='z'?65:a+ 1:(b ='z' -b?b
-90? b%64+ 65:97 :(c=- ~c|96 ,65) ,~b%
56%47 ?97: 'j') ,B[1 ]=b, B[2] =c,o
(prin ,tf) (",%" "s=%s" ,B,A) ,(N= B):A
;;}o( ret, urn) i>0 ?P+=o (spr ,intf
)(P, ",%s" ,B):B ;}int main (){;
;int a,i= **X=Z[1 ]='a',c ,n=0; *X[1]
=98; for( printf("#inclu" "de " "<st"
"dio" ".h>" "\nint" " a;i" "nt"
" ma" "in()" "{int" " b="
"-~a") ;i>3&&P- Z+33<1<< 20;C(
i,a)) for(a=i=0;i<4&&0<=(c= o(get,
char)( ));n++)((char *)&a)[
i++]=c; H=P;C(1
,n);*H++= 0;printf(
",Z[]={%s};fwrite(Z,b,%s,std"
"out);}\n",Z+1,H);}