Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

print for (1..9)

by Len (Friar)
on Mar 26, 2002 at 15:21 UTC ( #154408=obfuscated: print w/replies, xml ) Need Help??

How to make simple things difficult:
#!/usr/bin/perl -w $_='`dNd7 id~kdmjd mjdj~edf CdWdWdWdW dWdWdWdWd WdWddZ{d; jd&ijd~l kdwDduadu adZNdPNd< OdZ}idYfd Dgd7id!k d~kmdwljd mlkddEd&kdwmdkCdjWdiad<Nd^kdcd^kdZCdZMdjZudkX dm1dwmfd&ld:hddZ9dP:dF;d<;ed_kdXidMkd:ud/%d|h /dv9dmmmdmmmdmmmdZ9dZ9dZ9dZ9dd&jid&jid~kkd~d~ dvmdwmfdwjjdm;dZNdPadPadkbdm;dmmidwhkd&mdEfdd Ofd1ld&jid~f1duWdkdk$dmmfdmmhdm;dlXdladladmNd w1d~mjd&jid:kdXddm jmdmjmdmjmdZLdZ9dP9 dF8d<8d2 8d`d`dVdL dLdBdBdBd dUd1id~jj dwmfdlDd kWdkWdv0 d~jjd%mdw hkdlDdkXd kXdkXdlDdhmmd~kid1idd:hd~jidwjidm1dkNdjbdjbdk XdlEdwmhd~mjd:%dZMdkWdl;dwjid~gmd&kdM';#dZ9dP foreach(/(\S)/g){$;.='1'if((/d/));$_=ord($_); /(.)(.)$/;($;.="\40"x$1).='0'x$2;}foreach(((( split(/11/,$;))))){++$i;s/1/\n/g;s/0/$i/g;#:) print("$_ \n\n")}$_ ='unpack "u",\'&"4 I!4$@*\''; s(\s)()xg ;print(( eval));s; Len#The#M an;#:)#;

Replies are listed 'Best First'.
Re: print for (1..9)
by ProgrammingAce (Sexton) on Mar 31, 2002 at 03:07 UTC
    I have to say, that I am impressed. Beyond that, I am at a loss for words...

            - Ace "Two programmers walk into a bar, the third ducks"
Re: print for (1..9)
by novas007 (Acolyte) on Mar 30, 2002 at 02:49 UTC
    Hah! nifty :)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://154408]
Approved by root
[erix]: there used to be the 'razing' of towns and citoes but that now means something else in Germany (rasen=driving too fast)
[erix]: sleighting, I imagine 'Schlechten' will be a german word too - probably with same meaning as in dutch (breaking down, making useless a castle / defensive structure )

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (6)
As of 2017-05-29 15:34 GMT
Find Nodes?
    Voting Booth?