Home 
.
 About 
.

 

#include <stdio.h>

#define f ()
#define J return
#define l ae(
#define n e)
#define u d!=
#define F int 
#define y (j)
#define r m=
#define t +4
F d,z,C,h,P,K,ac,q,G,v,Q,R,D,L,W,M;
E(n{
*(char*) D++=e;
}
o (){
if( L){
h=*(char*) L++;
if( h == 2){
L=0;
h=W;
}
}
else h=fgetc(Q);
}
X (){
J isalnum(h)|h == 95;
}
Y (){
if( h == 92){
o ();
if( h == 110)h=10;
}
}
ad(){
F e,j,m;
while( isspace(h)|h == 35){
if( h == 35){
o ();
ad();
if( d == 536){
ad();
E(32);
*(int*) d=1;
*(int*)(d t)=D;
}
while( h!=10){
E(h);
o ();
}
E(h);
E(2);
}
o ();
}
C=0;
d=h;
if( X ()){
E(32);
M=D;
while( X ()){
E(h);
o ();
}
if( isdigit(d)){
z=strtol(M,0,0);
d=2;
}
else{
*(char*) D=32;
d=strstr(R,M-1)-R;
*(char*) D=0;
d=d*8+256;
if( d>536){
d=P+d;
if( *(int*) d == 1){
L=*(int*)(d t);
W=h;
o ();
ad();
}
}
}
}
else{
o ();
if( d == 39){
d=2;
Y ();
z=h;
o ();
o ();
}
else if( d == 47&h == 42){
o ();
while( h){
while( h!=42)o ();
o ();
if( h == 47)h=0;
}
o ();
ad();
}
else{
e="++#m--%am*@R<^1c/@%[_[H3c%@%[_[H3c+@.B#d-@%:_^BKd<<Z/03e>>`/03e<=0f>=/f<@.f>@1f==&g!='g&&*(int*)||#l&@.BCh^@.BSi|@.B+j~@/%Yd!@&d*@b";
while( j=*(char*) e++){
r *(char*) e++;
z=0;
while((C=*(char*) e++-98)<0)z=z*64+C+64;
if( j == d&(m == h|m == 64)){
if( m == h){
o ();
d=1;
}
break;
}
}
}
}
}
l g){
while( g&&g!=-1){
*(char*) q++=g;
g=g>>8;
}
}
A(n{
F g;
while( n{
g=*(int*) e;
*(int*) e=q-e-4;
e=g;
}
}
s(g,n{
l g);
*(int*) q=e;
e=q;
q=q t;
J e;
}
H(n{
s(184,n;
}
B(n{
J s(233,n;
}
S(j,n{
l 1032325);
J s(132+j,n;
}
Z(n{
l 49465);
H(0);
l 15);
l e+144);
l 192);
}
N(j,n{
l j+131);
s((e<512)<<7|5,n;
}
T y{
F g,e,m,aa;
g=1;
if( d == 34){
H(v);
while( h!=34){
Y ();
*(char*) v++=h;
o ();
}
*(char*) v=0;
v=v t&-4;
o ();
ad();
}
else{
aa=C;
r z;
e=d;
ad();
if( e == 2){
H(m);
}
else if( aa == 2){
T(0);
s(185,0);
if( e == 33)Z(m);
else l m);
}
else if( e == 40){
w ();
ad();
}
else if( e == 42){
ad();
e=d;
ad();
ad();
if( d == 42){
ad();
ad();
ad();
ad();
e=0;
}
ad();
T(0);
if( d == 61){
ad();
l 80);
w ();
l 89);
l 392+(e == 256));
}
else if( n{
if( e == 256)l 139);
else l 48655);
q++;
}
}
else if( e == 38){
N(10,*(int*) d);
ad();
}
else{
g=*(int*) e;
if(!g)g=dlsym(0,M);
if( d == 61&j){
ad();
w ();
N(6,g);
}
else if( u 40){
N(8,g);
if( C == 11){
N(0,g);
l z);
ad();
}
}
}
}
if( d == 40){
if( g == 1)l 80);
r s(60545,0);
ad();
j=0;
while( u 41){
w ();
s(2393225,j);
if( d == 44)ad();
j=j t;
}
*(int*) r j;
ad();
if(!g){
e=e t;
*(int*) e=s(232,*(int*) n;
}
else if( g == 1){
s(2397439,j);
j=j t;
}
else{
s(232,g-q-5);
}
if( j)s(50305,j);
}
}
O y{
F e,g,m;
if( j--== 1)T(1);
else{
O y;
r 0;
while( j == C){
g=d;
e=z;
ad();
if( j>8){
r S(e,m);
O y;
}
else{
l 80);
O y;
l 89);
if( j == 4|j == 5){
Z(n;
}
else{
l n;
if( g == 37)l 146);
}
}
}
if( m&&j>8){
r S(e,m);
H(e^1);
B(5);
A(m);
H(n;
}
}
}
w (){
O(11);
}
U (){
w ();
J S(0,0);
}
I y{
F m,g,e;
if( d == 288){
ad();
ad();
r U ();
ad();
I y;
if( d == 312){
ad();
g=B(0);
A(m);
I y;
A(g);
}
else{
A(m);
}
}
else if( d == 352|d == 504){
e=d;
ad();
ad();
if( e == 352){
g=q;
r U ();
}
else{
if( u 59)w ();
ad();
g=q;
r 0;
if( u 59)r U ();
ad();
if( u 41){
e=B(0);
w ();
B(g-q-5);
A(n;
g=e t;
}
}
ad();
I(&m);
B(g-q-5);
A(m);
}
else if( d == 123){
ad();
ab(1);
while( u 125)I y;
ad();
}
else{
if( d == 448){
ad();
if( u 59)w ();
K=B(K);
}
else if( d == 400){
ad();
*(int*) j=B(*(int*) j);
}
else if( u 59)w ();
ad();
}
}
ab y{
F m;
while( d == 256|u-1&!j){
if( d == 256){
ad();
while( u 59){
if( j){
G=G t;
*(int*) d=-G;
}
else{
*(int*) d=v;
v=v t;
}
ad();
if( d == 44)ad();
}
ad();
}
else{
A(*(int*)(d t));
*(int*) d=q;
ad();
ad();
r 8;
while( u 41){
*(int*) d=m;
r m t;
ad();
if( d == 44)ad();
}
ad();
K=G=0;
l 15042901);
r s(60545,0);
I(0);
A(K);
l 50121);
*(int*) r G;
}
}
}
main(g,n{
Q=stdin;
if( g-->1){
e=e t;
Q=fopen(*(int*) e,"r");
}
D=strcpy(R =calloc(1,99999)," int if else while break return for define main ")+48;
v =calloc(1,99999);
q=ac =calloc(1,99999);
P =calloc(1,99999);
o ();
ad();
ab(0);
J(*(int(*)f)*(int*)(P+592))(g,n;
}

Filename: otcc.txt Size: 4.28KB Added: 11.12.08 Hits: 14
Download

FileQuick - Copyright (C) 2008 Data Components Software Development
FileQuick is based off of QuickHost
QuickHost is copyright 2004 by Michael D, Ian S, and Rune AJM. All rights reserved.
Code highlighting powered by GeSHi.
Files are copyright by their respective owners.
We take no responsibility for files hosted here, nor any damage caused by any files you choose to download.
Should you, however, find any malious content, please contact us imidiately.

You can use this button to link to FileQuick:
FileQuick