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 2023-07-06 21:49:38 -07:00
1 parent cfd253683f
commit 2ba12ecc3c
320 files changed
+21365

No files matched your search

+321
View File
@@ -0,0 +1,321 @@
/*T } ¶ ;
ˆ
;

;
}
{ 
{ ;  ;
; 1 {
è { !
} {
; é ;
;
{

{ ]- } ; ; |
í ; Q
;
´ë ; ; ; "û }
} Ü; ; -ýl
}
} t dÀ ;
; +
t2 { ì ;
} 1; C
i
; = } ; ;

;
ì ; {
{ ê
} { � { ï } }
; . {
␍ { é } } ; 
{ ;
; /nÈ; 5
} ; Ú␍{ ; 
; { 1 ; } ; ¨ý } {
;  { ; . { ;  } ;  ;
; T ;
{
; ; Ä; ;  {
;
 { { ; ;
ì; ‘ ; ; ï; n!t }
; ì!; G; t;  ø; ¤ }  ;
;
} ; "; è# }
; 
{
; �$ {
;
; &
; d˜
{
¶;  {
; Sé'
{ d; ; è); �c
{
;  ;
; &ï*; ␍ ;
— {
;
$; ¢; ,; ; $ˆd } —; ˆ; ë/Î; Î
; a; Í ; {
} ; j; #è1;
 }
; Ä ; { ê5a; û␍ Ät { ï4a }
}
; £ ;
Û2; -
; 8
} ; }
; è8; ;  Ú6Q ; aÌ { ;  { ˆ
ì }
†; v:
{
?
}
{ ?
{ ; 4r
;
; v=b; Û
;
;
} ; 
; ; ; Þ { ú>
} }
{  ;
{ Õ`
}
;
;
!;
; 1; ; >; Ì } 1; X
; } p ;
;
; ; ; 
; ; 2 } ; vm
2; ;1íJ
;
; ; Ï }
; ÉJc; ›; d }
} ÞG; i }
; ; §F
{ vl¶þV; z
n
¶éOc; s
; ; ÑÞ;
 uh¶ëR } hRs; A cl,;
; ; Z;  {
x
lw¶êUch�{  }
} ; àîVc }
; Ž; >ÈD
; G ; ; †
;
îX; ’ˆ
;
; 2 }  { é[; 
{  }
; Þj; å; ë_; ␍y
; D; T; ; ?j; .n; ; ã {
; Ú]; !; Ë; 0a
} J ;
; ^; .
{ { { îc; ␍X ; ; ´;
J {
; ;
 } — { êf; 
; {
; ; : } { 
{
; (h} ␍ }
{  }
} ; ; { 
; ûD; Tì Cr; ␍; I; WèsÎWQ
; ;
×; W { û }
; ( ; ; }
} ;  {
; ÿn{ k; © ; ‚; ?; %Ùk;  ;
{ ïv;
3{ (; h {
; ; z
; ; ]{ ; ˜ïx; S; { * } ˜; z} ; î; 
{ ; ~
;
U; ö
; { ‡
; í~;
Ob } ; ò; UU; U{ -{ %Ú|1èƒ;
; Q
;
µ{ w{ š;  ;
 { í‡; ‚; ü�
…
} Ù†; ?; u
{
ƒ
} } ; » ; ´ ; ;  }
; è
{
; ;  }
; p ; ; ; Q; Ü�{ ; ; K; $ì“
p; 1}
4; $;
2Q ; }  {
; $î— } ; #;
T; 1
; ; +; ± } 
; ;
. ; { 
{ ; š{
  ;
{
; ;  }
; { [ { ; £{ ; �; 0{ 
{ ôr ; éŸ
;
} =; w
?; ;
ä; B®lwx
; h�h
} ; pj
; ; ; ö { û§; 'n
; ; { ) {
; ú¤;
;
Q
; f; 'r
{
? { ë¬; %lÂf}
; ~©{ qÛ¨; 
{
 { ÿ­; ÂÛ¬{ œÚžl,u
; & ;
{ í; G } 
; k
;  }
; 
{
; hR; ; Wß´; 
} ;
; ; —e; Z; ž{ N; =
} ; <
{ ]- Bšretur; ¡if
else
whil; do; nt
char
{ ; { pu{  }
{ ; =
} B
} {
; ø¿`ˆ; dÀ; ´ } �
} } ; ø`; waÌ { •ma; >
{ ; oJ
} ÈD
{  ; ; ; · ;

; Á ; ; ;  ; ; 
{ 
; ; €Õ; @ë ; Á; L {
; ØÈ ;
*/int m[Z];
#define U(x)s--;T=x
#define C(l,s)I(o==l){s;}E
#define Q(l,o)C(l,r=P;T=T o r)
#define O(l,o)C(l,T=o T)
#define H(l,s)C(l,U(s))
int
main(){int*q,s,f,r,o,l,p,c,b;
char*d;
d=" \t\n;{}\0AÊP€³²‰Š@ɵ�gEÏͱ°Œ0�Ž‹q";
b=256;
q=m;
g;
o=g;
c=g;
c=c+g*b;
p=c;
I(o){W(p){o=g;
C(59,r=2)C('{',r=5)C('}',r=8)r=0;
I(r){r=r+g%4;
l=1-g-r;
W(r--){*q=q[l];
q++;
p--;
}}E{I((o==32)+(o==9)+(o==10)){r=g;
o=o%4+(r+(r==123))%8*3;
I(8<o)o=o+g%4*9;
o=d[o]+b;
}*q++=o%b;
p--;
}}W(g!=12);
g;
}E{W(p--)*q++=g;
}s=Z;
p=0;
W(1){o=L;
O(17,!)O(18,-)Q(12,+)D C(10,r=T;
s=f;
p=X 1];
f=X 2];
l=X 3];
R)C(22,s++)C(27,return T)C(21,r=T;
U(r))C(23,T=m[T])C(19,T=m[T]++)C(25,T=m[T]--){l=o%16;
o=o/16;
I(l==7){l=B;
l=l+B*b;
}E I(7<l)l=l+B*8-1;
H(2,f+l)H(4,f-l-4)H(3,m[f+l])H(5,m[f-l-4])H(6,c+l)H(7,m[c+l])H(12,l)H(8,l)C(9,U(p);
p=p+l)C(11,r=X-l/2];
I(r<3){I(r)r=putchar(T);
E
r=g;
R;
}E{X 1]=p;
X 2]=f;
X 3]=l;
f=s;
s=s-19;
p=r;
})C(13,p=l)C(15,I(P)p=l)C(14,I(!P)p=l);
}}}
+19
View File
@@ -0,0 +1,19 @@
#include<stdlib.h>
#include<stdio.h>
main(I,O,O0,OO,l)
int I,O0,OO,l;
char **O;
{
return !!I>=I?!I>=I?!!~I>=~I?!~I>=~I?!OO?!I:OO%2?
OO=main(I,O,O0,OO>>!!OO,l),
OO=main(I-!I-!!I,O,OO,OO,l),
OO=main(I-!I-!!I,O,O0,OO,l),
!(OO-!I||I)?l-1:OO
:(OO=main(I,O,O0,OO>>!!OO,l),
!(OO-l+!I||I)?l-1:main(I-!I-!!I,O,OO,OO,l))
:(O0+OO)%l
:main(I-I/I-I/I,O,O0,OO+OO/OO,
main(0,O,O0,OO,I-I-I)+I+1?1:printf("%d ",I-I-I)+fflush(stdout))
:main(I-I-I-I-I,O,I+I-I+I,I,0)
:main(~!!I-!!I,O,atoi(1[O]),1,atoi(0[O]));
}
+8
View File
@@ -0,0 +1,8 @@
float s=1944,x[5],y[5],z[5],r[5],j,h,a,b,d,e;int i=33,c,l,f=1;int g(){return f=
(f*6478+1)%65346;}m(){x[i]=g()-l;y[i]=(g()-l)/4;r[i]=g()>>4;}main(){char t[1948
]=" `MYmtw%FFlj%Jqig~%`jqig~Etsqnsj3stb",*p=t+3,*k="3tjlq9TX";l=s*20;while(i<s)
p[i++]='\n'+5;for(i=0;i<5;i++)z[i]=(i?z[i-1]:0)+l/3+!m();while(1){for(c=33;c<s;
c++){c+=!((c+1)%81);j=c/s-.5;h=c%81/40.0-1;p[c]=37;for(i=4;i+1;i--)if((b=(a=h*x
[i]+j*y[i]+z[i])*a-(d=1+j*j+h*h)*(-r[i]*r[i]+x[i]*x[i]+y[i]*y[i]+z[i]*z[i]))>0)
{for(e=b;e*e>b*1.01||e*e<b*.99;e-=.5*(e*e-b)/e);p[c]=k[(int)(8*e/d/r[i])];}}for
(i=4;i+1;z[i]-=s/2,i--)z[i]=z[i]<0?l*2+!m():z[i];while(i<s)putchar(t[i++]-5);}}
+59
View File
@@ -0,0 +1,59 @@
#define fine #define de #define/**/ /**/*#define*/
#define de #define
#define do de
do { begin
do you like (green eggs and ham++)?
do you eat them: in a box?
do you eat them with a fox?0
do } end
fine
fine, just fine.
/*@@@@@@@@@@@@=___
/@@@@@@@@@@@@@@@@@@@a
@@@@@@@@@@@@@@@@@@@@@
|@@@@@@@@@@@@@@@@@@@@
@@@@@@@@@@@@@@@@@@@@
\@=~ ~~@@@/
\ /
\ |
/@@@@@===__ |
@@@@@@@@@@@@==/
/@@@@@@@@@@@@@@
@@@@@@@@@@@@@@@
/ ~~~====@@@@@@
/ ~~~/
| /
/____ |
@@@@@@@@=====__/
@@@@@@@@@@@@@@@@
/@@@@@@@@@@@@@@@
/@@@@@@@@@@@@@@@|
___/ ~~~~@@*/
char groo(p,q)int p;int q;{return
((char) (--q*q+ (p/10)*q+--p))
; }void grem /**/ (){ int x=0
; printf(" ")
;/**/ /**/ for(;x<16
; x++)printf
( "%c",groo(x
, 8)) ;printf
( "\n\n")
; }void cred(a
) int a;{int
x=0;printf
( "%c "
, /*_____===~*/ groo(a,8))
; for(;x<16
; x++)printf
( "%c",(char)
a*16+ x);printf(
"\n");}main(a
,b)int a;
char **b ;{int x=2;
do(x=0;x<4;x++)exit(0);
for(grem();x<1<<3+(int)b[0]
[0]%2;)cred (++x-1);}
+49
View File
@@ -0,0 +1,49 @@
#define x char
#define z else
#define w gets
#define r if
#define u int
#define s main
#define v putchar
#define y while
#define t " A?B?K?L?CIF?MSP?E?H?O?R?DJG?NTQ?????U?V?????X???????Z????W??Y??"
s ( ) { x* c , b[ 5 * 72 ]; u a, e , d [ 9
*9 *9 ] ; y (w ( b) ){ r ( 0 [ b] -7 *
5 ) { c = b ; y ( (* c - 6
* 7 )* * c )c = c+ 1 ; r (( -0 ) [ c ] && w ( b +
8 * 5* 3 ) && w (b +8 *5 * 6) )
{ a = 0; y ( a [ b ]
) { a [ d ] = ! ! ( a[ b] - 4 *8 ) ; a = a +
1; } y (a < 8 * 5 * 3 ) d [ ( a ++ )
] = 0 ; a = 0; y( b [
a + 8 *3 * 5 ] ) { d [ a ] = a [ d] + ! !( b[
a+ 40 * 3 ] -4 * 8) * 2 ; ++ a ; } a =
0 ; y ( a [ b + 6 * 40 ]
) {a [d ] += ! ! ( b[ a + 5 * 6 * 8 ] - 4 *
8 ) * 4; a = a + 1 ;} a= 0; y (a <3 *8
*5 ) { r ( a [ d ] ) { e
= 1 ; y ( e[ a + d] ){ * ( d+ a+ e ) = a[ d
+e - 1] +( d [ a + e ] << ( 3* e) ) ;e
= e + 1 ;} a = a +
e - 1 ; v( !! ( * ( d+
a) % ( 64 ) - 12 * 5
) + ( e
> 4 ) ?t [ e >2 ? 2 :a [ d ] ] :6 * 8 +( t [ d[
a ]/ 8 /8 ] -4 ) %( 10 ) ) ; r( ! (2 [a
+ d] + 3 [d + a ] ) ) v ( 4 * 8 )
; } a = a + 1 ; } v (5 * 2 ) ; } z {c =b ; e
= 0 ; y (* c ) { * c += - (* c > 8 * 12
) * 32 ; a = 8 * 8 ; r (* c
>= 48 &&* c<8 *8 -6) {*c =( * c + 1
) %( 5 * 2 ) + 65 ;y( --a >0 &&*
c- a[ t] ); d[ (e ++ )] =4 ;(
* ( d + (e ++) ))= 07 ;}z y(a -- >1
&&* c- t[a ]); d[ ( e = e + 1) -
1] =a %8 ;y (a /= 8) d[ (e ++
) ] = a% 8 ; ++ c ; * ( e ++ +d ) =0
;} -- e ;r ( e >0 ) {a = 1 ;
y ( a< 8 ) { c = b ;y
( c <e +b ) { v ( * ( c - b + d )& a? 6 *7
:8 * 4 ) ; c ++ ;} a= a + a ; v ( 2*
5) ; } v ( 5* 2 ) ; }} }} }
+18
View File
@@ -0,0 +1,18 @@
#define O B F U S C A T E D
#define I 8;}t(p){r(p?W:o);XClearWindow(V,m);}main(i,f)char**f;{M((T(h=f),
#define K Y(o,XMapRaised(V,e);)x=3;x--;)for(y=3;y--;r(G))XMapRaised(V,R[D]
#define N z(x+i,(z(H-x-i,x),x)))x<i||z(x-i,x)|z(H-x+i,x)Y(W,)l=k;l>20&&l>x
#define XIMOfIC Z;XID(*w)()=XCreateWindow,m,e,o[2],W[2],G[2],R[2][O]);}GC*g
#define E (++D)));}r(XID*z){XSetWindowBackgroundPixmap(V=d[D],m=R[D][x][y],z[
#define L ;XStoreName(V,e=w(V,RootWindow(V,s),0,0,152,152,2,0,1,0,0,0),"II"+D
#define B 3][3];Display*V,*d[2];char**h,k=25,b[2500],H=50,D,s,x,y,i;T(){float
#define S +k),z(k-P=w(V,e,H*x,H*y,H,H,1,0,1,0,2048,&c));}XEvent J;M(){XFlush(
#define Y(z,y) ;for(z[D]=XCreatePixmapFromBitmapData(Q,x=0,H*H);x<H;x++)y for(
#define A x][y]&&!b[x+k*y]++?t(D),t(!(D^=1)):D);M();}z(x,y){b[x/8+y*7]|=1<<x%I
#define P x,y)-z(y,x+k)+z(y,k-x)*z(x+k,y=H-y),z(k-x,y),z(y,k-x),z(y,k+x)K[x][y]
#define Q V,e,b,H,H,BlackPixel(V,s),WhitePixel(V,s),DefaultDepth(V,s)),memset(b
#define C d[!D]);x=3;for(XNextEvent(V,&J);x--;)for(y=3;y--;J.xany.window==R[D][
#define F l;XSetWindowAttributes c;s=XDefaultScreen(V=d[D]=XOpenDisplay(*(h+=!!
#define U *h)))L)Y(G,)i=c.event_mask=4;i--;x+i>H||N;l-=.5)z(x+k,y=sqrt(l*l-x*x)
#include <math.h>
#include <X11/Xlib.h>
+119
View File
@@ -0,0 +1,119 @@
#include T
#include Y
H W[] = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 }
,u[] = { 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51,
59, 67, 83, 99, 115, 131, 163, 195, 227, 258 } ,P[] = { A A 1, 1, 1, 1, 2,
2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0 } ,Q[] = { 1, 2, 3, 4, 5, 7, 9,
13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049,
3073, 4097, 6145, 8193, 12289, 16385, 24577 } ,L[] = { A 1, 1, 2, 2, 3, 3,
4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13 }, y, C, t,
Z[320], b[17], G[17]; H long j; H char S[K]; n { n *o, *O; H l; } F, *V, *h,
*I, **e;
H U H l, H O)
{
H w = 0, o, f, q; J !O) { ; {
U 24, 1); o = U 8, 1); U 24, 1); U 24, 1); {
J o & 4) { ; X q = U 16, 1); q--; U 8, 1)); } ; {
X; o & 8 && U 8, 1); ) { ; ;
}
}
X; o & 16 && U 8, 1); );
o & 2 && U 16, 1);
}
X o = 0; !o; ) { ;
{
o = U 1, 1); q = U 2, 1); J
q || U 8, 7)) { ; { ; { ; } ; ; ;
q & 1 && U 7, 8);
q & 2 && U 3, 9); U 5, 6);
I = V; U 2, 4); I = h; U 9, 4); } ; }
} ; ; { ; } ; { ; } ; { ; } ; { ; }
}
X; (C M) != (t M); N (C++[S])); } ; }
s 6)
{
; { ; { ; } X; (O = U 6, (I = V, 3) )) != 256; )
J O > 256 || (U O, 2), 0)) { ; {
O -= 257; l = u[O] + U P[O], 1);
I = h; O = U 5, 3); O = Q[O] + U L[O], 1);
O = O <= t ?
t - O : K - O + t; X; l--; O M) U S[O++], 2) ; } ; }
}
;} s 3) {
; { X; I->o; I = U 1, 1) ? I->O : I->o); w = I->l; } ;
} s 5) { ; { X O = 17; O--; O[b] =
0); X O++; O < l;
O++[Z][b]++);
X *b = *G = O = 0 ; O < 16; O++) { ; {
G[O+1] = (O[G] + b[O]) << 1; ; }
}
X I = 0, O = 0; O < l; O++) J Z[O]) { ;
{
X e = (q = O[Z][G], Z[O][G]++,
o = Z[O], &I); o-- && (*e || ((*(*e = R) = F), 1));
e = ((q >> o) & 1) ? &(*e)->O : &(*e)->o);
*(*e = R)
= F; (*e)->l = O; } ; } } ; } s 2) { ; {
t++[S] = l; (t M) == (C M)
&& N (C++[S]); } ; } s 8) { ; {
X O = 288; O--; Z[O] = O < 144 ? 8
: O < 256 ? 9 : O < 280 ? 7 : 8); V = (U 288, 5),
I); { ; { X O = 32; O--;
Z[O] = 5);
}
}
h = (U 32, 5), I); } ; } s 1 && l)
{
; { { ; } ; { ; } ; { ; } ; { ; }
X; y < l; y += 8)
j |= 0l + D << y; w = j
& (1 << l) - 1;
j >>= l; y -= l; } ; } s 7) { ; { y % 8 && U y % 8, 1);
X O = U 16, 1), U 16, 1); O--; U U 8, 1), 2));
} ;
}
s 9) { ; {
H p = U 5, 1) + 257, z = U 5, 1) + 1, v = U 4,
1) + 4; { X O = 0; O < v; O++[W][Z] = U 3, 1));
X; 19 > O; W[O++][Z] = 0); { ;
}
}
V = (U 19, 5), I);
{
X l = O = 0; O < (p + z); ) {
I = V; o = U 3, 3); f = o == 16
? (o = l), 3 + U 2, 1) : o == 17 ?
(o = 0), 3 + U 3, 1) : o == 18 ? (o = 0),
11 + U 7, 1) : ((l = o), 1); X q = f; q--;
O++[Z] = o); ; ; ; ; ; { ; }
}
I = V;
{
U 9, 4); }
V = (U p, 5), I);
X O = z; O--;
Z[O] = Z[O+p]);
h = (U z, 5),
I); } ; ; ; } ; ; ; } s
4) { ; ; ; { n *
i = I; i && (
I = i->o, U 7, 4),
I = i->O,
free (i), U 1, 4));
} ; }
return w;
}
main ()
{
return B (3, 0);
}
+33
View File
@@ -0,0 +1,33 @@
#define _POSIX_SOURCE
#include <time.h>
#include <stdio.h>
#define extern/* ioccc*/
#define condition 22+d+e> 31
#define declarator main ( void )
#define keyword ae(t,d+e-9); ae(m,4)
#define false ae (t, d+ e+ 22); ae (m,3)
#define syntax_error(n); } else if (J < n) {
#define relational_expression(i, o, ccc) i o ccc
#define errno translation_unit/*Apollo 13*/int errno
#define iterative_statement for ( expressions ) block
#define translation_unit declarator compound_statement
#define ae(unary_expression,ae) unary_expression= ae
#define declaration char T[16]; struct tm ae(s,{ 0})
#define if_part {macrolist list ae(b,J%4); type_name
#define tokens if (t==25&&d==28 &&a > 10) ae (t, 18)
#define selection_statement(a,b,c) if(a){b; } else{ c; }
#define storage_class ae(e,(2*b+4*c+6*d+N)%7); statement
#define statement_list iterative_statement return'^'^'^'
#define macro(x,y,cast) ae(M,x); ae(N,y)syntax_error(cast)
#define block { if(relational_expression(J,<,1700))if_part;}
#define declaration_list int J,a,b,c,d, e,t,m,M,N; declaration
#define true keyword; selection_statement(t==26,ae(t,19),tokens)
#define compound_statement { declaration_list ; statement_list ; }
#define expressions ae(J,1582); relational_expression(J,<,2200); ++J
#define list macro (24, 5, 2200) ae(M, 24); ae(N, 6); } ae(a, J % 19);
#define type_name ae (c, J % 7);ae (d, (19 * a + M) % 30); storage_class
#define statement selection_statement ( condition,true,false)pptoken cast
#define macrolist macro(22,2,1800)macro (23, 3,1900) macro (23, 4, 2100)
#define pptoken ae(s.tm_year,J-1900);ae (s.tm_mon,m-1); ae(s.tm_mday,t);
#define cast (void)strftime(T,sizeof T, "%a %b %d %Y",&s),(void)puts(T);
#include <errno.h>
+98
View File
@@ -0,0 +1,98 @@
#define C " "
#define O( _ ) # _
#define R( n , d ) e ( n , d )
#define e(p,o)o##p
#define D O ( % ) O ( l ) O ( d )
#define U R ( e ( g , n ) , e ( o , l ) )
#define M H ( R ( e ( c , i ) , t ) , R ( e ( a , t ) , s ) )
#define P H ( R ( e ( f , t ) , n ) , R ( e ( i , r ) , p ) ) (
#define H(O,r)R(O,r)
#include<stdio.h>
H ( R ( e ( f , e ) , e ( d , e
) ) , R ( e ( p , y ) , t ) ) H
( R ( e ( t , c ) , u ) , R ( e
( r , t ) , s ) ) { U n , t ; }
F ; H ( R ( e ( f , e ) , e ( d
, e ) ) , R ( e ( p , y ) , t )
) H ( R ( e ( d , e ) , e ( n ,
g ) ) , R ( e ( i , s ) , e ( n
, u ) ) ) U B ; M F I [ 4 * 5 ]
, w [ 4 * 5 ] , p [ 4 ] = { { 9
, 1 } , { 1 , 1 } , { 1 , 1 } ,
{ 6 * 7 , 1 } } ; M R ( e ( t ,
n ) , i ) J ; M R ( e ( d , i )
, e ( o , v ) ) o ( F f ) { e (
f , i ) ( f . t - 1 ) { J = P D
O ( / ) D , f . n , f . t ) ; }
R ( e ( e , s ) , e ( l , e ) )
{ J = P D , f . n ) ; } } M R (
e ( d , i ) , e ( o , v ) ) n (
F * f ) { U a = ( * f ) . n , b
= ( * f ) . t ; e ( f , i ) ( b
) { H ( R ( e ( e , l ) , i ) ,
e ( h , w ) ) ( a ) { U i = b %
a ; b = a ; a = i ; } b = b < 0
? - b : b ; ( * f ) . n e ( = ,
/ ) b ; ( * f ) . t e ( = , / )
b ; } } R ( e ( t , n ) , i ) R
( e ( n , i ) , e ( a , m ) ) (
R ( e ( t , n ) , i ) a , R ( e
( r , a ) , e ( h , c ) ) * v [
] ) { B m , W ; R ( e ( t , n )
, i ) i , c ; R ( e ( r , o ) ,
f ) ( i = 1 ; i < 5 ; i = i + 1
) { e ( f , i ) ( a > i ) { J =
H ( R ( e ( f , n ) , a ) , R (
e ( c , s ) , s ) ) ( v [ i ] ,
D O ( / ) D , & p [ i - 1 ] . n
, & p [ i - 1 ] . t ) ; } n ( p
+ i - 1 ) ; } I [ 0 ] = p [ 1 ]
; R ( e ( r , o ) , f ) ( i = 0
; i < p [ 0 ] . n ; i = i + 1 )
{ I [ i + 1 ] . n = I [ i ] . n
* p [ 2 ] . t + p [ 2 ] . n * I
[ i ] . t ; I [ i + 1 ] . t = I
[ i ] . t * p [ 2 ] . t ; n ( I
+ i + 1 ) ; } R ( e ( r , o ) ,
f ) ( W = ~ ( ~ 0 e ( < , < ) p
[ 0 ] . n * 2 ) ; ~ ( B ) 0 - W
; W = W - 1 ) { w [ c = 0 ] = I
[ 0 ] ; R ( e ( r , o ) , f ) (
m = W , i = 1 ; ! ( i > p [ 0 ]
. n ) ; i = i + 1 , m = m / 4 )
{ e ( f , i ) ( ( m & 3 ) < 2 )
{ e ( f , i ) ( m & 1 ) { w [ c
] . n e ( = , * ) I [ i ] . t ;
e ( f , i ) ( ( w [ c ] . t e (
= , * ) I [ i ] . n ) < 0 ) { w
[ c ] . n e ( = , * ) - 1 ; w [
c ] . t e ( = , * ) - 1 ; } } R
( e ( e , s ) , e ( l , e ) ) {
w [ c ] . n e ( = , * ) I [ i ]
. n ; w [ c ] . t e ( = , * ) I
[ i ] . t ; } } R ( e ( e , s )
, e ( l , e ) ) { w [ c = c + 1
] = I [ i ] ; } } R ( e ( r , o
) , f ) ( m = W , i = c = 0 ; i
< p [ 0 ] . n ; i = i + 1 , m =
m / 4 ) { e ( f , i ) ( ( m & 3
) > 1 ) { w [ 0 ] . n = w [ 0 ]
. n * w [ c + 1 ] . t + ( ( m &
1 ) ? - 1 : + 1 ) * w [ c + 1 ]
. n * w [ 0 ] . t ; w [ 0 ] . t
= w [ 0 ] . t * w [ c = c + 1 ]
. t ; } } n ( w ) ; e ( f , i )
( ! p [ 3 ] . t e ( | , | ) ( !
( p [ 3 ] . n - w [ 0 ] . n ) e
( & , & ) ! ( p [ 3 ] . t - w [
0 ] . t ) ) ) { R ( e ( r , o )
, f ) ( m = W , i = 0 ; i < p [
0 ] . n ; i = i + 1 , m = m / 4
) { o ( I [ i ] ) ; J = P C O (
% ) O ( c ) C , O ( * ) O ( / )
O ( + ) O ( - ) [ m & 3 ] ) ; }
o ( I [ i ] ) ; J = P C O ( = )
C ) ; o ( w [ 0 ] ) ; J = P O (
% ) O ( c ) , e ( 0 , 1 ) ) ; }
} H ( R ( e ( n , r ) , u ) , R
( e ( t , e ) , r ) ) J - 1 ; }
+116
View File
@@ -0,0 +1,116 @@
static char Asm = 'm'
;
#include\
<assert.h>
typedef unsigned long LOGO
;
#include\
<stdio.h>
static void new (char *, LOGO)
;
#include\
<stdlib.h>
#define Pascal (void)printf
#include\
<unistd.h>
static void new (char *Oberon
, LOGO awk)
{ Pascal ("%s to %calloc %luM+%luK+%lu bytes"
, Oberon
, Asm
, awk >> (__LINE__ - 1)
, (awk & 0xffc00) >> (1+sizeof __TIME__)
, awk & 1023)
; } typedef size_t BCPL
; static BCPL far = 0
, Lisp = ~(BCPL)0^(
~ (BCPL)0>>1)
;
#define B\
( C)case SIG##C\
: (void)puts(\
# C)\
; break\
;
int main (int, char**)
;
#define Alloc switch (Asm) { case 'c'\
: Basic = calloc (far\
, 1)\
; break\
; default\
: Basic = malloc (far)\
; }
#include\
<time.h>
static int inline(void)
;
#include\
<float.h>
int main (int F77
, char **F90)
{ switch (F90[--F77][0] == 'c') case 1
: Asm += 'c' - Asm
; switch (setbuf (stdout
, 0)
, fork()) { char *Basic
; case -1
: assert (0)
; break
; case 0
: for (
; far
#include\
<iso646.h>
or_eq Lisp, Lisp not_eq 0
; Lisp >>= 1) { new ("Trying"
, (LOGO) far)
; Alloc switch (Basic not_eq 0) { case 1
: Pascal ("..YEP\n")
; free (Basic)
; break
; default
: Pascal ("..nope\n")
; far and_eq compl Lisp
; } } Alloc assert (Basic not_eq 0)
; new ("Able"
, (LOGO) far)
; (void) putchar ('\n')
; for (Lisp = 0
; Lisp < far
; Lisp += 1 << 10) { time_t COBOL = time (NULL)
; Basic[Lisp] = '\a'
; Pascal ("\r%lu kilo bytes ok "
, (LOGO) (1 + (Lisp >> 10)))
; switch (difftime (time (NULL)
, COBOL) - 5 > FLT_EPSILON) { case 1
: free (Basic)
; return 1
; } } free (Basic)
; return 0
; } return inline()
; }
#include\
<signal.h>
#include\
<sys/wait.h>
static int inline (void) { int PL1
; switch ((void) wait (&PL1)
, WIFSIGNALED (PL1)) { int Algol
; default
: Algol = WTERMSIG (PL1)
; Pascal (" %calloc lied! Killed by SIG"
, Asm)
; switch (Algol) { B(KILL) B(SEGV) default
: Pascal ("NAL %d\n"
, Algol)
; } break
; case 0
: WEXITSTATUS(PL1)==1
? Pascal (" %calloc lied! Thr\aashing\n"
, Asm)
: Pascal ("no overcommit\n")
; } re\
turn PL1
;
}
+1
View File
@@ -0,0 +1 @@
main(h,m)char**m;{for(time(*m);h/=2;)m[4][m[h][h[(int*)localtime(*m)]]]=m[3][h];puts(m[4]);}