#/*void*/include<math.h> #include/*#pragma _Atomic int*/<stdio.h> /* { */struct{ int o,s; } typedef V ; struct{ int x; V o,i,p; }typedef R; int d,w,a,i,b, u,g,n,j,F,h; R*Q,B [99],*E=B ; V I(int s ){ V o={ d,s} ; d +=s; return #define O ; { } } if(! n --) { { { ; } } o; } float*p,ll=1,* q, *e,s,*r,*G,*W,y=1, # define _ V i ){ V o= I(i .s); * E++=( R) { *x,l,*z,m; V A(V p,_ 4,o ,p,i} ; return o; } V X,Y; double drand48(); V C (V i,V o){ *E++=(R) #define OO ){ P(Q->o,a=Q->i. o-n; b=Q->p .o-n\ ; r=b+W+n){ { n=Q->x O//struct volatile union { { 3,o,i} ; return o; } unsigned char c[256],t[ sizeof c+N]; V M(V p,_ 5,o,p,i} ; return o ; } struct{ float r ; short k ,p; char unsigned d[ sizeof c]; } k={ LR} ; V S(_ 2,o,i} ; return o ; } void Z(float*p,int n){ while(n--) *p++=0; } V L(int s,V i){ V o=I(s),p={ w,s+i.s*s } ; w+=p #define P(v,i)n=v.o; e=G+n; p=e+v.s; q= p+d; i\ ; while(--q,p-->e)// _Alignas _Imaginary _Bool; .s; *E++=(R){0,o,i,p}; return o; } V CM(V i){ V o=I(a=i.s),p={ w,a} ; w+=a; *E++=(R){ 7, o,i, p} ; return o; } void J(int c){ Z(e=G+X.o, X.s) ; c[e]++ ; for(Q=B; Q<E; ++Q OO*p=*r++; n=Q ->i .s; while(n--)*p+=*r++*e[a+n]O*p=tanh(a[p]) O*p =1/(exp(-a[p])+1)O p[a+u]=*p O*p=p[a]+b[p]O* p= a[p]*p[b]O*p=a[p ]*Q->p.s+Q->p.o O*p=a[p]**r ++ ; } } } Z(G+d,d); P(Y,m=*e)m=fmax(m,*p); P(Y, s =0)s+=*q=exp((*p-m)/TP); P(Y, )*q/=s; } V T(_ 1 ,o,i}; return o; } int K(int K ){ J(K); P(Y,s = drand48( ))if((s-=*q)<0)break; return j=p-e; } V OG(int a,int b,_ 6,o,(V){ b,a} } ; return o; } void D(char unsigned*s){ float V[2*d]; int R =u; u=V-G; J(c[*s++ ]); n=c[*s]; l-=log(n[++q] --)/N; G+=u; p=d+G; if(1[s])D(s); else while(p -->G){ p[x-G]=*p; d[p]=0; } G-=u; Q=E; while(F <i&&Q-->B OO r++[w ]+=*q; n=Q->i .s; z=e+a +n; while(n--){ w[r ]+=*q**--z; d[z]+=*q**r++; } O a[q]+=*q*(1-*p**p)O q[a]+=*q*(1-*p)**p O*q+=q [ a+u]O a[q]+=*q; q[b]+=*q O q[a]+=b[p]**q; b[q ] +=p[a ]**q O a[q ]+=Q->p.s**q O a[q ]+=*q**r; r ++[w]+=*q**p; } } } u=R; } V MD( V x){ V BK; // return y; } int main(int Q,char**E){ FILE*f, *o =stdin; if(--Q){ o=fopen(2[E],"r"); f=fopen (1[ E],"r"); while(w>-(n=getc(f))){ ++h; if(!n[ t]) { n[t]++; k.d[k.k]=n; n[c]=k .k++; } } } o &&f\ read(&k,sizeof k,1,o); n=k.k; { V NW; X=x ; Y= y; } float R[d+d],B[4*w],q[d*2]; G=x=R; W =B; Z (W,4*w); p=W+w; while(p-->W)*p=2*drand48 ()*RS- RS; o&&fread(W,1,sizeof B,o); Z(G,d); h /=N; i= h*TR; h-=i; for(t[1+N]=m; Q; fclose(o) ){ rewi\ nd(f ); while(fread(t,1 +N,1,f) ){ G= q; p=d+G; while(p-->G)*p=p[x-G]; D(t); ungetc (j=N[t],f) ; if(F++<i){ a=w*3; b=a- w; p=W+w; while(p-->W ){ m=fmax(-CL,fmin(CL,w[p ])); ll *=B1; p[a]=m+ (a[p]-m)*B1; y*=B2; m*=m; b[p]= m+(p[b]-m)*B2; *p+=(a[p]/sqrt(p[b]/(1-y)+EP)/ (ll-1)+WD**p)*k. r; p[w]=0; } if(1>F%DI){ G=R ; z=SL+W; while(z -->B)putchar(k.d[K(j)]); } } if(1>F%DI ){ b=F; a=i; j=b>a; if(j){ b-=a; a= h; } printf(&j[//; "\n%c%d:%d%% %f\n"],j[ "TV"],k.p,100*b/a,l/b ); } l*=F!=i; } /** */ char p[999]; if(LE <=++k .p)k.r*=LD; /*if*/ sprintf(p,PF,k.p ,l/h); fwrite( &k,sizeof k, 1,o =fopen(p, "w")); F=l =0; fwrite(B,w,/** */sizeof* W,o); } while(putchar(k.d[K(j)]) ){ } } /* typedef volatile long double not ; register restrict unsigned volatile void _Complex struct bitand*/

引用元：https://www.ioccc.org/2019/mills/prog.c

審査員・作者による説明：https://www.ioccc.org/2019/mills/hint.html

動作

回帰型ニューラルネットワーク（RNN）で、学習した文書っぽい文書を自動生成する。

LSTMやGRUなど、RNNの派生版をマクロで生成できる。 次は2段階LSTMの例らしい。

$ gcc -DRS=.15 -DTR=.95 -DLR=.002 -DLD=.97 -DLE=10 -DCL=5 -DB1=.9 -DB2=.999 -DEP=1e-8 -DWD=8e-5 -DDI=100 -DSL=200 -DN=50 -DTP=1 -DPF='"cp%02d_%.3f"' -DHS=128 -DBK='cp = I(HS), hp = I(HS), t1 = L(HS, x), f = S(A(t1, L(HS, hp))), t2 = L(HS, x), i = S(A(t2, L(HS, hp))), t3 = L(HS, x), cn = T(A(t3, L(HS, hp))), t4 = M(f, cp), c = C(cp, A(t4, M(i, cn))), t5 = L(HS, x), o = S(A(t5, L(HS, hp))), h = C(hp, M(o, T(c))), y = h' -DNW='x = I(n), y = L(n, MD(MD(x)))' -o lstm2 prog.c -lm

IOCCCのルールやガイドラインっぽいテキストを生成する例。

$ ./lstm2 < IOCCC-Rules-Guidelines.cp98_0.175 | head -n 30
 compiler octet to make sime, pre, and then Bird and interesting the following address:

|       q.2018@ioccc.org       (for questions only!)

|   You must use such in order to needed to confusiated to postions of the same program, one that is a compact blob
    of code, and the other that is formatted more like a typical C
    program, we tend to favor the second version.  Of course, a third
    version of the same program that is formatted in an interesting
    and/or obfuscated way, would definitely win over the first two!
    Remember, you can ters are portable and usable from within a master
        * reading the "how to build" information and forming a Makefile
        * reading prog.c, the C source
        * reviewing the "remarks" information
        * briefly looking any any supplied data files
        * passing the source thru the C pre-processor
            skipping over any #include files
        * compiling/building the source
        * running the program
        * Doing other things that only IOCCC judges know about :-)

    In later rounds, other remarks file.

    People who are considering to just use some complex mathematical
    function or state machine to spell out something such as "hello,
    world!" really really, and we do mean really, do need to be more creative.

    Ultra-obfuscated programs are, in some cases, easier to
    deobfuscate than subtly-obfuscated programs.  Consider using
    misleading or subtle tricks layered on top of or under an
    appropriate level of obfuscation.  A clean looking program with

解説

OMLET（Obfuscated Machine Learning Environment Toolkit）という名前をついている。 詳しいことは見ていない。 コード形状が何を表現しているのかもわかっていない。 hint.textはそれなりに長いが、コードについての説明はなさそう。