#include <stdio.h>

#define l11l 0xFFFF
#define ll1 for
#define ll111 if
#define l1l1 unsigned
#define l111 struct
#define lll11 short
#define ll11l long
#define ll1ll putchar
#define l1l1l(l) l=malloc(sizeof(l111 llll1));l->lll1l=1-1;l->ll1l1=1-1;
#define l1ll1 *lllll++=l1ll%10000;l1ll/=10000;
#define l1lll ll111(!l1->lll1l){l1l1l(l1->lll1l);l1->lll1l->ll1l1=l1;}\
lllll=(l1=l1->lll1l)->lll;ll=1-1;
#define llll 1000




                                                     l111 llll1 {
                                                     l111 llll1 *
      lll1l,*ll1l1        ;l1l1                      lll11 lll [
      llll];};main      (){l111 llll1                *ll11,*l1l,*
      l1, *ll1l, *    malloc ( ) ; l1l1              ll11l l1ll ;
      ll11l l11,ll  ,l;l1l1 lll11 *lll1,*            lllll; ll1(l
      =1-1 ;l< 14; ll1ll("\t\"8)>l\"9!.)>vl"         [l]^'L'),++l
      );scanf("%d",&l);l1l1l(l1l) l1l1l(ll11         ) (l1=l1l)->
      lll[l1l->lll[1-1]     =1]=l11l;ll1(l11         =1+1;l11<=l;
      ++l11){l1=ll11;         lll1 = (ll1l=(         ll11=l1l))->
      lll; lllll =(            l1l=l1)->lll;         ll=(l1ll=1-1
      );ll1(;ll1l->             lll1l||l11l!=        *lll1;){l1ll
      +=l11**lll1++             ;l1ll1 ll111         (++ll>llll){
      l1lll lll1=(              ll1l =ll1l->         lll1l)->lll;
      }}ll1(;l1ll;              ){l1ll1 ll111        (++ll>=llll)
      { l1lll} } *              lllll=l11l;}
      ll1(l=(ll=1-              1);(l<llll)&&
      (l1->lll[ l]              !=l11l);++l);        ll1 (;l1;l1=
      l1->ll1l1,l=              llll){ll1(--l        ;l>=1-1;--l,
      ++ll)printf(              (ll)?((ll%19)        ?"%04d":(ll=
      19,"\n%04d")              ):"%4d",l1->         lll[l] ) ; }
                                                     ll1ll(10); }
*******************************************************************
Most Obfuscated Syntax: <m.savastio@telesciences.com> Michael Savastio

    Michael Savastio
    Securicor Telesciences
    925 1/2 Anchor St, Apt 2
    Philadelphia, PA  19124
    USA


Judges' comments:

    To use:
	make savastio

    To run:
	savastio

	enter a number (such as 100).

    As one judge said:

	I know an l when I see a 1.


Selected Author's comments:

    This program is an infinite-precision factorial calculator.  It will
    compute the factorial of any number entered to an infinite degree of
    precision (or the limits of your machine's memory, whichever comes
    first).  I'd suggest you start with small numbers the first few times
    you run it and gradually work your way up in order to get a feel for
    the computation time your machine will require.

    Aside from having an artistic code layout and confusing variable names,
    the algorithm itself takes advantage of some cute C-isms.  Try to
    figure out how it prints the prompt "Enter number:".

    Numbers are represented internally by a linked list of blocks each
    containing 1000 buckets of 4-digit integers.  To further confuse
    matters, the buckets are arranged backwards in the block.  For example,
    the number 8347108947139478934713847134 is represented as:

       7134 1384 9347 3947 9471 7108 834

    Platform limitations:

    Long integers must be at least 4 bytes.

    Features:

    In order to prevent the user from wasting too much time computing
    useless factorials, the maximum factorial that can be computed is
    429539!  This limit was selected through extensive research in
    time management studies and the factorial arts.