restore *.orig.c to each entry
Under each yyyy/dir there is a file of the form '*.orig.c' containing the original source code, or as close as we can get to the original source code.
This commit is contained in:
1 parent
cfd253683f
commit
2ba12ecc3c
320 files changed
+21365
No files matched your search
@@ -0,0 +1,110 @@
|
||||
#include<stdio.h>
|
||||
#include<setjmp.h>
|
||||
#define R return
|
||||
#define W(x)for(;x;)
|
||||
#define I typedef
|
||||
#define H unsigned
|
||||
I jmp_buf J;
|
||||
I void P;
|
||||
I char L;
|
||||
I int Q;
|
||||
I H C;
|
||||
I long long V;
|
||||
I H char O;
|
||||
I H short Y;
|
||||
I H long long Z;
|
||||
|
||||
O S[]="syntax_error!"
|
||||
"M@K~|JOEF\\^~_NHI]"; L*N,*K,*
|
||||
B,*E,*T,*A,*x,D,v; Q(*k)(); V z(P),j,_,*
|
||||
o,b,f,u,s,c,a,t,e,d; J l; Q _k(P){ R*K?*K++:
|
||||
~-d; } V r(L a){ R a&&putchar(a); } L n(){ R*T=j=
|
||||
k(),++j; } O G(P){ *o=d,longjmp(l,b); } Z g(Y a){ R a
|
||||
>>s|(a&~-e)<<s;} C p(L*T) { W(r(*T++)); *--T-c&&r(c);} L m
|
||||
(P){ W(!((v=A[*T++])-f)); R v; } P q(L**N) { O*q; b=!b; f=-~b;
|
||||
u=f|b; s=b<<u; c=s|f; a=s<<f; t=-~u; e=a
|
||||
<<u; D=v=u<<t;q=S +c-~t; q[~s]=a;
|
||||
q--[f]+=a;q--[c ]+=a; B=(L*)
|
||||
N+~e*e;x=B+e ; A=B+e/f;
|
||||
o=(V*)(x+a ); A[-
|
||||
~s]=f; T =K =A-
|
||||
a*f;A[*-- q]=c+
|
||||
c; *q=! c; W
|
||||
(++j&&* ++q)
|
||||
A[*q-a ]=j;
|
||||
W(v<D +c)
|
||||
x[v- D]=
|
||||
v,A[ v++
|
||||
]=j; ++j
|
||||
,v= D=e/
|
||||
t; W(++
|
||||
v<= D+f*
|
||||
u)x [v-D+~
|
||||
-c]= v|a,A[
|
||||
v]=A [v|a]=j;
|
||||
W(( A[v]=A[v|a
|
||||
]=j ,++v<a*u+~t));
|
||||
for( ; E=*++N;T[~d]
|
||||
=a)W (*T++=*E++);k=
|
||||
T
|
||||
-K?_k:
|
||||
getchar; } Z h
|
||||
(C a){ R(g(a)<<s*
|
||||
f)+g(a>>s*f); } P _i (L*T)
|
||||
{ *o||p(T); } V _b(V a ){ Z e=a
|
||||
; R A[*T++]!=v+c?G():~-v ?a<<z():c-A
|
||||
[*T++]+b ?--T,a>> z():e>>z();}
|
||||
V _c(L* l){ T=B +a; W(j)*T--
|
||||
=v+j%c ,j/=c; E=B+ (*B==
|
||||
a+c+u );W(T< B+a)*
|
||||
E++=* ++T; T =E ;
|
||||
l-B&& ++ *-- E; }
|
||||
P M( Z k){ L*p,e
|
||||
=a>> u; m ()&&G(
|
||||
); p =T=B ; _=j=k
|
||||
; v=u <<t,* T=a; j<d
|
||||
&&(*T+++=c+u,j=j==-j?++p,--j:-j);!j?*T++=
|
||||
v:_c(p); *T++=-~s; *T++=v;*T++=a*t-s; p=T
|
||||
; E=T+=s*f; W(k)*T--=x[k&~-a/f],k>>=e; W(T
|
||||
-e*f>p)*T--=v; W(T<E)*p++=*++T; *p=d;} P U
|
||||
(L*E){ V*N=o,f; *E=f=d; W(++f<c*u-u)*++N
|
||||
&&(M(*N),r(f+a*u),r(-~s),p(B),*(T=E)=d)
|
||||
; } V w(P){ L*S=N,*x=N; E=T=B; E+=a
|
||||
<<f;
|
||||
W(T
|
||||
<E
|
||||
|
||||
&&n( ))*
|
||||
T==a -~u
|
||||
?U(T),T:*T==c?E=S?T=S:T:S?T:*T==(a|u)?S=T:*T==a*f-c/f?E=T:!x&&A[*T]!=f?x=T++:
|
||||
++T; *T=d;R j&&!x?w():T-B; } P _d(V e){ L T=c*f-f;V o=j*e+v; D=d; A[v]==T++?D
|
||||
=u<<t:e>c&&A[v]==T++&&(v|a)-a*-~f<~-s?D=b+(v&a)+a*f-c:d; D&&(j=o-D); }V y(P){
|
||||
V a=z();W(m()&&v<c+f&&(v-=u<<b)>=d)v?v-b?v-f?v-u?v-=t,a=_b(a):(a&=z()):(a%=z(
|
||||
)):(a/=z()):(a*=z()); R--T,a;} V _f(P){ V e=c; j=d; D=b; *T==u<<t&&(e-=f)&&(*
|
||||
++T|a)>>f==a-f&&(e<<=b)&&T++; W(D&&(v=*T++))_d(e); R--T,j; } V F(P){ V n=y();
|
||||
W(m()&&v<u*f)v<t?n+=(v-f)*y():v-b^t?n^=y():(n|=y()); R--T,n; } V i(Z n){R n>>
|
||||
a/f?
|
||||
n>>a
|
||||
?h(n)<<a|h(n>>a
|
||||
):h(n):g(n); } Q main(Q x
|
||||
,L**K){ V*A; q(K); W(w())**
|
||||
K-c*c-b||p(B),_i(!setjmp(l)?T=B
|
||||
,M(((A=(*o=m()==c-~s&&(j=a|T[-b])&&
|
||||
s-m()==~s)?&o[j-a*u]:(T=B,&_)),*A=F())
|
||||
),B:(L*)S); } V z(P){ V
|
||||
s; W(m() &&v<=f*c
|
||||
)R v<t ?(v-f)*
|
||||
z():( v-=u<<
|
||||
f)<f ?v?--v
|
||||
?G() : i(z(
|
||||
)):~ z( ):
|
||||
(v-= f) <u
|
||||
?v?s = F()
|
||||
,m() ==a>>
|
||||
b?s :G ():
|
||||
_:! (v-=
|
||||
t)? --T,_f
|
||||
(): v-f?o[
|
||||
(T[ -b]|a)-
|
||||
a*u]: !z();
|
||||
G(); }
|
||||
@@ -0,0 +1,56 @@
|
||||
#define So long
|
||||
#define R rand()
|
||||
#include <math.h>
|
||||
#include <X11/Xlib.h>
|
||||
#define T(i,F) ((So long)(i)<<F)
|
||||
#define O(c,L,i) c*sin(i)+L*cos(i)
|
||||
#define y(n,L) for(n=0; n<L 3; n++)
|
||||
#define P(v,L) d=0; y(l,)d+=T(L*l[v],l*20);
|
||||
#define X(q) q>>10&63|q>>24&4032|q>>38&258048
|
||||
char J[1<<18]; int G[W*p],_,k,I=W/4+1,w=p/4+1; float C,B,e;
|
||||
|
||||
unsigned So long A,n,d, t,h,x, f,o,r,a,l,L,F,i,s,H=1<<18,b=250,D[1<<14],z[W*p],q
|
||||
=0x820008202625a0;main(){Display *j=XOpenDisplay(0);Window u=XCreateSimpleWindow
|
||||
(j,RootWindow(j,0),0,0,W,p,1,0,0);XImage *Y=XCreateImage(j,DefaultVisual(j,0),24
|
||||
,2,0,(char*)G,W,p,32,0); XEvent M; for(XMapWindow(j,u); XSelectInput( j,u,1)&&a-
|
||||
65307; ){ if(!H){ if(XCheckWindowEvent(j,u,1,&M)){ a=XLookupKeysym(&M.xkey,0);*(
|
||||
a&1?&C:& B)-=(.05
|
||||
-a/2% 2* .1)*!(a-
|
||||
1& 4092^ 3920);a+
|
||||
2&0xfe0^ 0xfc0||(
|
||||
s=a+2&31 ); }else
|
||||
{ y(k,p+ ){ F=k%w* 4|k/w; float a[6],S=(F-p /2.) /p;
|
||||
y(_,W+){ i=_%I*4|_/I; if( F<p&i<W){ o=1; L= i+F*W;if
|
||||
(l=i&3); else{ l=F&3; o=W ; } h=z[L-o*l]; f =z[L+(4-
|
||||
l)*o]; t =F-p/2||i-W/2; r =h^f; if(!l| !t|( int)r|(!
|
||||
(h- 3&3) &&258063&r>>38)) { float V=(i-W/2. )/p,U=O(
|
||||
S,1,B),m =32768,Q=m; a[4] =O(-1,S,B); a[3]= O(U,V,C)
|
||||
; a[5]=O (-V,U,C); P((a+3 ),s*42); t||(A=d) ;f=0;y(n
|
||||
,){float N=a[n+3], E=1024 /fabs(N); b= N<0; float K=
|
||||
(((q>>20 *n)^~-b)+!b&1023 )/1024.; y(d,)a[d ]=a[d+3]
|
||||
*E; a[n] =round(a[n]); P( a,K); i=q+d; P(a, 1); e=E*
|
||||
K; for(; e<m; i+=d){ l=X(i); t=r=l^(l^l-( 1<<6*n))
|
||||
&63<<6*n ; if(b){ r=l; l=t; } if(J[r])l=r ; if(t=J
|
||||
[l]){x=( n-1)?(i|i>>40)&1023|i>>8&4190208 |4194304
|
||||
:i&1023| i>>28&4190208|(b^l==r)<<23; if(h =D[(x>>6
|
||||
&0xf|x>> 14&0x3f0)+t*768]){ o=h; f=n|l*4| x<<32; m
|
||||
=e; } if (t==8&e<Q)Q=e; } e+=E; } }b=(255 -((f&3)+
|
||||
2)%3*51) *(1-m/32768); o=o*b>>8; G[L]=o>> 32<<8|o&
|
||||
16711935 ; z[L]=3*(Q<=m)|f|b<<56; } else{ d=l*(f<<
|
||||
8>>40)+( 4-l)*(h<<8>>40)>>2&16774143; o=D [(d>> 6&
|
||||
15|d>>14 &1008)+J[(int)h/4]*768]*(b=h>>56 )>>8; G[
|
||||
L]=o>>32 <<8 | o& 16711935 ; z[L]=(
|
||||
int) h|d <<32|b<< 56; } }} } q +=A;
|
||||
XPutImage (j, u+0, DefaultGC (j,J[X(q
|
||||
)]=0),Y, 0,0,0,0, W,p); }} else{ L=
|
||||
--H/768; J[H] =R% 16*(R%4< abs((H>>
|
||||
6&63)-32 )+abs((H
|
||||
>>12&63) -32)-3);
|
||||
i=H &15; F=H %768
|
||||
>>4; if( L<16){if
|
||||
(L-1|!(R %3))b=R%
|
||||
96^255; l=i*i*3+i*81/4&3; a=L>3?L-8?L-5?9858122:12365733-488848*((i+F/4*4)%8&&F%
|
||||
4):R%2*5298487:3352537*L*L-14202379*L+19205553; if(L==4)if(F<l+18)a=6990400;else
|
||||
if(l>F-19)b*=0.7; if(L==3){ if((i-1&15)<14&(F-1&15)<14&!(F&16)){ a=12359778; _=7
|
||||
-i; k=7-F%16; _^=_>>31; k^=k>>31; b=196-R%32+(k>_?k:_)%3*42;} else{ b*=1+R%2*(.5
|
||||
-(i&1)); } } D[H]=(a&16711935|(a&65280)<<24)*(b>>(F>>5))>>8&0xff00ff00ff; } } }}
|
||||
@@ -0,0 +1,55 @@
|
||||
#include <sys/ioctl.h>
|
||||
#include <unistd.h>
|
||||
#include <string.h>
|
||||
#include <signal.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#define O_o "sfX4.Fv8H!`uf"\
|
||||
"|~0y'vWtA@:LcO9d}y.!uL!Gd+ml(<+Ds!J"\
|
||||
"e.6!r!%l6G!n~^<i=%pEwL%P!'<!FQt%u 5toG57j/3"\
|
||||
"!:E%;!ea!!!WqE0z!f/y}!%!!Qi6!uzt!n}?]!bl!ak!SetR<"\
|
||||
"Zj$x!~V!n&g8!cK! KrgR'8@c]!%-q9V.3fa[E8X%dY'w!#H <P~6"\
|
||||
"?guhljL!^P% ?" "8!@dP,!!o+fb"\
|
||||
"!pv!;!Hm%Ro4" "n:}nkD!Q!kN"\
|
||||
"e:| 'b5sc!e" /* nothing */
|
||||
#define mu(a) a a a a a //-
|
||||
#define O_(Q_ ) "\033[" #Q_
|
||||
#define Q_(O) mu(mu(mu(O)))
|
||||
#define Q/*-- ++--*/O9--||(
|
||||
#define main( )main(){/**/\
|
||||
signal(13,1), _();}f()//--+
|
||||
#define k( k) getenv( "D"#k
|
||||
char*O0=O_o,OO,*Q1,O5[97];int*Q5,_Q=0,Q0=0,_O=0,_0=0,O=5,QQ,O6,Q6,O3
|
||||
,Q4,O4=41088,O1=sizeof(O5),O7=234;long long __;_()Q_({)int*Q3,Q2,O2,OQ
|
||||
,QO, O9=O,O8=!!/*OQ*/k(RAFT));long long Q8;char*Q9=O_(1A)O_(%dB)O_(%dC
|
||||
)O_(34m)"\xe2%c%c\r\n"O_(0m)O_(%dA),*Q7;__+=(__*92+*O0-35-__)*(QO=Q_(!
|
||||
!)(*O0-33)*!O9--),O0+=O1*QO,QO&&_(),Q Q4&&(O--,_(),O0+=194,O++,Q4--,_(
|
||||
))),Q O=0,__=0,_(),O=3,_()),Q __&&(_O+=((OQ=__&15)<2)*12+!(QO=OQ&14^2)
|
||||
*(4-_O)+(OQ==6)*(12-2*_O)+(OQ>6)*(9-(OQ-7)%3),_Q+=!QO*(_Q%QQ+(OQ&1)*O3
|
||||
-_Q),_0+=!_0*!QO+(1-2*_0)*!(OQ^4),(OQ==5)&&(__>>=4,Q8=__,Q7 =O0,Q4=__&
|
||||
15,O =1,_()|++O&_ (),O0 =Q7,__= Q8), Q3 =( Q2=(
|
||||
_Q+= (lrand48() <O4*O1*9) *O8+ (OQ> 5)*((
|
||||
(2<( _O%=8)%6) -(_O%7< 2))*QQ+( (_O +7)%8<
|
||||
3)-( _O>4)))/ O3 )* O6+Q5+(O2= _Q %QQ)/2,
|
||||
*Q3= *Q3 %O4+ O4 |(1<< Q_("@CADBE" "HI")[_Q
|
||||
%O3/ QQ*2+_Q %2]- 64) *_0,sprintf (O5,Q9,Q2
|
||||
+=1, O2 /2,* Q3>> 8,* Q3&85*3,Q2) &&_0&&(Q1
|
||||
=O5, O =8,_() ), Q0+=( O2>Q0)*_0*( O2-Q0 ),
|
||||
__+= (OQ>12)* (((__ +=!(OQ>9)* (3 -__+(__
|
||||
>>4) )-3)<<4)+ OQ-3-__ ),usleep (O4 *_0/(3
|
||||
*O8+ 1)), O=3,_())) ,!O9 --&& read(
|
||||
1 ,& OO,1)> 0&&(O= (QO=OO ==35 )*3+6 ,_()
|
||||
,QO&&(OO=10,O=6,_(),1)||(O=4,_()),0)||close(dup2(3-dup2(1,dup(0)-3),1)
|
||||
*0+2)*0||Q write(1,"> ",2),ioctl(Q0=0,TIOCGWINSZ,O5)^--O&(O3=(QQ=(O6=*
|
||||
((short*)O5+1))*2)*4),Q6=-O1,Q5=calloc(3*O6,8),_()),Q (O=8,QO=!(O2=OO-
|
||||
10)|!(Q2=OO-32)*(Q0+58>QQ)|(Q0+12>QQ))&&(Q1=O_(3B),_(),write(1,"> ",2)
|
||||
),Q0+=!QO*!Q2*4-QO*Q0,O2*Q2&&(!Q0&&(memset(Q5,0,3*O3),Q0=4,Q1="\n\n\n"
|
||||
O_(3A),_()),O=7,_Q=7*QQ+Q0+2,_O=_0=0,OO+=(OO>64 &OO<91)*32,O0=Q_(O_o)+
|
||||
O7,_(),(*O0-OO)||(O=2,O0+='a',_( )))),Q *O0-OO)&&(*(O0+=O1)-33)&&(O=0,
|
||||
_(),O=7,O0+=O1,_()),Q write(0,Q1,strlen(Q1))),Q OO=Q_(O_o)[Q6+=O1],(Q6
|
||||
%strlen(O_o)-O7)&&(O=6,_(),O=9,_()));Q_(})/*+++++ IOCCC 2015 +++++*/
|
||||
|
||||
main()
|
||||
{
|
||||
puts("hello world!");
|
||||
}
|
||||
@@ -0,0 +1,53 @@
|
||||
#define/**/Alan/**/(fflush(0),j=c=0;++c<b[6]+7;v=b[c]^(b[c+
|
||||
char*H="close\r\nContent-Type:text/html\r\n\r\n<canvas id=\
|
||||
'c'width='128'height='128'style='width:256px;height:256px'\
|
||||
><script>x=y=-1;v=window.c;v.onmousemove=function(e){x=e.p\
|
||||
ageX-v.offsetLeft;y=e. pageY-v.offsetTop};w=\
|
||||
new WebSocket('ws'+ location.href.subs\
|
||||
tr(4));w.binary" "Type='arraybuff\
|
||||
er';w.onmess" "age=function(\
|
||||
e){c=v.getC" "ontext('2d')\
|
||||
;b=c.crea" "teI" "mageData(12\
|
||||
8,128);u= new Uint8Array(d=e. data);b.dat\
|
||||
a.set(u) ;c.putImageData(b,0,0) ;u[0]=x/2;\
|
||||
u[1]=y/2 ;w.send(d.slice(0,x<0?0: 2));x=y=-\
|
||||
1}</scr" "ipt>",b[9999];float*e,d[ 65536],u,v
|
||||
,lu,lv, z;void*f;typedef unsigned long long
|
||||
l;l*p,t[ 99]={0x67452301,0xEFCDAB89, 0x98BADCFE
|
||||
,308438* 881,3285377520 },i,j,k ,n,m[204];
|
||||
#include /*io*/ <stdio.h> /*turing*/
|
||||
void s(){ ; for( k =0;k++<7 * 2 *9;)for(i=
|
||||
0;++i<127; ) e=d + i* 4 +512*k,1[e] +=(i-u)*(i
|
||||
-u)+(k-v)* (k- v )<20?*e+=UV_DROP:0;}l*q= m, g=1LL<<32;
|
||||
l(h)(l v,l (a)){ return(v<<a)|(v%g>>(32-a ) );}int main
|
||||
(int c/*ha r*/, char**y){for(e=d;fgets(b ,m[97]=480,\
|
||||
stdin)&&*b >31; )for( i=j=0;n=b[i],i<18 ? (l)"sec-webs\
|
||||
ocket-key: "[i] ==(n|32):n-32? m[j/4] |=(j< 24?n:(l)
|
||||
"258EAFA5-" "E914-47DA-95CA-C5AB0DC85B" "11\x80"[j-24])
|
||||
<<(3-j%4)*8 ,++j<61:1;)i++;for(j=3;--j; ){for(i=4;++i<74
|
||||
;)i>9?p=q+i- 2 ,p[8]=h(p[5 ]^*p^p[-6]^p[-8]
|
||||
#define/*hah aha <--mouth*/ laplacian(u)l##u
|
||||
,1):(t[i]=t[9 -i] );for(p=t+7 ,i=-1;++i<82;k
|
||||
=*p++,p[2]=h(p[1],5) +p[-3]+n+ (i/+ 20%2?*p^k^p[-
|
||||
2]:(*p&k)|((i< 20?~*p:*p|k)&p [-2 ]))+*q++,t[+
|
||||
81-i]+=(i>76)* (* p= h(* p,30*(i<80)
|
||||
)))for(;n-k;n=((( 1LL +(9<<i/20
|
||||
)/8)<<60)/k+k)/2) k=n ;} for (i =0;i<57;
|
||||
i++)i<30?q[i%5* 16/ 3+ i/5] |=t[i%5]%g<<4
|
||||
>>(30+i%5%3*2-i/5 *6)& 63,0 :(n =*q++,b[i-30]=
|
||||
n<62?n-37+"fl!" [n /26]:n *4- 205);for(prin\
|
||||
tf("HTTP/1.1 "/* | */"%d " "OK\r\nConnecti\
|
||||
on:%s%.27s=\r\n\r\n" ,101 +99*! *m,!*m?H:"upgrade\
|
||||
\r\nUpgrade:webso" "c" "ket\r\nSec-WebSocket-Acce\
|
||||
pt:",b);e-d<65536 ; e+= 4)e[1]=(*e=UV_BACKGROUND);for
|
||||
(;*m;c=0){for(f= c< 2 ?0:fopen(y[1],"r");f&&fscanf(f,
|
||||
"%f,%f,",&u,&v)>0;)s ();for(;j<SPEED*4;j+=2)for(i=0;i<
|
||||
63504;e+=5-j%4*2,z= TIMESTEP,*e=u+z*(elta_u),e[1]=v+z*
|
||||
(elta_v),i+=4)for(c= 0;c+2;u=v,v=e[4],lu=lv,lv=e[-508]+*e+
|
||||
e[8]+e[516]-v*4)e=d+i+512+i/504*8+j%4-c--;for(;n=c%4,65544>
|
||||
c;c++)putchar(c>7?n>2||(u=d[c-n-7]*4*(n<2?!n?RGB))>255?255:
|
||||
#define/*x*/Turing(x)4]=getchar()&127))u=v;if(b[6]>1)s();}}
|
||||
u<0?0:u:c<0?124-c*3:c==5);/* -- The word "genius" is */ for
|
||||
|
||||
|
||||
Alan Turing (1912--1954)
|
||||
@@ -0,0 +1 @@
|
||||
int main(){ printf("");{char*p,s[999]="int main(){ printf(~~);{char*p,s[999]=~%s~,*q=s,c;for(p=62**~~+q;q<s+435;c=q-s>*~s~||c>8?*p++=c-35?*~}~<c?34:c:92:0,p[*~~]=0)c=*q++;*p=2+*~~;printf(s+62**~~,s);}return(*~#0_HH_ee_ll_ll_oo_,,_ _ww_oo_rr_ll_dd_!!#n~); }",*q=s,c;for(p=62**""+q;q<s+435;c=q-s>*"s"||c>8?*p++=c-35?*"}"<c?34:c:92:0,p[*""]=0)c=*q++;*p=2+*"";printf(s+62**"",s);}return(*"\0_HH_ee_ll_ll_oo_,,_ _ww_oo_rr_ll_dd_!!\n"); }
|
||||
@@ -0,0 +1,24 @@
|
||||
|
||||
|
||||
#include /*recall-the\ /-good--old-\ /IOCCC-days!\ */<unistd.h>
|
||||
typedef unsigned/*int*/ short U;U(main) [32768],n,r[8]; __attribute__((
|
||||
# define R(x) A(r[ 7-(n >>x& 7)], (n>> x>>3 )%8)
|
||||
#define C(x) (U*) ((/* |IO| -dpd
|
||||
*/char*) main +(x) )/*| |CC| ll*/
|
||||
# define A(v, i)(i ?i<2 ?C(v ):i\
|
||||
-4?v+=2, C(i- 6?v- 2:v+ *C(v -2)) :C(v -=2) :&v)
|
||||
/*lian*/ constructor))U( x)(){for(;;*r+= 2,*r+=!n?_exit( write(2,"Illeg"
|
||||
"al ins" "truction ;-" "(\n",24)),0: n>>8==001?( signed char
|
||||
|
||||
|
||||
|
||||
|
||||
)n*2 :548==n>> 6&&usleep /**/(10
|
||||
)+n% 64== 4?0* write (r[7 /**/],C(
|
||||
*C(* r)), *C(* r+2) )+4: /**/ n>>9
|
||||
==63 &&--r[7-n/ 64%8]?n%+ /**/ 64*-
|
||||
2:0, n>>6 ==47 ?*R( 0):n>>12==1?
|
||||
*R(0 )=*R (+6) :n>> 12==+ 14?*
|
||||
R(0) -=*R(2*3) :0)n=*C(* r);}
|
||||
|
||||
|
||||
@@ -0,0 +1 @@
|
||||
f(y,x){int m,z;for(m=z=1;m*m<=y?z=y%m?z:m:x+1?z<2?x?f(x,0):putchar(64):f(z,x),putchar(x?10:32),y-=z:(f(z,y/z),0);)m++;}main(y){f(y-1,-1);}
|
||||
@@ -0,0 +1,199 @@
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
#define i(Y) X[(int)(Y)]
|
||||
|
||||
typedef/***************/
|
||||
/**/ /**/
|
||||
/**/ volatile /**/
|
||||
/**/ double /**/
|
||||
/**/ /**/
|
||||
/*******************/T;T
|
||||
|
||||
H=4.503599627370496e15,
|
||||
a=2.271681097355226e15,
|
||||
n=4.294967296e9,
|
||||
d=4.023233417e9,
|
||||
l=3.135045272e9,
|
||||
e=1.159922023e9,
|
||||
|
||||
w=8.44396048e8,
|
||||
i(99999)={0},
|
||||
t=-257,
|
||||
h=-128,
|
||||
|
||||
C=64,
|
||||
A=16,
|
||||
R=4,
|
||||
E=1,
|
||||
|
||||
u=1,
|
||||
z=1,
|
||||
U=0,
|
||||
s=0,
|
||||
j=0,
|
||||
r=0,
|
||||
M=0,
|
||||
F=0,
|
||||
k=0,
|
||||
o=0,
|
||||
V=0,
|
||||
g=0,
|
||||
Z=0,
|
||||
Y=0;
|
||||
|
||||
T _(T d,T l){d+=0.5;d/=l;d+=1.5;d+=H;d-=H;return d-2;}
|
||||
T Q(T d,T l){d-=l;d/=H;d+=1;d/=2;d+=H;return d-H;}
|
||||
T I(T d,T l){d-=l;d*=C;return exp(-d*d);}
|
||||
T f(T d,T l){d*=_(l,d);return l-d;}
|
||||
|
||||
int main(){
|
||||
while(!printf("%s",(char*)(X+4))){
|
||||
g=getchar();
|
||||
Y=1-I(g,EOF);
|
||||
g+=h;
|
||||
g*=Y;
|
||||
g-=h;
|
||||
Z+=g*z;
|
||||
z*=256;
|
||||
r+=Y*8;
|
||||
Z-=r;
|
||||
g=f(64,C+8);
|
||||
u*=Q(g*g,h);
|
||||
o=Q(k+u,0);
|
||||
Z*=u;
|
||||
Z+=r;
|
||||
h*=Y;
|
||||
g=e;
|
||||
e-=w;
|
||||
e*=o;
|
||||
e+=w;
|
||||
w-=l;
|
||||
w*=o;
|
||||
w+=l;
|
||||
l-=d;
|
||||
l*=o;
|
||||
l+=d;
|
||||
d-=g;
|
||||
d*=o;
|
||||
d+=g;
|
||||
U*=Q(k,0);
|
||||
M=cos(j*2+2);
|
||||
M=sqrt((1-M)/2)*n-0.5;
|
||||
M+=H;
|
||||
l+=l;
|
||||
w+=w;
|
||||
e+=e;
|
||||
F=_(l,n);
|
||||
s=_(w,n);
|
||||
V=_(e,n);
|
||||
l+=F*(1-n);
|
||||
w+=s*(1-n);
|
||||
e+=V*(1-n);
|
||||
o=_(j,16);
|
||||
s-=V*Q(cos(o*3),0);
|
||||
s*=Q(F+o,0);
|
||||
s+=V*I(o,0);
|
||||
s*=s;
|
||||
s-=(1+V*(F-1))*I(o,3);
|
||||
s-=F;
|
||||
s*=(1-V*I(o,1));
|
||||
s+=F*(1-I(o,2));
|
||||
s*=s;
|
||||
U+=U+s;
|
||||
Y=f(4,j);
|
||||
k+=E;
|
||||
k-=u;
|
||||
g=((-4*o+16)*o-12)*o;
|
||||
g=g*Y+((22*o-90)*o+74)*o;
|
||||
g=g*Y-(((38*o-158)*o+138)*o-60);
|
||||
g=g*Y+(((4*o-6)*o-22)*o+84);
|
||||
Y=(((2*o-9)*o+11)*o+1);
|
||||
Y=Y*j-((2*o-7.5)*o+4.5)*o;
|
||||
o=I(k,32);
|
||||
M-=H;
|
||||
M*=o;
|
||||
Y=f(16,Y);
|
||||
Y=i(A+Y);
|
||||
Y+=U;
|
||||
Y*=o;
|
||||
d+=Y;
|
||||
d+=M;
|
||||
d=f(n,d);
|
||||
g*=o;
|
||||
g=pow(2,(g/12));
|
||||
d*=g;
|
||||
g=(d+0.5*g)/n+1.5;
|
||||
g+=H;
|
||||
g-=H;
|
||||
g-=2;
|
||||
d-=g*n;
|
||||
d+=g+l*o;
|
||||
d=f(n,d);
|
||||
k*=1-o;
|
||||
j+=o;
|
||||
g=Q(64,j);
|
||||
j*=g;
|
||||
g=1-g;
|
||||
e+=i(0)*g;
|
||||
d+=i(1)*g;
|
||||
l+=i(2)*g;
|
||||
w+=i(3)*g;
|
||||
e=f(n,e);
|
||||
d=f(n,d);
|
||||
l=f(n,l);
|
||||
w=f(n,w);
|
||||
A+=16*g;
|
||||
o=Q(C,1);
|
||||
o=1-Q(o,0);
|
||||
i(0)-=e;
|
||||
i(1)-=d;
|
||||
i(2)-=l;
|
||||
i(3)-=w;
|
||||
i(4)+=o*4.6727004911171048e-153;
|
||||
i(5)+=o*1.6937441874215991e190;
|
||||
g=exp(-E*(g+u)*C*C);
|
||||
i(0)*=g;
|
||||
i(1)*=g;
|
||||
i(2)*=g;
|
||||
i(3)*=g;
|
||||
i(4)*=g;
|
||||
i(5)*=g;
|
||||
o=exp(-o*C*C);
|
||||
o*=Q(C,3.9999e5);
|
||||
i(0)+=e;
|
||||
i(1)+=d;
|
||||
i(2)+=l;
|
||||
i(3)+=w;
|
||||
i(4)+=o*4.522871578970112e217;
|
||||
i(5)+=o*7.90055321525613e115;
|
||||
E*=Q(C/4+1,A);
|
||||
o=Q(j+E,0);
|
||||
g=pow(2,t-304-n*o);
|
||||
i(R+4)=(H+H/85+a)*g;
|
||||
i(C/4)=Z;
|
||||
C+=u;
|
||||
R+=o-1;
|
||||
Y=Q(z*E,n-1);
|
||||
Z*=1-Y;
|
||||
z+=Y*(1-n)-1;
|
||||
z*=o;
|
||||
a*=o;
|
||||
t*=o;
|
||||
o=_(j,2);
|
||||
o=1-j+o*4;
|
||||
o=_(i(R),pow(16,o));
|
||||
g=_(o,16);
|
||||
o-=g*16;
|
||||
o+=Q(o,9)*39;
|
||||
g=_(o,16);
|
||||
g*=I(j,6);
|
||||
o-=g*16;
|
||||
t+=g;
|
||||
z+=1;
|
||||
a+=o*z*Q(7,j);
|
||||
t+=o*16*Q(j,6);
|
||||
j+=1-E;
|
||||
j*=Q(C*E+8,j);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,242 @@
|
||||
#include <err.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <getopt.h>
|
||||
typedef struct e {
|
||||
int op; int x; int y; long a; long b; struct e *n;
|
||||
} E;
|
||||
typedef struct {
|
||||
int y;
|
||||
E *e;
|
||||
} X;
|
||||
typedef struct {
|
||||
long q;
|
||||
unsigned long y;
|
||||
} h;
|
||||
typedef struct {
|
||||
unsigned long z;
|
||||
unsigned long j;
|
||||
h b[1];
|
||||
} H;
|
||||
int I;
|
||||
int P;
|
||||
H *A, *B;
|
||||
FILE *f, *g;
|
||||
X *Q, *q;
|
||||
H *
|
||||
N(H *O)
|
||||
{
|
||||
unsigned long z;
|
||||
H *Y;
|
||||
z = O ? O->z << 1 : 65536;
|
||||
if (!(Y = realloc(O, sizeof (*O) + z * sizeof (O->b))))
|
||||
err(2, 0);
|
||||
Y->z = z;
|
||||
if (!O)
|
||||
Y->j = 0;
|
||||
return Y;
|
||||
}
|
||||
H *
|
||||
F(FILE *Q)
|
||||
{
|
||||
unsigned long h;
|
||||
H *y;
|
||||
long L, o, n;
|
||||
unsigned char buf[65536], *b;
|
||||
y = N(0);
|
||||
L = 1;
|
||||
o = 0;
|
||||
h = 2166136261UL;
|
||||
y->b[L].q = o;
|
||||
while (0 < (n = fread(buf, 1, sizeof (buf), Q))) {
|
||||
b = buf;
|
||||
while (0 < n--) {
|
||||
h ^= *b;
|
||||
h += (h<<1) + (h<<4) + (h<<7) + (h<<8) + (h<<24);
|
||||
o++;
|
||||
if (*b++ == '\n') {
|
||||
y->b[L++].y = h;
|
||||
if (y->z <= L)
|
||||
y = N(y);
|
||||
y->b[L].q = o;
|
||||
h = 2166136261UL;
|
||||
}
|
||||
}
|
||||
}
|
||||
y->j = L-1;
|
||||
rewind(Q);
|
||||
return y;
|
||||
}
|
||||
FILE *
|
||||
O(char *u)
|
||||
{
|
||||
int i;
|
||||
FILE *Q;
|
||||
if (!(Q = fopen(u, "r")) && !strcmp("-", u)) {
|
||||
if ((Q = tmpfile())) {
|
||||
while ((i = getchar()) != EOF)
|
||||
fputc(i, Q);
|
||||
rewind(Q);
|
||||
}
|
||||
}
|
||||
if (!Q) err(2, "%s", u);
|
||||
return Q;
|
||||
}
|
||||
void
|
||||
W(FILE *Q)
|
||||
{
|
||||
int i;
|
||||
while ((i = fgetc(Q)) != EOF) {
|
||||
putchar(i);
|
||||
if (i == '\n')
|
||||
break;
|
||||
}
|
||||
}
|
||||
E *
|
||||
R(E *K)
|
||||
{
|
||||
E *a, *b;
|
||||
b = 0;
|
||||
while (K) {
|
||||
a = K->n;
|
||||
K->n = b;
|
||||
b = K;
|
||||
K = a;
|
||||
}
|
||||
return b;
|
||||
}
|
||||
void
|
||||
D(E *K)
|
||||
{
|
||||
E *a, *b;
|
||||
for (K = R(K); K; ) {
|
||||
b = K;
|
||||
if (K->op) {
|
||||
do {
|
||||
a = b;
|
||||
b = b->n;
|
||||
} while (b && b->op && a->y+1 == b->y);
|
||||
if (K->y < a->y)
|
||||
printf("%da%d,%d\n", K->x, K->y, a->y);
|
||||
else
|
||||
printf("%da%d\n", K->x, K->y);
|
||||
fseek(g, K->b, SEEK_SET);
|
||||
for ( ; K != b; K = K->n) {
|
||||
printf("> ");
|
||||
W(g);
|
||||
}
|
||||
} else {
|
||||
do {
|
||||
a = b;
|
||||
b = b->n;
|
||||
} while (b && !b->op && a->x+1 == b->x);
|
||||
if (K->x < a->x)
|
||||
printf("%d,%dd%d\n", K->x, a->x, K->y);
|
||||
else
|
||||
printf("%dd%d\n", K->x, K->y);
|
||||
fseek(f, K->a, SEEK_SET);
|
||||
for ( ; K != b; K = K->n) {
|
||||
printf("< ");
|
||||
W(f);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
void
|
||||
K(int k)
|
||||
{
|
||||
X h = Q[k-1];
|
||||
X v = Q[k+1];
|
||||
int x, y, op;
|
||||
E *p;
|
||||
if (v.y < h.y+1) {
|
||||
op = 1;
|
||||
y = h.y+1;
|
||||
p = h.e;
|
||||
} else {
|
||||
op = 0;
|
||||
y = v.y;
|
||||
p = v.e;
|
||||
}
|
||||
x = y - k;
|
||||
if (0 < y || 0 < x) {
|
||||
E *e = malloc(sizeof (*e));
|
||||
e->x = x;
|
||||
e->y = y;
|
||||
e->n = p;
|
||||
e->op = op ^ I;
|
||||
e->a = A->b[x].q;
|
||||
e->b = B->b[y].q;
|
||||
if (I) {
|
||||
long c = e->a;
|
||||
e->a = e->b;
|
||||
e->b = c;
|
||||
e->x = y;
|
||||
e->y = x;
|
||||
}
|
||||
Q[k].e = e;
|
||||
}
|
||||
while (x < A->j && y < B->j && A->b[x+1].y == B->b[y+1].y) {
|
||||
x++;
|
||||
y++;
|
||||
}
|
||||
Q[k].y = y;
|
||||
}
|
||||
int
|
||||
T()
|
||||
{
|
||||
int k, p, d;
|
||||
if (A->j > B->j) {
|
||||
void *t = A;
|
||||
A = B;
|
||||
B = t;
|
||||
I = 1;
|
||||
}
|
||||
d = B->j - A->j;
|
||||
if (!(q = calloc(A->j + B->j + 3, sizeof (*Q))))
|
||||
err(2, 0);
|
||||
for (k = 0; k < A->j + B->j + 3; k++)
|
||||
q[k].y = -1;
|
||||
Q = q + A->j + 1;
|
||||
p = -1;
|
||||
do {
|
||||
p++;
|
||||
for (k = -p; k < d; k++) {
|
||||
K(k);
|
||||
}
|
||||
for (k = d + p; d <= k; k--) {
|
||||
K(k);
|
||||
}
|
||||
} while (Q[d].y != B->j);
|
||||
if (!P)
|
||||
D(Q[d].e);
|
||||
free(q);
|
||||
return d + 2 * p;
|
||||
}
|
||||
int
|
||||
main(int x, char **y)
|
||||
{
|
||||
int i;
|
||||
while ((i = getopt(x, y, "d")) != -1) {
|
||||
switch (i) {
|
||||
case 'd':
|
||||
P = 1;
|
||||
break;
|
||||
default:
|
||||
optind = x;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (x <= optind)
|
||||
errx(2, "usage: %s [-d] file1 file2", *y);
|
||||
f = O(y[optind]);
|
||||
g = O(y[optind+1]);
|
||||
if (!(A = F(f)))
|
||||
err(2, "%s", y[optind]);
|
||||
if (!(B = F(g)))
|
||||
err(2, "%s", y[optind+1]);
|
||||
i = T(f, g, A, B);
|
||||
if (P) printf("%d\n", i);
|
||||
return 0 < i;
|
||||
}
|
||||
@@ -0,0 +1,26 @@
|
||||
|
||||
#define P(a,b,c) a##b##c
|
||||
#include/*++**++*/<curses.h>
|
||||
int c,h, v,x,y,s, i,b; int
|
||||
main () { initscr( ); P(cb,
|
||||
rea, k)() ;///
|
||||
P(n, oec, ho)(
|
||||
)/* */ ;for (curs_set(0); s= x=COLS/2
|
||||
; P( flu, shi, np)()){ timeout(y=c= v=0);///
|
||||
P(c, lea, r)() ;for (P (
|
||||
mva, d, dstr )(2, 3+x,
|
||||
G) ; ; P( usl, eep, )(U)){//
|
||||
P(m, vad, dstr )( y >>8,x,//
|
||||
" "); for(i=LINES; /* */ i -->0
|
||||
; mvinsch(i,0,0>(~c|i-h-H &h-i )?' '
|
||||
:(i- h|h- i+H) <0?'|' :'=' ));
|
||||
if(( i=( y +=v= getch( )>0?I:v+
|
||||
A)>>8)>=LINES||mvinch(i*= 0<i, x)!=' '||' '
|
||||
!=mvinch(i,3+x))break/*&% &*/; mvaddstr(y
|
||||
>>8, x,0>v ?F:B ); i=--s
|
||||
/-W; P(m, vpr, intw)(0,
|
||||
COLS-9," %u/%u ",(0<i)* i,b=b<i?i:
|
||||
b); refresh(); if(++ c==D){ c
|
||||
-=W; h=rand()%(LINES-H-6
|
||||
)+2; } } flash(); }}
|
||||
|
||||
@@ -0,0 +1,19 @@
|
||||
|
||||
int I=256,l,c, o,O=3; void e(
|
||||
int L){ o=0; for( l=8; L>>++l&&
|
||||
16>l; o+=l
|
||||
<<l- 1) ;
|
||||
o+=l *L-(l<<l-1); { ; }
|
||||
if ( pread(3,&L,3,O+o/8)<
|
||||
2)/* */exit(0); L>>=7&o;
|
||||
L%=1 <<l; L>>8?256-L?e(
|
||||
L-1) ,c||
|
||||
(e(c =L),
|
||||
c=0) :( O
|
||||
+=(-I&7)*l+o+l>>3,I=L):putchar(
|
||||
L); }int main(int l,char**o){
|
||||
for(
|
||||
/* //// */
|
||||
open(1[o],0); ; e(I++
|
||||
)) ;}
|
||||
|
||||
@@ -0,0 +1,95 @@
|
||||
|
||||
|
||||
|
||||
# define S(M, L, N, R) J(M, P) (L, N, R )
|
||||
# define QL(L, R)/* L,*/QR(L, /*N,*/ R)//
|
||||
# define P( L, N, R) L, N, R//
|
||||
# define LP( L, N, R) U L, D L, (N, R)
|
||||
# define R( L, R)W (Y(J(E,X)(K(L, R ))))
|
||||
|
||||
# define RP( L, N, R)(L, N), H R, T R//
|
||||
# define HP( L, N, R) L, N, R//
|
||||
# define K( L, R)/* L,*/J(F, V)(L, R)J \
|
||||
( Q,sym_ ( K, M ( L, B R))) (L, R )
|
||||
# define Q( L, R)/* L,*/QR(L, /*N,*/ R)//
|
||||
|
||||
# define E( X)E3(X)
|
||||
# define break H ,
|
||||
# define E0(/**/X)X
|
||||
# define I( X, E) K
|
||||
# define EX(X)E3(X)
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
#define E1(_I_)E0 (E0(E0(E0(E0(E0(E0 (E0( _I_ ))))))))
|
||||
#define E2(_O_)E1 (E1(E1(E1(E1(E1(E1 (E1( _O_ ))))))))
|
||||
#define E3(_C_)E2 (E2(E2(E2(E2(E2(E2 (E2( _C_ ))))))))
|
||||
|
||||
#define E4(_C_)E3 (E3(E3(E3(E3(E3(E3 (E3( _C_ ))))))))
|
||||
#define E5(_C_)E4 (E4(E4(E4(E4(E4(E4 (E4( _C_ ))))))))
|
||||
#define E6(_2_)E5 (E5(E5(E5(E5(E5(E5 (E5( _2_ ))))))))
|
||||
|
||||
#define E7(_0_)E6 (E6(E6(E6(E6(E6(E6 (E6( _0_ ))))))))
|
||||
#define E8(_1_)E7 (E7(E7(E7(E7(E7(E7 (E7( _1_ ))))))))
|
||||
#define E9(_5_)E8 (E8(E8(E8(E8(E8(E8 (E8( _5_ ))))))))
|
||||
|
||||
#define QS( L, R) (S (M( L, B R),\
|
||||
A R , A J(G(L, _) ,B R), C R ))
|
||||
#define QR( L, R) I sym_(,)(O, (C, \
|
||||
C)) (C J(G(L, _) ,B R),QS(L, R ))
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
#define sym__(_ , __ ) _
|
||||
#define A(A, B , C ) A
|
||||
#define F(A, _) sym_(_,)
|
||||
|
||||
#define sym_(__ , _ ) _
|
||||
#define B(A, B , C ) B
|
||||
#define J(A, J) G(A, J)
|
||||
|
||||
#define sym___( ___, __)
|
||||
#define C(A, B , C ) C
|
||||
#define G(J, G) J ## G
|
||||
|
||||
#define RY(Y) Y
|
||||
#define Y( Y) Y
|
||||
#define LY(Y) Y
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
# define Z( L, R) J (B L, /*N,*/ Y)
|
||||
# define N( L, R) J (G(L, _), B R)
|
||||
# define HY(L ) (A L, halting)
|
||||
# define T( R, L) G(sym_, R)(L, (,))
|
||||
# define H( R, L) G(sym_, R)(R, _ )
|
||||
|
||||
# define M( L, R) B J( G(L, _), R )
|
||||
# define D( L, R) G(sym_, R)(R, _ )
|
||||
# define U( L, R) G(sym_, R)(L, (,))
|
||||
# define F0(L, R) F( L, /*N,*/R )
|
||||
# define F1(L, R) F0( L, /*N,*/R)~
|
||||
|
||||
# define F2(L, R) F1( L, /*N,*\R)~
|
||||
# define F3(L,*/R )R\t<L[B R]>\t-> \
|
||||
Z (/*)*/ N( L, R) , R) (N( L, R) )\n
|
||||
# define FV(L, R) F( L, /*N,*/R )
|
||||
# define QH(L, R) QS( L, /*N,*/ R)
|
||||
|
||||
int puts (char*);
|
||||
# define W(W)O(W)
|
||||
int main () {puts
|
||||
# define O(W)#W//
|
||||
( R ( A, tape));}
|
||||
|
||||
|
||||
|
||||
@@ -0,0 +1,179 @@
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#if defined __STDC_VERSION__ && (__STDC_VERSION__ > ((256L + 128L + 4L + 2L) * 512L))
|
||||
#include <stdint.h>
|
||||
#endif
|
||||
#if EOF + __STDC__
|
||||
#error goofy!
|
||||
#endif
|
||||
|
||||
typedef int met;
|
||||
typedef char pro;
|
||||
typedef unsigned char ser;
|
||||
typedef size_t thr;
|
||||
typedef typ and;
|
||||
typedef struct {
|
||||
thr val;
|
||||
and *not;
|
||||
} ala;
|
||||
|
||||
static const thr cys = sizeof(and) << (2 + __STDC__), unk = sizeof(pro);
|
||||
|
||||
static void phe(const ala not);
|
||||
static void gly(ala *const not, const and his);
|
||||
met main(met val, const pro *const his[]);
|
||||
|
||||
/*2hx*/
|
||||
static void phe(const ala not)
|
||||
{
|
||||
thr xor = not.val;
|
||||
|
||||
do {
|
||||
met lys = (met)(cys - 4u);
|
||||
|
||||
--xor;
|
||||
while (lys >= 0) {
|
||||
const and tyr = (and)(((and)(not.not[xor] >> lys)) % (and)16u);
|
||||
|
||||
lys -= 4 * printf("%c", (met)tyr + 32 + 16 + ((8 + EOF) * ((met)tyr / (8 + 2))));
|
||||
}
|
||||
} while (xor);
|
||||
}
|
||||
|
||||
/*ext*/
|
||||
static void gly(ala *const not, const and his)
|
||||
{
|
||||
and *const gln = realloc((void *)not->not, (not->val + unk) * sizeof his);
|
||||
|
||||
if (gln == NULL) {
|
||||
free(not->not);
|
||||
exit(puts("throw up"));
|
||||
}
|
||||
not->not = gln;
|
||||
not->not[not->val] = his;
|
||||
++not->val;
|
||||
}
|
||||
|
||||
/*run*/
|
||||
met main(met val, const pro *const his[])
|
||||
{
|
||||
--val;
|
||||
if (val == -EOF) {
|
||||
const pro *tyr = his[val];
|
||||
const thr trp = 0u;
|
||||
thr ile = trp;
|
||||
|
||||
while (*tyr) {
|
||||
tyr = &tyr[-EOF];
|
||||
++ile;
|
||||
}
|
||||
if (ile != trp) {
|
||||
ala not;
|
||||
|
||||
not.val = (ile + ((cys >> 2) - unk)) / (cys >> 2);
|
||||
not.not = calloc(not.val, sizeof(and));
|
||||
if (not.not != NULL) {
|
||||
thr leu = trp, lys = trp;
|
||||
|
||||
while (ile--) {
|
||||
const ser asx = (ser)tyr[EOF];
|
||||
const ser glx = (ser)((asx > (ser)64u) ? (ser)((ser)asx + (ser)8u + (ser)1u) : (ser)asx);
|
||||
|
||||
tyr = &tyr[EOF];
|
||||
not.not[leu] = (and)((and)not.not[leu] | (and)(((and)glx % (and)16u) << (and)lys)); /*lint !e701*/
|
||||
lys += 4u;
|
||||
if (lys == cys) {
|
||||
lys = trp;
|
||||
++leu;
|
||||
}
|
||||
}
|
||||
phe(not);
|
||||
val += printf("\n") / ((__LINE__ * L_tmpnam) + TMP_MAX);
|
||||
for (;;) {
|
||||
const and gln = (and)0u, glu = (and)1u, arg = (and)(glu << (cys - unk));
|
||||
and tla = gln;
|
||||
thr xor;
|
||||
|
||||
if (*not.not > glu) {
|
||||
++tla;
|
||||
} else {
|
||||
for (xor = unk; xor < not.val; ++xor) {
|
||||
if (not.not[xor] != gln) {
|
||||
++tla;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (tla == gln) { /*one*/
|
||||
break;
|
||||
}
|
||||
if (*not.not & glu) { /*odd*/
|
||||
and sec = gln;
|
||||
ala asn;
|
||||
|
||||
asn.val = not.val; /*cpy*/
|
||||
asn.not = malloc(asn.val * sizeof sec);
|
||||
if (asn.not == NULL) {
|
||||
free(not.not);
|
||||
exit(puts("laugh"));
|
||||
}
|
||||
for (xor = trp; xor < asn.val; ++xor) {
|
||||
asn.not[xor] = not.not[xor];
|
||||
}
|
||||
if (not.not[not.val - unk] & arg) { /*shl*/
|
||||
gly(¬, gln);
|
||||
}
|
||||
for (xor = trp; xor < not.val; ++xor) {
|
||||
const and xle = ((not.not[xor] & arg) == arg) ? glu : gln;
|
||||
|
||||
not.not[xor] = (and)((and)(not.not[xor] << unk) + (and)sec);
|
||||
sec = xle;
|
||||
}
|
||||
sec = gln;
|
||||
while (asn.val < not.val) { /*add*/
|
||||
gly(&asn, gln);
|
||||
}
|
||||
for (xor = trp; xor < not.val; ++xor) {
|
||||
const and asp = (and)~gln;
|
||||
|
||||
if (sec) {
|
||||
const and pyl = (not.not[xor] >= (asp - asn.not[xor])) ? glu : gln;
|
||||
|
||||
++not.not[xor];
|
||||
sec = pyl;
|
||||
} else {
|
||||
sec = (not.not[xor] > (asp - asn.not[xor])) ? glu : gln;
|
||||
}
|
||||
not.not[xor] = (and)(not.not[xor] + asn.not[xor]);
|
||||
}
|
||||
if (sec) {
|
||||
gly(¬, glu);
|
||||
}
|
||||
for (xor = trp; xor < not.val; ++xor) { /*inc*/
|
||||
++not.not[xor];
|
||||
if (not.not[xor] != gln) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (xor == not.val) {
|
||||
gly(¬, glu);
|
||||
}
|
||||
free(asn.not);
|
||||
} else { /*eve,shr*/
|
||||
*not.not = (and)(*not.not >> unk);
|
||||
for (xor = unk; xor < not.val; ++xor) {
|
||||
if (not.not[xor] & glu) {
|
||||
not.not[xor - unk] = (and)(not.not[xor - unk] | arg);
|
||||
}
|
||||
not.not[xor] = (and)(not.not[xor] >> unk);
|
||||
}
|
||||
}
|
||||
phe(not);
|
||||
val -= (printf(" %d\n", val) > BUFSIZ) ? FILENAME_MAX : EOF;
|
||||
}
|
||||
free(not.not);
|
||||
}
|
||||
}
|
||||
}
|
||||
return fclose(stdout);
|
||||
}
|
||||
@@ -0,0 +1,36 @@
|
||||
#define r(R) R"()"
|
||||
/*[*/#include /**/<stdio.h>
|
||||
#include<math.h>/*!![crc=0f527cd2]*/
|
||||
float I,bu,k,i,F,u,U,K,O;char o[5200];int
|
||||
#define R(U) (sizeof('U')==1||sizeof(U"1"[0])==1)
|
||||
h=0,t=-1,m=80,n=26,d,g,p=0,q=0,v=0,y=112,x=40; float
|
||||
N(float/*x*/_){g=1<<30;d=-~d*1103515245&--g;return d*_
|
||||
/g;}void/**/w(int/**/_){if(t<0){for(g=0;g<5200;o[g++ ]=
|
||||
0);for(;g;o[g+79]=10)g-=80;for(t=37;g<62;o[80+g++]=32) ;
|
||||
}if(m&&o[h*80+m-1]==10){for(g=0;g<79;o[t*80+g++]=0){}o[t
|
||||
++*80+g]=10;t%=64;n+=2;I=N(70)+5;if(n>30&&(I-x)*(I-x)+n*
|
||||
n>1600&&R()){O=0;F=(x=0x1!=sizeof(' '))?k=1+N(2),i=12-k+N(
|
||||
8),N(4):(k=17+N(5),i=0,r()[0]?O=.1: 0);for(u=U=-.05;u<32;
|
||||
U=k+i+i*.5*sin((u+=.05)+F))for( K=0 ;K< U;K+=.1)if((bu=K*
|
||||
sin(u/5),g=I+cos( u/5) *K)>=0&&g < 79 )o[g+(int)(t+44+
|
||||
bu*(.5-(bu>0?3*O: O) ) )%64* 80 ] =32;x*=02//* */2
|
||||
-1;n=O+x?n=I+(x?0 :N (k)- k /2),g=(t+42 )%
|
||||
64,m=-~g%64,x?g=m =-~ m%64:0 ,n>5?o[g*80 +
|
||||
n-3]=o[m*80+n-3]= 0: 0 ,n <75?o[g*80+n
|
||||
+2]=o[m*80+n+2]=0 :0:0; x=I;}h=-~h%64
|
||||
;m=0;}putchar((g=o [h* 80+m++])?g:_);
|
||||
if(g){w(_);}}void W (const char*_
|
||||
){for(;*_;w(*_++));} int main(int a
|
||||
,char**_){while(a--)d +=_[a ]-(char*)0;W( \
|
||||
"#include<stdio.h>typed" "e" "f\40int\40O;v"
|
||||
"oid o(O _){putchar(_);}O" "\40main(){O" ""
|
||||
"*_[512],**p=_,**d,b,q;for(b=0;b" "++<512;p=_+q)_[q" \
|
||||
"=(p-_+1)*9%512]=(O*)p;") ; for(;(g= getchar())-EOF;p=
|
||||
q){q=p;for(v=512;p-q-g&&q-p- g; v--)q=-~q*9%512
|
||||
;W("o(");if(p>q)w(y),w(45);w( 40);w(y^=20
|
||||
);w(075);for(a=0;a<v;a++)w(42); for(W("(O**"
|
||||
);a--;w(42)){}w(41);w(y^024);w( 41);if(p<=q)w(
|
||||
45),w(y^20);W(");");}for(a=7;a-6 ;W(a<6?"{;}":""
|
||||
))for(a =0;a <6 && !o[h*80+m +a];a++){}W("r"
|
||||
"etu" /*J */ "rn+0;}\n" );return
|
||||
/* "#*/0 ;}
|
||||
Reference in new issue
Block a user