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:
Landon Curt Noll committed
1 parent
cfd253683f
commit
2ba12ecc3c
320 files changed
+21365
No files matched your search
@@ -0,0 +1,60 @@
|
||||
#include <math.h>
|
||||
#include <sys/time.h>
|
||||
#include <X11/Xlib.h>
|
||||
#include <X11/keysym.h>
|
||||
double L ,o ,P
|
||||
,_=dt,T,Z,D=1,d,
|
||||
s[999],E,h= 8,I,
|
||||
J,K,w[999],M,m,O
|
||||
,n[999],j=33e-3,i=
|
||||
1E3,r,t, u,v ,W,S=
|
||||
74.5,l=221,X=7.26,
|
||||
a,B,A=32.2,c, F,H;
|
||||
int N,q,C,y,p,U,*g
|
||||
; Display*e; char f[
|
||||
52]; GC k; main( ){ Window
|
||||
z=RootWindow(e=XOpenDisplay( 0),0); for (XSetForeground(e,k=XCreateGC (e,z,0,0),BlackPixel(e,0 ))
|
||||
; scanf("%lf%lf%lf",y +n,w+y, y+s)+1; y ++); XSelectInput(e,z= XCreateSimpleWindow(e,z,0,0,400,400,
|
||||
0,0,WhitePixel(e,0) ),KeyPressMask); for(XMapWindow(e,z); ; T=sin(O)){ struct timeval G={ 0,dt*1e6}
|
||||
; K= cos(j); N=1e4; M+= H*_; Z=D*K; F+=_*P; r=E*K; W=cos( O); m=K*W; H=K*T; O+=D*_*F/ K+d/K*E*_; B=
|
||||
sin(j); a=B*T*D-E*W; XClearWindow(e,z); t=T*E+ D*B*W; j+=d*_*D-_*F*E; P=W*E*B-T*D; for (o+=(I=D*W+E
|
||||
*T*B,E*d/K *B+v+B/K*F*D)*_; p<y; ){ T=p[s]+i; E=c-p[w]; D=n[p]-L; K=D*m-B*T-H*E; if(p [n]+w[ p]+p[s
|
||||
]==0|K <fabs(W=T*r-I*E +D*P)|fabs(D=t*D+Z *T-a*E)>K)N=1e4; else{ q=W/(9+K) *4E2+2e2; C= 2E2+4e2/( K
|
||||
+9)*D; N-1E4&&XDrawLine(e ,z,k,N ,U,q,C); N=q; U=C; } ++p; } L+=_*(X*t+P*M+m*l); T=X*X+ l*l+M *M;
|
||||
XDrawString(e,z,k ,20,380,f,17); D=v/l*15; i+=(B *l-M*r -X*Z)*_; for(; XPending(e); u *=CS!=N){
|
||||
XEvent z; XNextEvent(e ,&z);
|
||||
++*((N=XLookupKeysym
|
||||
(&z.xkey,0))-IT?
|
||||
N-LT? UP-N?& E:&
|
||||
J:& u: &h); --*(
|
||||
DN -N? N-DT ?N==
|
||||
RT?&u: & W:&h:&J
|
||||
); } m=15*F/l;
|
||||
c+=(I=M/ l,l*H
|
||||
+I*M+a*X)*_; H
|
||||
=A*r+v*X-F*l+(
|
||||
E=.1+X*4.9/l,t
|
||||
=T*m/32-I*T/24
|
||||
)/S; K=F*M+(
|
||||
h* 1e4/l-(T+
|
||||
E*5*T*E)/3e2
|
||||
)/S-X*d-B*A;
|
||||
a=2.63 /l*d;
|
||||
X+=( d*l-T/S
|
||||
*(.19*E +a
|
||||
*.64+J/1e3
|
||||
)-M* v +A*
|
||||
Z)*_; l +=
|
||||
K *_; W=d;
|
||||
sprintf(f,
|
||||
"%5.0f %4"
|
||||
"d %6.0f",
|
||||
l /1.7,( C =
|
||||
9E3+O*57.3)% 0550,i); d+=T*(.45-14/l*
|
||||
X-a*130-J* .14)*_/125e2+F*_*v; P=(T*(47
|
||||
*I-m* 52+E*94 *D-t*.38+u*.21*E) /1e2+W*
|
||||
179*v)/2312; select(p=0,g,g,g,&G); v-=(
|
||||
W*F-T*(.63*m-I*.086+m*E*19-D*25-.11*u
|
||||
)/107e2)*_; D=cos(o); E=sin(o); } }
|
||||
|
||||
|
||||
@@ -0,0 +1,67 @@
|
||||
char r[]="C#S3K+[;G'W7OB/_? ? « ( !IOCCC! ´ ³Ën £0 0 e÷|ÅtÑ%Ä ° 2u"
|
||||
" »¾ß mÔ/p ª c p) nm «¨ªúïµ!!¶â¡a £À3sîÜ 9sz2{ +§ 9_°0 © h0 ºÂ / "
|
||||
"¤)$1 ¬ a~ ) % y qÃ'¯ ¹â ° \" ! q 6 µy' 0 3;e{ Ì kãÔs¾,Ê 2~a q t"
|
||||
" 9dl 9 ¬.´ .ù_ &Á!ê '* · ; ·± µÁ = <eàª1à B:29 ¦ 6 n´ o®¨b:_2"
|
||||
" µ +úí h |÷t\177°#d`Ý l½Ù r )þÁ @ ·´Ö m d©ià ¤6 e¦ v¸½^ ¶` rq"
|
||||
"Á <'7Ã÷°ÅÙ ´[|äÈ=ñ@îp (², /ä^ c ¦ . ` £²î ¡ñ`fæ /= :ù]y÷¢·"
|
||||
" 2º » q ¢ v²4Õm³íÓ&=a¤¡ g ; dà,é+· +_¼ =È 5߬iêÔØû§ÌÌ r£"
|
||||
#define O(Q)p!O) { *i[25][41]|=U(642+Q); u e r[(Q)/2]&63); }
|
||||
"solÞÄ&¾X¼[Ý; }ï? º= &c} 9ȾóÀ2 >ü 5 ,Þ & Ã0 Úù*½ ³äÿgh";
|
||||
#define C( b)O(28+(B+b)%6)
|
||||
# define a >> B &M[i X]
|
||||
#include/* s */<stdio.h>
|
||||
#include/* s */<time.h>
|
||||
unsigned int long
|
||||
# define e putchar(
|
||||
B,E,M,A,Z,I,N,G
|
||||
# define g ! (32 a)
|
||||
# define u U(533);
|
||||
# define n (65 a)
|
||||
# define z for (
|
||||
[32768], i [32]
|
||||
# define p if(
|
||||
[48][3]={ { { 2} } } ; void**V,*D,*F[32][48];
|
||||
void*Q(void**O){ return*O?(*O=Q(*O)):O; } U(
|
||||
O){return E+=(O/=2)-1?U((A=A/2^57525273+(A&
|
||||
1^O&1)*9583591<<5,O)),0:O,16; } main(O){ A
|
||||
=O?time(D):953351751; z I=0; I<26; ++I){z
|
||||
N=I/2; N<30+I/2; ++N){ z M=0; M<3; ++M){
|
||||
p Z=O)z; (B=I+Z*!!M) <26&&N+Z*(M!=2)-B/
|
||||
2<30; B[G]=N<<7|Z++<<13|I*4+M)z; G[B=A
|
||||
# define X [ I+Z*!! M] [ N+Z*(M!= 2)]
|
||||
&32767]; )u p!Z&&M[i X]){ z B=0; B<6
|
||||
; B++){ p!g){ C(5)O(0)C(2)O(2)} C((
|
||||
B&1?!!n:4-3*g))p!g|n)O(4)O(7)} z B
|
||||
=0; B<6; B++){ p g&&!n)O(14)p!g)O
|
||||
(8)p B&1|g){ O=!n; O(10)O=!(1040
|
||||
a ); O(12 )O=0; } O(17+(B&1 ?!(
|
||||
1040 a)!=!n:g))} } } O(24)} O(
|
||||
21+(I&1))} O(26)p O)z E=0; E<
|
||||
1<<15; I=16){ B=E++[G]; D=Q(
|
||||
&F[I=B/4&31][N=B>>7&63]); M
|
||||
=B%4; Z=B>>=13; V=Q(&F X);
|
||||
p!(D==V|N[I[i]] [1]|i X[1
|
||||
])){ z; --Z&&!(*i X%9|*i
|
||||
X/9&*i X/9-1); ); p!Z){
|
||||
*V=D; *i X|=32>>M; Z=B
|
||||
; z*i X|=4>>M; --Z; i
|
||||
X[*i X?2-!i X [1]:!(
|
||||
F X=V)]=36>>M); } }
|
||||
} p!O){ u u z I=8;
|
||||
I--; )p(N=I[r]=(I
|
||||
>3?E:A)>>(I*9&24
|
||||
))==10||N==13){
|
||||
e 0 ); I =8; u
|
||||
u u u} e 1 );
|
||||
} z E =1333;
|
||||
++ I<8+469*
|
||||
!!O; e(N=I
|
||||
[r])-32|!
|
||||
O?N:r[++
|
||||
I]-N));
|
||||
return
|
||||
O &&
|
||||
main
|
||||
(!O
|
||||
);
|
||||
}
|
||||
@@ -0,0 +1,3 @@
|
||||
#include <stdio.h>
|
||||
int O,o,i;char*I="";main(l){O&=l&1?*I:~*I,*I++||(l=2*getchar(),i+=O>8
|
||||
?o:O?0:o+1,o=O>9,O=-1,I="t8B~pq`",l>0)?main(l/2):printf("%d\n",--i);}
|
||||
@@ -0,0 +1,93 @@
|
||||
#include<curses.h>
|
||||
#include<stdlib.h>
|
||||
#include<string.h>
|
||||
|
||||
#define A int
|
||||
#define F float
|
||||
#define O sizeof
|
||||
#define V ((A *)(X+N))
|
||||
#define U(a,b) for(a = 0; a < b; a++)
|
||||
#define L(a) (X[K] * H[a*4]+ X[K+1] * H[a*4+1]+ X[K+2] * H[a*4+2])
|
||||
#define _(e,f,a,b,c) if(M==e) { T[a*4+c] = T[b*4+c] = T[c*4+a] = T[c*4+b] = !(T[c*5] = 1); T[a*4+b] = -(T[b*4+a] = f .1045284632); T[b*5] = T[a*5] = .9945418726; U(M,3) U(E,4) U(K,3) R[M*4+E] += H[K*4+E] * T[M*4+K]; memcpy(H,R,12*O(F)); }
|
||||
|
||||
char Q[3792];
|
||||
A K, M=0, E, B;
|
||||
long Z;
|
||||
F H[] = { 1,0,0,0,0,1,0,0,0,0,1,0 } , T[12], R[12], C, D, I, J, S, * X, G=4;
|
||||
FILE * W;
|
||||
|
||||
A main(A N,char ** Y) {
|
||||
char P[] = "AlWuzEre 72 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 ";
|
||||
strcpy(Q,P);
|
||||
if(!(W = fopen(Y[N<2?0:1],"r"))) {
|
||||
printf("Can't read\n"); exit(-1); }
|
||||
fseek(W,0,SEEK_END);
|
||||
Z = ftell(W);
|
||||
fseek(W,0,SEEK_SET);
|
||||
strcpy(Q+9, "%d");
|
||||
while(fscanf(W,Q,&N) != 1) {
|
||||
fseek(W,1,SEEK_CUR);
|
||||
if(ftell(W) >= Z) {
|
||||
printf("Bad input\n"); exit(-1); } }
|
||||
|
||||
X = (F *)malloc(N * (O(A)>O(F)?O(A):O(F)) * 2);
|
||||
if(!X) { printf("No memory\n"); exit(-1); }
|
||||
U(K,N) fscanf(W,"%f",X+K);
|
||||
fclose(W);
|
||||
|
||||
initscr();
|
||||
halfdelay(30);
|
||||
noecho();
|
||||
|
||||
CH:
|
||||
memset(R,0,12*O(F));
|
||||
_('h', ,1,2,0)
|
||||
_('j', ,2,0,1)
|
||||
_('k', ,1,0,2)
|
||||
_('y',-,1,2,0)
|
||||
_('u',-,2,0,1)
|
||||
_('i',-,1,0,2)
|
||||
G += M=='a'?-.1:M=='z'?.1:0;
|
||||
if(M=='q') { printf("%.9s\n",P); exit(0); }
|
||||
|
||||
memset(Q,0,3792);
|
||||
erase();
|
||||
|
||||
U(K,N) {
|
||||
C = 40 / (L(2)+G);
|
||||
V[K] = (A)(L(0) * C) + 40;
|
||||
V[K+1] = (A)(L(1) * C) + 24;
|
||||
K+=2; }
|
||||
|
||||
U(B,N) {
|
||||
C = V[B++];
|
||||
D = V[B++];
|
||||
E = V[++B] - C;
|
||||
M = V[++B] - D;
|
||||
B++;
|
||||
S = (F)abs((abs(E)>abs(M))?E:M);
|
||||
I=E/S;
|
||||
J=M/S++;
|
||||
U(K,S)
|
||||
{
|
||||
E = (A)(C+0.5);
|
||||
M = (A)(D+0.5);
|
||||
if(E>=0 && M>=0 && E<79 && M<48)
|
||||
{
|
||||
Q[E + M * 79] = 1;
|
||||
mvaddch((M&1?M-1:M)/2,E,Q[E+(M+(M&1?-1:1))*79]?':':(M&1?'.':'`'));
|
||||
}
|
||||
C+=I;
|
||||
D+=J;
|
||||
}
|
||||
}
|
||||
|
||||
move(0,0);
|
||||
refresh();
|
||||
|
||||
M = getch();
|
||||
halfdelay(M==ERR?1:30);
|
||||
M = M==ERR?'u':M;
|
||||
|
||||
goto CH;
|
||||
}
|
||||
@@ -0,0 +1,39 @@
|
||||
#ifndef int
|
||||
#ifdef while
|
||||
char s[234],d[56],*p=s,m='m';
|
||||
#define int typedef (*define)();\
|
||||
define O [6]={getc,putchar,(y)memmove,(y)printf,(y)n,(y)l};
|
||||
#include __FILE__
|
||||
signed short n(short bz){
|
||||
short pb=0,Md=1,ih=2,sfp=3,sjs=4,fo,u=5,scp=6,t,gq=7,oh,r=8,pcf=9,rs=10;
|
||||
char o=1,i=1,l,pc=i,b=r+o/2,_f=6,m=7,s=8,g,q,od=o*rs+4^s,js=_f/*3-m*'c',bs='g';
|
||||
return 1; }
|
||||
#y FILE c[a]+s,p[c],r[m]+u[i+4*o|f]-r[wob][wad]+s*f-!w|o,L+x | cut
|
||||
;}int main(i,love_unix){*/;}int main(i,love_unix){/*;}int main(i,love_unix){*\;}| here */
|
||||
while(FILE)for(;9-(i=0[O](f)););
|
||||
for(;32-(i=0[O](f));0&& 3[O]("-->%s<--", "gxdgbtgxsxpcctvpixktedhiedcte"));
|
||||
for(;'\n'-(i=O[0](f));)(i>='a'&&i<'z')?*
|
||||
#include __FILE__
|
||||
"Demonic Smiley" );} /* <g> */
|
||||
#else
|
||||
#define while(int) short c=0;int*f=fopen(__##int##__,"r");for(i=0;i<25;i _)i[d]='A'+(13+i)%26;main:
|
||||
#define y define
|
||||
#define _ ++
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
#include __FILE__
|
||||
#endif
|
||||
#elif defined(signed)
|
||||
(p _)=(i-'a')[d]:!(i-'z')?*(p _)=32:(i>='A'&&i<='Z')&&((3&8|2)[O](d+1,d,24L),*(p _)=0[d]=i);/*
|
||||
#y FILE t,ra|js+t*gj,at[qdd]-=K,is _,qv _,veb _,ti _,ao[mqht] _*/
|
||||
if(c _<6) goto main; 5[O](
|
||||
#else
|
||||
#define signed short l(){char q='_';p=s+4*(time(NULL)%24)*2,m=(char)p+1;\
|
||||
*(p+8)=0; for(d[3]=10,d[33]=3[d]-10;d[3]<18;3[d] _) d[3][p]=q;3[d][p]=0;\
|
||||
hell: printf("\t[%s]\n",p+10);if(!m) goto stoned;\
|
||||
froze: d[8]=(scanf("%c",&(2[d+__STDC__])),2[d+!NULL])&223;if(!(3[d+5]-'\n')) goto froze;\
|
||||
for(m=1[d]=0;d[1]<8;2[d-1] _) (p[d[1]]-d[8]||(p[3[d-2]+10]=4[d+4]))+(p[d[1]+10]-q||m _);\
|
||||
goto hell;stoned:;}
|
||||
FILE *X(FILE s){ char i,iev,jmqhu,xqht,mqh,ujek,sxydw,kdj,yjb,utou,qhre,eamy,jxxe,bt;}
|
||||
#endif
|
||||
@@ -0,0 +1,18 @@
|
||||
#include <stdio.h>
|
||||
#define PO(o,t)\
|
||||
(((o>64)&&(o<91))?(((t>96)&&(t<123))?(t-32):(t)):(((t>64)&&(t<91))?(t+32):(t)))
|
||||
|
||||
void main() { char *poo="poot",
|
||||
*Poo="pootpoot" ,O[9],o;int t, T;(t=0)|| (*O='\0');while(
|
||||
(o= getc( stdin ))!=( EOF))if (((o> 64)&&
|
||||
(o< 91)) ||(( o>96 )&&(o <123 ))) (
|
||||
t!=8 )&&(O [t]= o)&& (O[++ t] = '\0')
|
||||
;else {if (t>7) {for (T = 0 ; T <=7; T++ )
|
||||
printf("%c", PO(*( O+T), *(Poo+ T))); printf
|
||||
("%c", o);}else if (t>3){for (T =0;T<=
|
||||
3;T++) printf
|
||||
("%c", PO(*(O
|
||||
+T),*( poo+T)
|
||||
|
||||
) ); printf( "%c", o ) ; } else printf("%s%c", O, o); ( t =0) || (*O='\0'); } }
|
||||
|
||||
@@ -0,0 +1,67 @@
|
||||
#include<curses.h>
|
||||
#include<stdlib.h>
|
||||
#include<unistd.h>
|
||||
#define E x/Y
|
||||
#define F x%Y
|
||||
#define P( o , O , t ) move ( o + 3 , O + 3 ) ; addch ( t );
|
||||
#define I(n) ( 2 * ( n / ( X + Y ) ) - 1 + ( ( n % ( X + Y ) - X ) < 0 ? 1 :2))
|
||||
#define D(T) switch(I(p)){ case 3:P(2*(X+Y)-1-p,-2,T); break; case 2:P(Y+1,2*X\
|
||||
+ Y-p -1, T); break; case 1:P(p-X, 1 +X, T); break; case 0: P( -2, p, T); }
|
||||
#define R for(x=0; x<X*Y; x++){ P(F,E,(L[E][F]>84)?42:L[E][F]); } move(5+Y,2) \
|
||||
; clrtoeol(); printw("score: %d", s); move(0, 0); clrtoeol() ; refresh() ;
|
||||
|
||||
int main(int t, char *u[]) { char c, *C="POOT", L[99
|
||||
][ 99
|
||||
]; int X, Y, n, x, a, b, A, B, p, s, S ; X = Y= p=
|
||||
s= 0; if (t
|
||||
== 3) { X=
|
||||
atoi ( u[ 1])
|
||||
; Y = atoi(u[2]); } if
|
||||
(X <6
|
||||
|| X > 98|| Y > 98 ||
|
||||
|
||||
Y < 6 ) { X = 15 ; Y = 12; }
|
||||
initscr (); for
|
||||
(x =0; x < X * Y; x++ ){
|
||||
L[ E][F ]=32 ; P
|
||||
(- 1, E, 45
|
||||
); P( Y, E,
|
||||
45 ); P (F,- 1,
|
||||
124 ); P(F, X, 124); } P(
|
||||
-1, -1, 43); P(
|
||||
-1, X, 43) ; P(Y, -1, 43 ) ;
|
||||
|
||||
P(Y,X,43); c=C[random()%4];
|
||||
D(c); R ; for(;
|
||||
; ) { switch (x = getch ()
|
||||
){ case 97 : D(
|
||||
32 ); if (--
|
||||
p< 0) p= (X
|
||||
+Y )*2-1; break; case
|
||||
115 : D(32); if (++p > (X
|
||||
+Y)* 2- 1) p =0
|
||||
; break ; case 100: a = ( (
|
||||
n=I(p))%2)
|
||||
?X +(
|
||||
n/2)*( 1-
|
||||
X) -1
|
||||
:( 1-
|
||||
n)*p+(n/2)*(2*X+Y-1); b = (n%2)?((n/2)?(2* (X
|
||||
+Y )-
|
||||
p-1): (p-X)) :Y+ ((2-n) /2) *(1-Y)-1; if(L [a
|
||||
][ b]
|
||||
!= 32
|
||||
)break ; A
|
||||
=( n%
|
||||
2)?n-2:(n-
|
||||
|
||||
1)*((c%3-1)*-1); B=(n%2)?(n-2)*((c%3-1)*(-1)):(n-1)*-1; D(32); for(; ; ){ P(b,
|
||||
a,32); if((!a)&&A<0)if(!B){ A=0; B=1; } else A*=-1; if((!b)&&B<0)B*=-1; if(( a
|
||||
==(X-1))&&A>0)if(!B){ A=0; B=1; } else A*=-1; if(((b==(Y-1))&&B>0)||(L[a+A][b+
|
||||
B]!=32))break; a+=A; b+=B; P(b,a,c); move(0,0); refresh(); usleep(5000); } ++s
|
||||
; L[a][b]=c; c=C[random()%4]; p=0; f:for(S=1,x=0; x<X*Y; x++)for(A=-1; A<2; ++
|
||||
A)for(B=-1; B<2; ++B)for(n=0; n<4; n++){ a=E+n*A; b=F+n*B; if((!(a<X&&b<Y&&a>=
|
||||
0&&b>=0))||((L[a][b]!=C[n])&&((L[a][b]-9)!=C[n])))break; if(n==3)for(n=0; n<4;
|
||||
n++,S*=2)L[E+n*A][F+n*B]+=9; } if(S>1){ R; sleep(1); s+=S; for(x=0; x<X; x++ )
|
||||
do for(n=0,a=Y-1; a>=0; a--){ if(L[x][a]>84)n=1; if(n)L[x][a]=a>0?L[x][a-1]:32
|
||||
; } while ( n ) ; R ; goto f ; } } D ( c ) ; R ; } }
|
||||
@@ -0,0 +1,18 @@
|
||||
#include<stdio.h>
|
||||
#include<string.h>
|
||||
|
||||
main()
|
||||
{
|
||||
char*O,l[999]="'`acgo\177~|xp .-\0R^8)NJ6%K4O+A2M(*0ID57$3G1FBL";
|
||||
while(O=fgets(l+45,954,stdin)){
|
||||
*l=O[strlen(O)[O-1]=0,strspn(O,l+11)];
|
||||
while(*O)switch((*l&&isalnum(*O))-!*l){
|
||||
case-1:{char*I=(O+=strspn(O,l+12)+1)-2,O=34;
|
||||
while(*I&3&&(O=(O-16<<1)+*I---'-')<80);
|
||||
putchar(O&93?*I&8||!(I=memchr(l,O,44))?'?':I-l+47:32);
|
||||
break;
|
||||
case 1: ;}*l=(*O&31)[l-15+(*O>61)*32];
|
||||
while(putchar(45+*l%2),(*l=*l+32>>1)>35);
|
||||
case 0: putchar((++O,32));}
|
||||
putchar(10);}
|
||||
}
|
||||
@@ -0,0 +1,120 @@
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#define l #define
|
||||
#define p(p) l p b ( m p u X )
|
||||
|
||||
l i int
|
||||
l n struct n
|
||||
l x ){ return (
|
||||
l A ->
|
||||
l N n*
|
||||
|
||||
n { i c ; N L ; N R ; N U ; N ( * F ) ( N ) ; } ;
|
||||
|
||||
l F A F
|
||||
l U A U
|
||||
l R A R
|
||||
l L A L
|
||||
l m q = malloc(sizeof * q ) Z F =
|
||||
l e z F ( p ) ) ; }
|
||||
l f e N
|
||||
l g z L Q s f
|
||||
l h ( N p x
|
||||
l H h p L U Q
|
||||
l s R z R = q
|
||||
l t ) ? p : (
|
||||
l z , p
|
||||
l Z , q
|
||||
l Q = p
|
||||
l w ! p U t p U L Q z Q U ,
|
||||
l D W p R U = 0 z R Q R F ( p R ) z R F != E t
|
||||
l W h w
|
||||
l X z = q , 0
|
||||
l V w p F = v z L Q
|
||||
l O m o Z L Q
|
||||
l M m E Z A c =
|
||||
l r Z R Q
|
||||
l u Z U Q
|
||||
l a ) ) ) ? 0 : j ( !
|
||||
l k ( i c x
|
||||
l y 0 ) ; } i
|
||||
|
||||
N q ; N
|
||||
o H z Q L f
|
||||
v H U z Q L f
|
||||
K W V L R f
|
||||
J W V R f
|
||||
I h V R f
|
||||
#if 0
|
||||
Y W q Q g
|
||||
#endif
|
||||
S W w w O L L R r s , O L R r R R g
|
||||
E D p F Q L A c - p R A c ? J : K f
|
||||
P D w putchar ( p L R A c ) , m I g
|
||||
G W M getchar ( ) g
|
||||
p ;
|
||||
|
||||
i j k c ? O U r u U U X : y b k y d k y
|
||||
|
||||
l d(d) ( ( d a b
|
||||
l b(b) ( ( b a d
|
||||
l E(E) b ( M E u X )
|
||||
|
||||
main k i ) ! (
|
||||
|
||||
p (I)
|
||||
p (J)
|
||||
p (K)
|
||||
#if 0
|
||||
p (Y)
|
||||
#endif
|
||||
p (P)
|
||||
p (G)
|
||||
|
||||
p (S)
|
||||
l B b (S (K S) K)
|
||||
l SS b (B (B S) B)
|
||||
l C b (SS B S (K K))
|
||||
l CC b (B (B C) B)
|
||||
l BB b (CC B (B B B) B)
|
||||
|
||||
l Y b (S (C B (S I I)) (C B (S I I)))
|
||||
|
||||
l CI b (C I)
|
||||
|
||||
l ef E(EOF)
|
||||
l sp E(' ')
|
||||
l ob E('(')
|
||||
l cb E(')')
|
||||
l lm E('\\')
|
||||
l nl E('\n')
|
||||
l ht E('\t')
|
||||
l qs E('S')
|
||||
l qk E('K')
|
||||
l qi E('I')
|
||||
|
||||
l pair b (BB (B (B K)) C CI)
|
||||
l atom b (B K CI)
|
||||
|
||||
l bind b (CC B B C)
|
||||
|
||||
l ore b (SS (CI K))
|
||||
l gns b (Y (B (bind G) (CC S (C (ore sp (ore nl ht))) CI)))
|
||||
|
||||
l pr b (Y (CC C (BB CI (B (BB (bind (P ob)) K)) (SS C (CC C (BB BB bind) K) (C (CC bind) (K (P cb))))) P))
|
||||
|
||||
l trans b (Y (B (bind gns) (S (BB S (C lm) lam) (C (BB S (C ob) brac) (S (C cb (CI (atom sp))) (S (C ef (CI (atom sp))) (B CI atom)))))))
|
||||
|
||||
l brac b (S bind (B Y (C (BB B B bind) (S (BB S (BB S (S I)) (CC (BB (B K)) (BB K) pair)) (CC S (CC BB (BB C (C (CI sp)) CI)) pair)))))
|
||||
|
||||
l lam b (B (bind gns) (C (CC BB bind (B CI)) abs))
|
||||
|
||||
l abs b (Y (C (BB S (BB C CI) (SS S (BB C (BB B opt)) I)) (CC S (C C (atom qi)) (B (pair (atom qk)) atom))))
|
||||
|
||||
l make b (B pair (pair (atom qs)))
|
||||
|
||||
l opt b (S (S I (S (BB (CC B) CI (BB K K make)) (S (BB C (BB C (C (CI qk))) (SS (SS S) (S (BB (BB (S I)) S (BB (BB (CC B) CI) (BB K K) make)) (B (CC B (BB (CC C) (BB (C (CI qk)) (pair (atom qk))) pair)) make)) (B (C (BB B C (C (CI qi)))) make))) make))) (B K make))
|
||||
|
||||
(bind (bind trans pr) (P nl) I)
|
||||
|
||||
e
|
||||
@@ -0,0 +1,56 @@
|
||||
typedef void e();
|
||||
|
||||
e *w,*l,*u,*_o,*j,*t,*O,exit,b,c_,b_,a_,c,a,z_,x_,d,y_,_m;
|
||||
int q,m,_d,z,k,h,f[99];
|
||||
char y[26],_p[40][26],_q,r[2],*_,**s,*i,
|
||||
|
||||
*x[]= { "\n", ")", "if (", "}\n", ");\n\n", " ", ",&", "\"",
|
||||
",", " %%d", ";\n\n scanf(\"%%d", "%%d ", "else ", ",", "<",
|
||||
");\n", "printf(\"", "main()\n{\n int a" };
|
||||
|
||||
void g(){ O=j; printf(_); }
|
||||
void _j(){ O=_o; m=!m; h=h+m*(long)t; }
|
||||
void _u(){ O=g; _=x[0]; j=b; }
|
||||
void _r(){ O=g; _=x[1]; j=_u; }
|
||||
void _f(){ O=g; *r=y[k-1]; _=r; j=_r; }
|
||||
void _l(){ O=g; _=x[2]; j=x_; }
|
||||
void _c(){ O=(e*)h; }
|
||||
void n(){ O=_j; t=w; _o=_c; }
|
||||
void p(){ O=_j; h=0; t=l; _o=n; }
|
||||
void _b(){ O=p; q=*i+q*10-'0'; i=i+1; m=*i; w=_b; l=c; }
|
||||
void _s(){ O=g; _=x[3]; j=exit; }
|
||||
void v(){ O=p; z=z-1; m=z; w=z_; l=_s; }
|
||||
void _a(){ O=g; _=x[4]; *y=x[17][1]; z=0; j=b; }
|
||||
void _z(){ O=g; _=x[5]; j=p; k=k-1; m=k; w=_z; l=u; }
|
||||
void _h(){ O=g; _=x[6]; j=a_; }
|
||||
void _e(){ O=g; _=x[7]; k=0; j=_h; }
|
||||
void _t(){ O=g; _=x[8]; j=d; }
|
||||
void _g(){ O=g; _=x[7]; j=_t; k=0; }
|
||||
void _k(){ O=_z; k=f[z]; _q=y[k]; y[k]=y[k-1]; y[k-1]=_q; u=b_; k=z; }
|
||||
void d_(){ O=_k; y[z+1]=x[17][1]+z; f[z]=z+1; }
|
||||
void b (){ O=p; z=z+1; m=q-z; w=c_; k=z; l=_z; u=a; }
|
||||
void e_(){ O=g; _=x[9]; k=k+1; m=k<q; w=e_; l=_e; j=p; }
|
||||
void f_(){ O=g; _=x[10]; k=1; j=e_; }
|
||||
void g_(){ O=g; _=x[11]; j=p; k=k-1; m=k; w=g_; l=_g; }
|
||||
void h_(){ O=p; _p[z][k]=y[k]; k=k+1; m=k<=z; w=h_; l=d_; }
|
||||
void i_(){ O=p; y[k]=_p[z][k]; k=k+1; m=k<=z; w=i_; l=v; }
|
||||
void j_(){ O=i_; k=0; }
|
||||
void k_(){ O=p; m=k>1; w=_l; l=_u; }
|
||||
void l_(){ O=g; _=x[12]; j=k_; }
|
||||
void m_(){ O=g; _=x[13]; j=y_; }
|
||||
void n_(){ O=p; k=k+1; m=k<q; w=_h; l=_a; }
|
||||
void o_(){ O=g; _=x[14]; j=_f; }
|
||||
void c_(){ O=h_; k=0; }
|
||||
void p_(){ O=g; _=x[15]; j=v; }
|
||||
void b_(){ O=p; k=f[z]; m=k<=z; w=l_; l=k_; }
|
||||
void a_(){ O=g; *r=x[17][1]+k; _=r; j=n_; }
|
||||
void q_(){ O=p; k=k+1; m=k<q; w=m_; l=f_; }
|
||||
void c (){ O=g; r[1]=0; k=1; j=m_; }
|
||||
void a (){ O=g; k=z; j=g_; _=x[16]; }
|
||||
void z_(){ O=p; f[z]=f[z]-1; m=f[z]; w=_k; l=j_; }
|
||||
void x_(){ O=g; *r=y[k-2]; _=r; j=o_; }
|
||||
void d (){ O=g; *r=y[k]; _=r; k=k+1; m=k<z; w=_t; l=p_; j=p; }
|
||||
void y_(){ O=g; *r=x[17][1]+k; _=r; j=q_; }
|
||||
void r_(){ O=_b; _=x[17]; s=(char**)_d; s=s+1; i=*s; q=0; }
|
||||
main(v,c){ O=r_; _d=c;
|
||||
x: (O)(); goto x; }
|
||||
@@ -0,0 +1,70 @@
|
||||
%: define H(x) <st%:%:x##.h>
|
||||
#include H(dio)
|
||||
#include H(dlib)
|
||||
#include H(ring)
|
||||
|
||||
#define x ) == 0 ?__LINE__:0){O =__LINE__;break;} }
|
||||
#define X(x) __LINE__ x __LINE__
|
||||
#define t(a)\
|
||||
for (c = 0; c <n##a; ++c) { \
|
||||
if (strchr (a[c], 0[__FILE__])) { if (*a[c] == 0[__FILE__]) { \
|
||||
if (strcmp (a[c]+__LINE__, I + strlen (I) + __LINE__ - strlen (a[c]) x else { \
|
||||
if (strncmp (a[c], I, strlen (a[c])-__LINE__ x \
|
||||
} else { if (strcmp (a[c], I x }
|
||||
|
||||
#line 4 "info\0r"
|
||||
int
|
||||
main (int C, char **V)
|
||||
{
|
||||
FILE *H;
|
||||
int c, ne, nn, S = C < 2 ? 060 : *V[1];
|
||||
|
||||
char f[__LINE__][X(*)], K[X(*)], L[X(<<)],
|
||||
e[X(<<)][3*__LINE__], n[X(<<)][3*__LINE__], F[__LINE__];
|
||||
|
||||
if (freopen (__FILE__, 5+__FILE__, stdin) == 0) return __LINE__-13;
|
||||
for (c = 0;;) {
|
||||
#line 1 "#\n"
|
||||
if (!fgets (f[c], (int)sizeof *f, stdin)) return __LINE__; if (*f[c] == 0[__FILE__]) continue; if (*f[c] != __LINE__[__FILE__]) { f[c][strlen (f[c]) - __LINE__] = 2[__FILE__];
|
||||
++c;
|
||||
} else
|
||||
break;
|
||||
}
|
||||
for (ne = 0;;) {
|
||||
do {
|
||||
#line 1 "#%s%s"
|
||||
if (!fgets (L, (int)sizeof L, stdin)) return __LINE__; } while (*L == 0[__FILE__]); switch (sscanf (L, __LINE__+__FILE__, F, e[ne])) { default: goto O;
|
||||
case __LINE__: switch (strchr (F, S)!=0) case 1: ++ne;
|
||||
}
|
||||
}
|
||||
|
||||
O:
|
||||
nn = 0;
|
||||
while ((fgets (L, (int) sizeof L, stdin)) != 0) {
|
||||
|
||||
|
||||
char A[__LINE__], f3; if (*L == 0[__FILE__]) continue;
|
||||
#line 1 "%s%s %c"
|
||||
switch (sscanf (L, __FILE__, A, n[nn], &f3)) {
|
||||
case __LINE__: if (strchr (A, S)) ++nn; break;
|
||||
case __LINE__:
|
||||
if (strchr (A, S)) {
|
||||
#line 8 "<%s>:\n"
|
||||
char *I = L + __LINE__;
|
||||
int O = printf (__FILE__, n[nn]) +
|
||||
#line 2 "0gcc -ansi -E -dM -undef %s /usr/include/%s>r\0 ("
|
||||
sprintf (K, 1+__FILE__, f[S-*__FILE__] + __LINE__, n[nn]);
|
||||
O += system (K);
|
||||
if ((H = fopen (__FILE__+44, 44+__FILE__)) == 0) return 1;
|
||||
while ((fgets (L, (int)sizeof L, H)) != 0) {
|
||||
I[strcspn (I, 46+__FILE__)] = O = 0;
|
||||
#line 1 "*r"
|
||||
t (n) t (e)
|
||||
if (0 == O) O = puts (L);
|
||||
}
|
||||
nn = fclose (H);
|
||||
}
|
||||
}
|
||||
}
|
||||
return remove (1+__FILE__);
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
#define _POSIX_SOURCE /* you are not supposed to understand this */
|
||||
#define O(OOO,OO0,O00,O0O,OO,O0)\0##O0O%:%:OO\0##O0%:%:OOO\0##OO0%:%:O00
|
||||
#include<signal.h>
|
||||
static volatile sig_atomic_t One;
|
||||
#include<stdlib.h>
|
||||
#include<unistd.h>
|
||||
#define Zero(NULL)#NULL
|
||||
#define ONE(One) Zero(One)
|
||||
in??/
|
||||
t
|
||||
??=line 10 ONE(O(1,1,2,6,0,6))
|
||||
main (register zero, char **ONE)
|
||||
%:
|
||||
<% switch (sizeof __FILE__ < zero) case 1: return One /= zero;
|
||||
{ auto one = zero = atoi (ONE<:zero-1:>);
|
||||
do for (one += alarm (One |= (signal (__LINE__, (void(*)(register))main)
|
||||
!= SIG_ERR)); One; ++one);
|
||||
while (zero -= write (1, __FILE__+(one&1), 1));
|
||||
return write (1, 1+__FILE__+1, 1) != 1;
|
||||
%>}
|
||||
@@ -0,0 +1,61 @@
|
||||
%:define _POSIX_SOURCE
|
||||
#include<fcntl.h>
|
||||
#include<stdio.h>
|
||||
#include<unistd.h>
|
||||
#include<stdlib.h>
|
||||
#include<string.h>
|
||||
#include<sys/types.h>
|
||||
#include<sys/stat.h>
|
||||
#define D(N,t)Z t*N V<%t*z U M0*z); H z)u z; X}
|
||||
#define k(x,y)x<0||fstat(x,&y)||
|
||||
#define h(x)=open(x,O_RDONLY)
|
||||
#define b(x),(int)x.st_nlink
|
||||
#define B ;typedef g
|
||||
#define X exit (1);
|
||||
#define O .st_size
|
||||
#define U =malloc(
|
||||
#define Y S.st_ino
|
||||
#define v ;%>else
|
||||
#define W .st_dev
|
||||
#define o ||read(
|
||||
#define Z static
|
||||
#define g struct
|
||||
#define u return
|
||||
#define I char*
|
||||
#define V (M2)
|
||||
#define H if(
|
||||
#define _ ->
|
||||
|
||||
/* HE WHO SAYS */
|
||||
|
||||
Z I A<:32767/ M0(I )]; Z g stat S,T; Z size_t y B f{
|
||||
I n ; g f * x ; dev_t d ; ino_t i; } f B t{ M1 s,c; f
|
||||
*l; g t*L,*R; } t; D(a,t)D(E ,f)Z t*J(t*p,I n){ H! p){ p=
|
||||
a(); p _ s =S O; p _ c=1; p _ L=p _ R=0;
|
||||
p _ l= E(); p _ l _ n=n; p _ l _ x=0; p
|
||||
_ l _ d=S W; p _ l _ i= Y v H S O==p _
|
||||
s){ f* e; for (e=p _ l; e; e=e _ x) { H S W==e _
|
||||
d&&Y== e _ i) { u p; } } e=E(); e _ x=p _ l; e _
|
||||
n=n; e _ d =S W; e _ i=Y; p _ l=e; ++p _
|
||||
c v H S O< p _ s) { p _ L= J( p _ L,n)v{
|
||||
p _ R= J (p _ R,n ); } u p ; } Z int Q(
|
||||
I G,I F){ int d h(G),D h(F); I m,*M; H k(d,S )k(D,T )(y =S
|
||||
O)-T O){ y= 0; goto d; } H! (m U y))||!(M U y))o d ,m,y)-
|
||||
y o D,M,y)-y) X y=!memcmp( m,M,y); M5(m) ; M5(M ); d:V
|
||||
|
||||
close (d );V close(D); u y; } Z M2 C(M1 z,M1 N){ M1 i=N*(N-1)/2,
|
||||
j=1,s; I q,*e,* p,*w,*l; e=q= M4((size_t)i,1); H!e) X p=q+i; for(i=0; e-p
|
||||
; ++e){ H!*e&&Q (A[i:>,A[j])){ V printf("%""l""d" "\t""%" "s""\t" "%""s"
|
||||
"??/t" "%""c" "\11" "%""d" "??/t" "%""d" "\n", z,A[i]
|
||||
,A[j], S W -T W?'X' :'='b( S)b(T) ); H j -i-1) { s=N-
|
||||
i-3; w =e+s+1; l=q+N* (j-1)- j*(j-1 )/ 2 ; do{ *w
|
||||
=1; H w==l) break; w+= s; } while( s-->0); } } H++j ==N){ j=i+++
|
||||
2; } } M5(q); } Z M2 P(t*p ){ H p){ P(p _ R); H p _ c>1){ M1 i=0
|
||||
; f*l= p _ l; for (; i< p _ c; ++i ){ A[i
|
||||
]= l _ n; l=l _ x; } C (p _ s, p _ c); } P (p _
|
||||
L) ; } } int main V { t*r= 0; I F ; for (; ; )
|
||||
{ H!(F U 1024)) )X H ! fgets( F,1024 ,stdin) )break; *(F+(y
|
||||
=strlen(F))-1)= 0; H!( F=M3(F, y)))X H stat(F,&S)==0 &&S_ISREG(S.
|
||||
st_mode)&&S O )r=J(r ,F ); } H r)P(r ); u 0; }/* Obfuscated C
|
||||
|
||||
IS FREE THINKS MONEY GROWS ON DIRECTORY TREE */
|
||||
@@ -0,0 +1,20 @@
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int main(int a,char **A){FILE*B;typedef unsigned long C;C b
|
||||
[8]; if(!(a==7&&(B= fopen(1[A],"rb")))) return 1;for(7[b]=0
|
||||
;7[b]<5;7[b]++)b[7[ b]]=strtoul(A[2+7[b ]],0,16-!7[b]*6);5[
|
||||
b]=3[b] ; while ((6[b]= getc(B)
|
||||
)!=(C)- 1){if(2 [b])for (7[b]=0
|
||||
;7[b]<4 ;7[b]++ )if(((6 [b]>>7[
|
||||
b])^(6[ b]>>(7-7[b])))&1)6[ b] ^=(1
|
||||
<<7[b]) ^(1<<(7-7[b]));5[b] ^= 6[b]
|
||||
<<(0[b] -8);for(7[b]=0;7[b] <8;7[b]
|
||||
++)if(( 5[b]>>(0[b]- 1))&1)5
|
||||
[b]=(5[ b]<<1)^ 1[b]; else 5[
|
||||
b]<<=1; }5[b]&=((((C)1 <<(0[b]
|
||||
-1))-1) <<1)|1; if(2[b] )for(7[
|
||||
b]=0;7[ b]<(0[b ]>>1);7 [b] ++)
|
||||
if(((5[b]>>7[b])^(5 [b]>>(0 [b]-1-7 [b])))&1)5[b]^=((C)
|
||||
1<<7[b])^((C)1<<(0[ b]-1-7[ b]));5[ b]^=4[b];fclose(B);
|
||||
printf("%0*lX\n", ( int)(0[ b]+3)>> 2,5[b]); return 0;}
|
||||
Reference in new issue
Block a user