mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add preview of 1984-2019

Browse Source 
The 2020 winners are hinted it, but the source code is not there,
nor are the hints. Someone could look into the HTML and
see what was commented out, but that is not a problem because
WHO won is known and the name of their AWARD is known already.
Moreover a number of the winners have talked about what their
entirs do, so the commented out spoiler text is not a bit problem.

One will find HTML commented out with:

    <!-- XXX remove when 2020 is ready
    2020 links here
    XXX remove when 2020 is ready -->

The "XXX remove when 2020 is ready" string is found at the
start and end comment blocks.  Again, soneone could read
what was commented out, but that is OK since most of that
information is known or can be known.  The following files
have such HTML comment blocks in them.

    ./winners.html
    ./years-spoiler.html
    ./years.html

In addition, ./all/summary.txt was modified to not
include the 2020 entries for the momemt.

The 2020 winner code AND write-ups are NOT part of this set.

p.s. The all/all.tar.bz2 does not contain the 2020 source code (yet?).
This commit is contained in:
Landon Curt Noll committed 2020-12-30 16:57:03 -08:00
1 parent 28efc67f5d
commit c0663537cb
1683 files changed
+220064
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2012/zeitak/Makefile
+210
View File
@@ -0,0 +1,210 @@
#!/usr/bin/env make
#
# 2012 makefile
#
# This work by Landon Curt Noll, Simon Cooper, and Leonid A. Broukhis
# is licensed under:
#
# Creative Commons Attribution-ShareAlike 3.0 Unported License.
#
# See: http://creativecommons.org/licenses/by-sa/3.0/
################
# tool locations
################
#
SHELL= /bin/bash
CP= cp
CPP= cpp
GUNZIP= gunzip
LD= ld
MAKE= make
RM= rm
SED= sed
TAR= tar
TRUE= true
# Set X11_LIBDIR to the directory where the X11 library resides
#
X11_LIBDIR= /usr/X11R6/lib
# Set X11_INCLUDEDIR to the directory where the X11 include files reside
#
X11_INCDIR= /usr/X11R6/include
# Compiler warnings
#
#CWARN=
CWARN= -Wall -W
#CWARN= -Wall -W -pedantic
# compiler standard
#
#CSTD=
#CSTD= -ansi
CSTD= -std=c99
# compiler bit architecture
#
# Some entries require 32-bitness:
# ARCH= -m32
#
# Some entries require 64-bitess:
# ARCH= -m64
#
# By default we assume nothing:
#
ARCH=
# optimization
#
# Most compiles will safely use -O2. Some can use only -O1 or -O.
# A few compilers have broken optimizers or this entry make break
# under those buggy optimizers and thus you may not want anything.
#
#OPT=
#OPT= -O
#OPT= -O1
OPT= -O2
#OPT= -O3
# Libraries needed to build
#
LIBS=
# default flags for ANSI C compilation
#
CFLAGS= ${CWARN} ${CSTD} ${ARCH} ${OPT} ${LIBS}
# ANSI compiler
#
# Set CC to the name of your ANSI compiler.
#
# Some entries seem to need gcc. If you have gcc, set
# both CC and MAY_NEED_GCC to gcc.
#
# If you do not have gcc, set CC to the name of your ANSI compiler, and
# set MAY_NEED_GCC to either ${CC} (and hope for the best) or to just :
# to disable such programs.
#
CC= cc
#CC=clang
MAY_NEED_GCC= gcc
##############################
# Special flags for this entry
##############################
#
ENTRY= zeitak
DATA= zeitak_deobfucate.c incorrect.c
ALT_OBJ= zeitak.orig.o zeitak_deobfucate.o
ALT_ENTRY= zeitak.orig zeitak_deobfucate
#################
# build the entry
#################
#
all: ${ENTRY} ${DATA}
@${TRUE}
${ENTRY}: ${ENTRY}.c
${CC} ${CFLAGS} $< -o ${ENTRY}
# alternative executable
#
alt: ${ALT_ENTRY}
@${TRUE}
zeitak.orig: zeitak.orig.c
${CC} ${CFLAGS} $< -o $@
zeitak_deobfucate: zeitak_deobfucate.c
${CC} ${CFLAGS} $< -o $@
# data files
#
data: ${DATA}
@${TRUE}
###############
# utility rules
###############
#
everything: all alt
clean:
${RM} -f ${ENTRY}.o ${ALT_OBJ}
clobber: clean
${RM} -f ${ENTRY} ${ALT_ENTRY}
@${TRUE}
nuke: clobber
@${TRUE}
dist_clean: nuke
@${TRUE}
install:
@echo "Surely you're joking Mr. Feynman!"
@${TRUE}
# backwards compatibility
#
build: all
@${TRUE}
##################
# 133t hacker rulz
##################
#
love:
@echo 'not war?'
@${TRUE}
haste:
$(MAKE) waste
@${TRUE}
waste:
@echo 'waste'
@${TRUE}
easter_egg:
@echo you expected to mis-understand this $${RANDOM} magic
@echo chongo '<was here>' "/\\oo/\\"
@echo Readers shall be disallowed from not being unable to partly misunderstand this partocular final echo.
# Understand the history of "I Am the Walrus" and
# and in particular John Lennon's remarks on that
# song and you might be confused about these next
# rules in a different way. :-)
#
supernova: nuke
@-if [ -r .code_anal ]; then \
${RM} -f .code_anal_v3; \
else \
echo "You are not expected to understand this"; \
fi
@${TRUE}
deep_magic:
@-if [ -r .code_anal ]; then \
ccode_analysis --deep_magic 1c2c85c7a02c55d1add91967eca491d53c101dc1 --FNV1a_hash 256-bit "${ENTRY}"; \
else \
echo "Understand different"; \
fi
@${TRUE}
magic: deep_magic
@-if [ -r .code_anal ]; then \
ccode_analysis --mode 21701 --level 23209 --FNV1a_hash 256-bit "${ENTRY}"; \
else \
echo "These aren't the droids you're looking for Mr. Spock!"; \
fi
@${TRUE}
2012/zeitak/hint.html
+159
View File
@@ -0,0 +1,159 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<meta name="GENERATOR" content="mkd2html 2.1.5a DL=DISCOUNT">
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=utf-8">
<link rel="stylesheet"
type="text/css"
href="../hint.css">
<title>Balanced use of obfuscation - Gold award</title>
</head>
<body>
<h1>Balanced use of obfuscation - Gold award</h1>
<p>Adar Zeitak<br>
<a href="&#109;&#97;&#105;&#108;&#116;&#x6f;&#x3a;&#x61;&#x61;&#x34;&#x7a;&#50;&#64;&#x77;&#x61;&#108;&#108;&#97;&#46;&#99;&#111;&#46;&#x69;&#108;">&#97;&#97;&#x34;&#122;&#x32;&#64;&#119;&#x61;&#x6c;&#108;&#x61;&#x2e;&#99;&#111;&#46;&#x69;&#x6c;</a></p>
<h2>Judges' comments:</h2>
<h3>To build:</h3>
<pre><code>make zeitak
</code></pre>
<h3>To run:</h3>
<pre><code>./zeitak &lt; file.c
</code></pre>
<p>where file.c is the file to be checked for nesting errors. For example, you may
try incorrect.c and the program itself.</p>
<h3>Try:</h3>
<pre><code>./zeitak &lt; zeitak.c
./zeitak &lt; incorrect.c
</code></pre>
<h3>Selected Judges Remarks:</h3>
<p>This is an extremely subtle and twisted piece of Gold award winning code!</p>
<p>The judges had spent a considerable amount of time analyzing this entry.
At one point we spent
<a href="https://twitter.com/ioccc/status/252162898800033792">18 minutes</a>
just to understand 18 key characters of this code.</p>
<p>The file zeitak_deobfucate.c provides a version that has been slightly
deobfuscated. You may find reading that file helpful in your attempt
to understand this extremely subtle entry.</p>
<h2>Author&rsquo;s comments:</h2>
<h3>Nesting Errors Detector</h3>
<h4>What does it do</h4>
<p>As you have probably understood by looking at the source*, this program has
something to do with parenthesis (and equality of opening and closing
parenthesis, if you look close enough). It goes over the file given to it and
checks that every opening (, [, or { has a matching closing one and
vice versa. It also checks that every &ldquo; or &lsquo; is closed.</p>
<p>If an error is detected, an error message will be printed. If the problem
is a superfluous closing bracket, it will even print a few characters
around it&rsquo;s position.</p>
<ul>
<li>Make sure you view the source with 4 spaces tab width.</li>
</ul>
<h4>Features</h4>
<ul>
<li><p>Ignores parenthesis inside strings or character constants, so no errors
will be detected in the following line:</p>
<pre><code> printf(")");
</code></pre></li>
<li><p>Doesn&rsquo;t get confused by the 1984/anonymous entry!</p></li>
</ul>
<h4>Mis-Features</h4>
<ul>
<li><p>Escapes (e.g. <code>\"</code>) are ignored, so the following line will produce
an error:</p>
<pre><code>printf("\"");
</code></pre></li>
</ul>
<h4>Obfuscation</h4>
<p>IOCCC winners already contain entries without digits, control-flow
keywords and certain operators in their source. This entry has an
even more limited source, that is:</p>
<ul>
<li>Without any digits.</li>
<li>Without any character constants.</li>
<li>Without using functions from headers other than stdio.</li>
<li>Without any control-flow keywords (not even the ?: operator).</li>
<li>Without any arithmetic or logic operators!</li>
</ul>
<p>So, what&rsquo;s left? Parenthesis, and lots of them, as looking at the source will
reveal immediately. The main obfuscation is building the whole algorithm using
only function calls, typecasts, array lookups and pointer operators.</p>
<p>Additional obfuscations include:</p>
<ul>
<li>Extensive reuse of identifiers: Macros share names with variables, inner
curly braces scopes contain variables with names identical to those in the
outer scopes and some of the variables have different uses in different
parts of the program. Even the large array has more than one use.</li>
<li>A complicated data structure with &ldquo;unused&rdquo; fields.</li>
<li>Mostly one-letter identifiers.</li>
<li>Complex recursion: A function might call itself once, twice, or not at all.</li>
</ul>
<h4>Compilation/Running Notes</h4>
<ul>
<li><p>The program requires <code>char</code> to be one byte and pointers to be
at least two bytes long.</p></li>
<li><p>The program was tested on the following platforms:</p></li>
</ul>
<p><strong> Ubuntu 9.04 32-bit with GCC
</strong> Windows 7 32-bit with GCC
** Windows 7 32-bit with OpenWatcom</p>
<hr />
<!--
(c) Copyright 1984-2015, [Leo Broukhis, Simon Cooper, Landon Curt Noll][judges] - All rights reserved
This work is licensed under a [Creative Commons Attribution-ShareAlike 3.0 Unported License][cc].
[judges]: http://www.ioccc.org/judges.html
[cc]: http://creativecommons.org/licenses/by-sa/3.0/
-->
<TABLE><TR>
<TD><a rel="license" href="http://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by-sa/3.0/88x31.png" /></a></TD>
<TD><P>&copy; Copyright 1984-2015,
<A HREF="/judges.html">Leo Broukhis, Simon Cooper, Landon Curt Noll</A>
- All rights reserved<BR>
This work is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P></TD>
<TD>&nbsp;<!--<a href="http://validator.w3.org/check?uri=referer"><img src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional" height="31" width="88"></a>--></TD>
</TR></TABLE>
</body>
</html>
2012/zeitak/hint.text
+114
View File
@@ -0,0 +1,114 @@
# Balanced use of obfuscation - Gold award
Adar Zeitak
<aa4z2@walla.co.il>
## Judges' comments:
### To build:
make zeitak
### To run:
./zeitak < file.c
where file.c is the file to be checked for nesting errors. For example, you may
try incorrect.c and the program itself.
### Try:
./zeitak < zeitak.c
./zeitak < incorrect.c
### Selected Judges Remarks:
This is an extremely subtle and twisted piece of Gold award winning code!
The judges had spent a considerable amount of time analyzing this entry.
At one point we spent
[18 minutes](https://twitter.com/ioccc/status/252162898800033792)
just to understand 18 key characters of this code.
The file zeitak\_deobfucate.c provides a version that has been slightly
deobfuscated. You may find reading that file helpful in your attempt
to understand this extremely subtle entry.
## Author's comments:
### Nesting Errors Detector
#### What does it do
As you have probably understood by looking at the source\*, this program has
something to do with parenthesis (and equality of opening and closing
parenthesis, if you look close enough). It goes over the file given to it and
checks that every opening (, [, or { has a matching closing one and
vice versa. It also checks that every " or ' is closed.
If an error is detected, an error message will be printed. If the problem
is a superfluous closing bracket, it will even print a few characters
around it's position.
* Make sure you view the source with 4 spaces tab width.
#### Features
* Ignores parenthesis inside strings or character constants, so no errors
will be detected in the following line:
printf(")");
* Doesn't get confused by the 1984/anonymous entry!
#### Mis-Features
* Escapes (e.g. `\"`) are ignored, so the following line will produce
an error:
printf("\"");
#### Obfuscation
IOCCC winners already contain entries without digits, control-flow
keywords and certain operators in their source. This entry has an
even more limited source, that is:
* Without any digits.
* Without any character constants.
* Without using functions from headers other than stdio.
* Without any control-flow keywords (not even the ?: operator).
* Without any arithmetic or logic operators!
So, what's left? Parenthesis, and lots of them, as looking at the source will
reveal immediately. The main obfuscation is building the whole algorithm using
only function calls, typecasts, array lookups and pointer operators.
Additional obfuscations include:
* Extensive reuse of identifiers: Macros share names with variables, inner
curly braces scopes contain variables with names identical to those in the
outer scopes and some of the variables have different uses in different
parts of the program. Even the large array has more than one use.
* A complicated data structure with "unused" fields.
* Mostly one-letter identifiers.
* Complex recursion: A function might call itself once, twice, or not at all.
#### Compilation/Running Notes
* The program requires `char` to be one byte and pointers to be
at least two bytes long.
* The program was tested on the following platforms:
** Ubuntu 9.04 32-bit with GCC
** Windows 7 32-bit with GCC
** Windows 7 32-bit with OpenWatcom
--------------------------------------------------------------------------------
<!--
(c) Copyright 1984-2015, [Leo Broukhis, Simon Cooper, Landon Curt Noll][judges] - All rights reserved
This work is licensed under a [Creative Commons Attribution-ShareAlike 3.0 Unported License][cc].
[judges]: http://www.ioccc.org/judges.html
[cc]: http://creativecommons.org/licenses/by-sa/3.0/
-->
2012/zeitak/incorrect.c
+7
View File
@@ -0,0 +1,7 @@
#include <stdio.h>
int main() {
int i=40;
printf("%c",(char)(i)));
return 0;
}
2012/zeitak/zeitak.c
+75
View File
@@ -0,0 +1,75 @@
#include <stdio.h>
#include <stdlib.h>
#define s(_)sizeof(_)
#define n void*
#define z(_)_,_,_
#define x (s*)__
#define y (s*)_
#define h C(y,y)
#define o &d
#define t() (p)
#define w(_)_,_
typedef n (*(*(*(*p)(n,n))(n,n))(n,n))(n,n);
typedef struct s { struct s* a ; struct s* UNUSED; } s;
typedef struct t { struct s* UNUSED; struct s* a ; } *t;
n __(n _,n __) { return _;}n _(n _,n __){return __; }
typedef unsigned char e;
#define _(_)((*_).a)
s*
w,
a={x ,x},
b={x ,y},
c={y,x},d={y,y};s l[]={&b,&d,w (w(w(w(w(w(&d)))))),w(&d),&c,&d,w(w(w(
&d))),&c,w(&b),&d,&a,z(&d),z(w (w(w(w(w(&d)))))),&b,&b,w(&d),&a,&b,w(&
d), z(w
(w( w(w
(&d))))),w(w(w(&d))), &b,&c,&d, &d,&a,&c ,w(w(&d)), &c,z(&b) ,w(&d),w(&a)
};s* C(s* a, s* b) {s* _=malloc(s(s));_(_)=a;_((t)_)=b;return _;}e k2=s(l
);p f(p
a,p b)
{ e k;s d;p v,r, q,i,C,c,u,g,m=t( )
_ ( _(_(w)));C=t() _(_(&l[fread(&k,s(e )
,s ( e),stdin)]));v =C(_,__);d=l[k=(e )
C ( k2,k)];c=(u=a( b,_),i=(t()_((t )
_ ( _(w))))(_,_(_(o)) ),(a(_(_((t)o)),(t( )
_ ( _((t)o)))(_,__) ))(b(_((t)_((t)o) )
, ( t()_((t)_((t)o))) (_,__)),_));{p a=t( )
_ ( (t)_(o));{p b= C(_,i(u(_,__),_) )
; { p u=C(_,(t()_(_(o) ))(_,__));_(_(_(w)) )
= ( s*)i(__,_(_( _(w))));r=b(m(c,_ )
,C ( m(_,(t()_(( t)_(_(w))))(_,__) )
, ( f)));v=b(_,v);i =b(a(_,__),_);g=(b )
( a(m(c(_,__),__ ),_),_);q=u(_((t )
_ ( o)),_)((t()_( (t)_(_(w))))((t( )
_ ( _((t)o)))(_(_((t )_(w))),(t()_(_((t )
_ ( w))))(_,__))( _,__),_)(_,__),_ )
;_ ( _((t)_(w))) = (s*)u(_((t)_(o)),_ )
( (t()_((t)_(_(w)))) (_,__),_)(_(_((t)o) )
,_ ( _((t)_(w))));} }_((t)_(_(w)))=(s* )
q ( a=(t()_((t)_(_(w))) )(_,__),_((t)_(_(w))) )
; fwrite((k=k,&k2) ,s(e),u(_,g)(s(e )
, ( e)s(s[s(s[s(s[s (s)])])])),stdout )
; fwrite((k2=k,&k) ,s(e),u(__,g)(s(e )
, ( e)s(s[s(s[s(s[s (s)])])])),stdout )
;_ ( _(_((t)w)))=(s*) u((t()_(_(_((t)w))) )
( _,__),_(_(_((t)w ))));_(_((t)_(w)) )
= ( s*)q(a(_(_((t) o)),_(_((t)_(w))) )
,_ ( _((t)_(w))));} _((t)_(_((t)w)))=(s* )
( t()_(_(_((t)w))) )(_((t)_(_((t)w)) )
,u ( (t()_((t)_(_(( t)w))))(_,__),_((t )
_ ( _((t)w)))));g =u((q=u(C(__,(t( )
_ ( _(_((t)w))))(_((t )_(_((t)w))),_)),_) )
( _,__),g);v=g( __,i(u(_,i(f,_) )
( _(_((t)o)),_( (t)_((t)o))),v) )
,r= q(_
,g( f,i
(v(f,(_(_(_(w)))=(s*)m,_)),r)));return q(_,v)(r(g(__,a),g(__,b)),r);}
int main
(){w=C(C(h,h),C(h,h));return printf((e*)f(_,_)("OK\n","\n ^ Error\n"
"" ))
;}
2012/zeitak/zeitak.orig.c
+75
View File
@@ -0,0 +1,75 @@
#include <stdio.h>
#include <malloc.h>
#define s(_)sizeof(_)
#define n void*
#define z(_)_,_,_
#define x (s*)__
#define y (s*)_
#define h C(y,y)
#define o &d
#define t() (p)
#define w(_)_,_
typedef n (*(*(*(*p)(n,n))(n,n))(n,n))(n,n);
typedef struct s { struct s* a ; struct s* UNUSED; } s;
typedef struct t { struct s* UNUSED; struct s* a ; } *t;
n __(n _,n __) { return _;}n _(n _,n __){return __; }
typedef unsigned char e;
#define _(_)((*_).a)
s*
w,
a={x ,x},
b={x ,y},
c={y,x},d={y,y};s l[]={&b,&d,w (w(w(w(w(w(&d)))))),w(&d),&c,&d,w(w(w(
&d))),&c,w(&b),&d,&a,z(&d),z(w (w(w(w(w(&d)))))),&b,&b,w(&d),&a,&b,w(&
d), z(w
(w( w(w
(&d))))),w(w(w(&d))), &b,&c,&d, &d,&a,&c ,w(w(&d)), &c,z(&b) ,w(&d),w(&a)
};s* C(s* a, s* b) {s* _=malloc(s(s));_(_)=a;_((t)_)=b;return _;}e k2=s(l
);p f(p
a,p b)
{ e k;s d;p v,r, q,i,C,c,u,g,m=t( )
_ ( _(_(w)));C=t() _(_(&l[fread(&k,s(e )
,s ( e),stdin)]));v =C(_,__);d=l[k=(e )
C ( k2,k)];c=(u=a( b,_),i=(t()_((t )
_ ( _(w))))(_,_(_(o)) ),(a(_(_((t)o)),(t( )
_ ( _((t)o)))(_,__) ))(b(_((t)_((t)o) )
, ( t()_((t)_((t)o))) (_,__)),_));{p a=t( )
_ ( (t)_(o));{p b= C(_,i(u(_,__),_) )
; { p u=C(_,(t()_(_(o) ))(_,__));_(_(_(w)) )
= ( s*)i(__,_(_( _(w))));r=b(m(c,_ )
,C ( m(_,(t()_(( t)_(_(w))))(_,__) )
, ( f)));v=b(_,v);i =b(a(_,__),_);g=(b )
( a(m(c(_,__),__ ),_),_);q=u(_((t )
_ ( o)),_)((t()_( (t)_(_(w))))((t( )
_ ( _((t)o)))(_(_((t )_(w))),(t()_(_((t )
_ ( w))))(_,__))( _,__),_)(_,__),_ )
;_ ( _((t)_(w))) = (s*)u(_((t)_(o)),_ )
( (t()_((t)_(_(w)))) (_,__),_)(_(_((t)o) )
,_ ( _((t)_(w))));} }_((t)_(_(w)))=(s* )
q ( a=(t()_((t)_(_(w))) )(_,__),_((t)_(_(w))) )
; fwrite((k=k,&k2) ,s(e),u(_,g)(s(e )
, ( e)s(s[s(s[s(s[s (s)])])])),stdout )
; fwrite((k2=k,&k) ,s(e),u(__,g)(s(e )
, ( e)s(s[s(s[s(s[s (s)])])])),stdout )
;_ ( _(_((t)w)))=(s*) u((t()_(_(_((t)w))) )
( _,__),_(_(_((t)w ))));_(_((t)_(w)) )
= ( s*)q(a(_(_((t) o)),_(_((t)_(w))) )
,_ ( _((t)_(w))));} _((t)_(_((t)w)))=(s* )
( t()_(_(_((t)w))) )(_((t)_(_((t)w)) )
,u ( (t()_((t)_(_(( t)w))))(_,__),_((t )
_ ( _((t)w)))));g =u((q=u(C(__,(t( )
_ ( _(_((t)w))))(_((t )_(_((t)w))),_)),_) )
( _,__),g);v=g( __,i(u(_,i(f,_) )
( _(_((t)o)),_( (t)_((t)o))),v) )
,r= q(_
,g( f,i
(v(f,(_(_(_(w)))=(s*)m,_)),r)));return q(_,v)(r(g(__,a),g(__,b)),r);}
int main
(){w=C(C(h,h),C(h,h));return printf((e*)f(_,_)("OK\n","\n ^ Error\n"
"" ))
;}
2012/zeitak/zeitak_deobfucate.c
+146
View File
@@ -0,0 +1,146 @@
#include <stdio.h>
#include <stdlib.h>
typedef void *(*(*(*(*p) (void *, void *)) (void *, void *)) (void *, void *)) (void *, void *);
typedef struct frst {
struct frst *a;
struct frst *UNUSED;
} frst;
typedef struct scnd {
struct frst *UNUSED;
struct frst *a;
} *scnd;
void *
arg1(void *a1, void *a2)
{
return a1;
}
void *
arg2(void *a1, void *a2)
{
return a2;
}
typedef unsigned char u_char;
frst *w,
a = {(frst *) arg1, (frst *) arg1},
b = {(frst *) arg1, (frst *) arg2},
c = {
(frst *) arg2, (frst *) arg1
},
d = {
(frst *) arg2, (frst *) arg2
};
frst table[] = {
&b, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &c, &d, &d, &d, &d, &d, &d, &d, &d, &d, &c, &b,
&b, &d, &a, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &b, &b, &d, &d, &a, &b, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d, &d,
&d, &d, &d, &d, &d, &d, &b, &c, &d, &d, &a, &c, &d, &d, &d, &d,
&c, &b, &b, &b, &d, &d, &a, &a
};
frst *
C(frst * a, frst * b)
{
frst *p = malloc(sizeof(frst));
p->a = a;
p->UNUSED = b;
return p;
}
u_char k2 = sizeof(table);
p
f(p a, p b)
{
u_char k;
frst d;
p v,
r,
q,
i,
C,
c,
u,
g,
m = (p)
((*((*((*w).a)).a)).a);
C = (p) ((*((*&table[fread(&k, sizeof(u_char), sizeof(u_char), stdin)]).a)).a);
v = C(arg2, arg1);
d = table[k = (u_char) C(k2, k)];
c = (u = a(b, arg2), i = ((p) ((*(scnd) ((*((*w).a)).a)).a)) (arg2, ((*((*&d).a)).a)), (a(((*((*(scnd) & d).a)).a), ((p)
((*((*(scnd) & d).a)).a)) (arg2, arg1))) (b(((*(scnd) ((*(scnd) & d).a)).a)
,((p) ((*(scnd) ((*(scnd) & d).a)).a)) (arg2, arg1)), arg2)); {
p a = (p)
((*(scnd) ((*&d).a)).a); {
p b = C(arg2, i(u(arg2, arg1), arg2)); {
p u = C(arg2, ((p) ((*((*&d).a)).a)) (arg2, arg1));
((*((*((*w).a)).a)).a)
= (frst *) i(arg1, ((*((*((*w).a)).a)).a));
r = b(m(c, arg2)
,C(m(arg2, ((p) ((*(scnd) ((*((*w).a)).a)).a)) (arg2, arg1))
,(f)));
v = b(arg2, v);
i = b(a(arg2, arg1), arg2);
g = (b) (a(m(c(arg2, arg1), arg1), arg2), arg2);
q = u(((*(scnd) ((*&d).a)).a), arg2) (((p) ((*(scnd) ((*((*w).a)).a)).a)) (((p)
((*((*(scnd) & d).a)).a)) (((*((*(scnd) ((*w).a)).a)).a), ((p) ((*((*(scnd) ((*w).a)).a)).a)) (arg2, arg1)) (arg2, arg1), arg2) (arg2, arg1), arg2);
((*((*(scnd) ((*w).a)).a)).a) = (frst *) u(((*(scnd) ((*&d).a)).a), arg2)
(((p) ((*(scnd) ((*((*w).a)).a)).a)) (arg2, arg1), arg2) (((*((*(scnd) & d).a)).a)
,((*((*(scnd) ((*w).a)).a)).a));
}
} ((*(scnd) ((*((*w).a)).a)).a) = (frst *)
q(a = ((p) ((*(scnd) ((*((*w).a)).a)).a)) (arg2, arg1), ((*(scnd) ((*((*w).a)).a)).a));
fwrite((k = k, &k2), sizeof(u_char), u(arg2, g) (sizeof(u_char)
,(u_char) sizeof(frst[sizeof(frst[sizeof(frst[sizeof(frst)])])])), stdout);
fwrite((k2 = k, &k), sizeof(u_char), u(arg1, g) (sizeof(u_char)
,(u_char) sizeof(frst[sizeof(frst[sizeof(frst[sizeof(frst)])])])), stdout);
((*((*((*(scnd) w).a)).a)).a) = (frst *) u(((p) ((*((*((*(scnd) w).a)).a)).a))
(arg2, arg1), ((*((*((*(scnd) w).a)).a)).a));
((*((*(scnd) ((*w).a)).a)).a)
= (frst *) q(a(((*((*(scnd) & d).a)).a), ((*((*(scnd) ((*w).a)).a)).a))
,((*((*(scnd) ((*w).a)).a)).a));
}
((*(scnd) ((*((*(scnd) w).a)).a)).a) = (frst *)
((p) ((*((*((*(scnd) w).a)).a)).a)) (((*(scnd) ((*((*(scnd) w).a)).a)).a)
,u(((p) ((*(scnd) ((*((*(scnd) w).a)).a)).a)) (arg2, arg1), ((*(scnd) ((*((*(scnd) w).a)).a)).a)));
g = u((q = u(C(arg1, ((p)
((*((*((*(scnd) w).a)).a)).a)) (((*(scnd) ((*((*(scnd) w).a)).a)).a), arg2)), arg2))
(arg2, arg1), g);
v = g(arg1, i(u(arg2, i(f, arg2))
(((*((*(scnd) & d).a)).a), ((*(scnd) ((*(scnd) & d).a)).a)), v))
,r = q(arg2
,g(f, i
(v(f, (((*((*((*w).a)).a)).a) = (frst *) m, arg2)), r)));
return q(arg2, v) (r(g(arg1, a), g(arg1, b)), r);
}
int
main()
{
w = C(C(C((frst *) arg2, (frst *) arg2), C((frst *) arg2, (frst *) arg2)), C(C((frst *) arg2, (frst *) arg2), C((frst *) arg2, (frst *) arg2)));
return printf((u_char *) f(arg2, arg2) ("OK\n", "\n ^ Error\n"
""));
}