Path: nntp-server.caltech.edu!news.claremont.edu!ucivax!news.service.uci.edu!network.ucsd.edu!pravda.sdsc.edu!news.cerf.net!usc!howland.reston.ans.net!darwin.sura.net!bogus.sura.net!news-feed-1.peachnet.edu!concert!borg.cs.unc.edu!not-for-mail From: olano@cs.unc.edu (T Marc Olano) Newsgroups: alt.fan.dave_barry Subject: Re: anagrams Date: 27 May 1993 13:21:25 -0400 Organization: The University of North Carolina at Chapel Hill Lines: 283 Distribution: world Message-ID: <1u2talINN150@beethoven.cs.unc.edu> References: <1u2n8kINNbch@srvr1.engin.umich.edu> NNTP-Posting-Host: beethoven.cs.unc.edu As long as we're posting anagram programs. This one is not mine, but I think it's a cool enough program that it deserves to be passed along. It's Andreas Gustafsson's entry in the 1992 international obfuscated c code contest (winner of the Most Humorous Output award). This and the other obfuscated c contest winners can be found (among other places) on ftp.uu.net in the /pub/ioccc directory. ---------- gson.c ---------- #include long a [4],b[ 4],c[4] ,d[0400],e=1; typedef struct f{long g ,h,i[4] ,j;struct f*k;}f;f g,* l[4096 ]; char h[256],*m,k=3; long n (o, p,q)long*o,*p,*q;{ long r =4,s,i=0;for(;r--;s=i^ *o^*p, i=i&*p|(i|*p)&~*o++,*q ++=s,p ++);return i;}t(i,p)long*p ;{*c=d [i],n(a,c,b),n(p,b,p);}u(j)f*j;{j->h =(j->g =j->i[0]|j->i[1]|j->i[2]|j->i[3])&4095;}v( j,s)f* j; {int i; for(j->k->k&&v(j->k, ' '),fseek( stdin, j->j, 0);i=getchar(),putchar(i-'\n'?i:s),i- '\n';);}w(o,r,j,x,p)f*o,*j;long p;{f q;int s,i=o->h;q.k=o;r>i?j=l[r=i]:r>1, s|=s >>2,s|=s>>4,s |=s>>8 ,j=l[r =((r&i |s)&~(s>>1))-1&i]):0;--x;for (;x&&!(p&i);p>>=1);for(;!x&&j;n(o->i,j->i,q. i),u(&q),q.g||(q.j=j->j,v(&q,'\n')),j=j->k);for(;x;j=x ?j->k:0){for(;!j&&((r=(r&i)-1&i)-i&&(r&p)?2:(x=0));j=l[r]);! x||(j->g&~o->g)||n (o->i,j->i,q.i)||( u(&q), q.j=j ->j,q.g?w(&q ,r,j->k,x ,p):v(&q, '\n')); }}y(){f j;char *z,*p; for(;m ? j.j= ftell( stdin) ,7,(m= gets(m ))||w( &g,315 *13,l[ 4095] ,k,64* 64)&0: 0;n(g .i,j.i, b)||(u (&j),j. k=l[j.h],l[j.h]= &j,y())){for(z= p=h;*z&&( d[*z++]||(p=0)););for(z=p?n(j.i ,j.i,j.i)+h:""; *z;t(*z++,j.i));}}main(o,p)char** p; {for(;m = *++p;)for(;*m- '-'?*m:(k= -atoi(m))&0;d[*m]||(d[*m ]=e,e<<=1),t(*m++,g.i)); u(& g),m=h ,y();} ---------- gson.hint ---------- Most Humorous Output: Andreas Gustafsson Andreas Gustafsson Helsinki University of Technology Arentikuja 1 D 305 (home address) 00410 Helsinki FINLAND Judges' comments: To make: make ag Determine where your system dictionary is located. You may find it located in one of the following places: /usr/dict/words /usr/share/lib/spell/words /usr/ucblib/dict/words /dev/null <-- for machines with nothing to say Then using the proper dictionary: ag free software foundation < /usr/dict/words ag obfuscated c contest < /usr/dict/words ag unix international < /usr/dict/words ag george bush < /usr/dict/words ag bill clinton < /usr/dict/words ag ross perot < /usr/dict/words ag paul e tsongas < /usr/dict/words Recently some newspapers printed amusing anagrams of one of the names listed above. Run this program to find the anagrams they weren't allowed to print! Selected notes from the author: The name of the game: AG is short for either Anagram Generator or simply AnaGram. It might also be construed to mean Alphabet Game, and by pure coincidence it happens to be the author's initials. What it does: AG takes one or more words as arguments, and tries to find anagrams of those words, i.e. words or sentences containing exactly the same letters. How to use it: To run AG, you need a dictionary file consisting of distinct words in the natural language of your choice, one word on each line. If your machine doesn't have one already, you can make your own dictionary by concatenating a few hundred of your favourite Usenet articles and piping them through the following obfuscated shell script: #!/bin/sh z=a-z];tr [A-Z\] \[$z|sed s/[\^$z[\^$z*/_/g|tr _ \\012|grep ..|sort -u Using articles from alt.folklore.computers is likely to make a more professional-looking dictionary than rec.arts.erotica. AG must be run with the dictionary file as standard input. Because anagrams consisting of just a few words are generally more meaningful than those consisting of dozens of very short words, the number of words in the anagrams is limited to 3 by default. This limit can be changed using a numeric command line option, as in "ag -4 international obfuscated c code contest