A fun little script that prints out two little haikus. Took me about 2 hours. I'm sure you can figure this one out.. :) 
#!/usr/bin/perl
foreach $l([[48869,2,4],[41131,7,2],[39071,4,3],[37821,6,3],[32954,
6,3],[57080,10,3],[59526,7,2]],[[54454,7,3],[46498,7,3],[49910,4,3]
,[55466,5,3],[52888,6,3],[54702,6,3],[58296,6,3],[54247,8,3],[62957
,0,4],[50822,4,4],[49324,3,3],[60393,3,3],[59526,7,2]],[[51626,10,3
],[63468,7,4],[59615,10,3],[55262,9,3],[34264,11,1]],[[33227,9,3],[
43913,2,3],[55180,10,3],[35540,3,3],[46770,7,3],[59526,7,2]],[[51174
,6,3],[65275,7,3],[58287,9,3],[37598,7,3],[43244,10,3],[62909,2,3],
[41639,4,3],[38551,3,3],[47512,8,3],[49143,5,3],[33253,9,1]],[[53415
,4,3],[62427,9,3],[50401,8,3],[59347,9,3],[64710,8,3],[63973,1,3],[
43182,2,3]]){print l($l);}sub l{$l=shift;my $o;foreach $r(@{$l}){$o
.=lc(substr(crypt(pack("L",$r->[0]),"sh"),$r->[1],$r->[2]));}$o=~
s{/n}{\n}g;$o=~s{/s}{ }g;$o;}

[download]

Replies are listed 'Best First'.
Re: a simple one
by apotheon (Deacon) on Nov 22, 2004 at 06:13 UTC

    It's amusing and effective. Thanks.

    - apotheon
    CopyWrite Chad Perrin

[reply]
Re: a simple one
by jdalbec (Deacon) on Nov 23, 2004 at 23:55 UTC
    It's broken on big-endian platforms. Try pack("V",... instead.

    Update:
    Brute-forcing crypt is...fun?

    ObJAPH (non-canonical, sorry): 
    #! /usr/bin/perl -w
use strict;
foreach my $l([[97309,9,3],[25897,10,3]],[[23375,3,3],[12672,9,2],
[10092,5,2]],[[40990,9,3],[66595,4,3]],[[94519,3,3],[10546,7,2],
[11294,2,2],[10018,8,2],[11527,5,2]]){print l($l);}sub l{my $l=shift;
my $o;foreach my $r(@{$l}){$o.=substr(crypt(pack("V",$r->[0]),"sh"),
$r->[1],$r->[2]);}$o=~s{/n}{\n}g;$o=~s{/s}{ }g;$o;}

    [download]
[reply]
[d/l]
[select]

Back to Obfuscated Code