Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Flickering japh

by Grimy (Pilgrim)
on Apr 13, 2012 at 13:40 UTC ( #964931=obfuscated: print w/ replies, xml ) Need Help??

(Original concept by davido)
use strict;for(q)Just another Perl hacker)){$|^=@_=map{sub{[sub{$^N^( pop&&q q q||qq qq)if/\G(.)/g}->((*0=sub{rand})->()<1e-2)||q$,$,$!+++& 0**-.2]}}/./mg=>$<;for(;;){my$_;{print+map{$_->[0]}@{[[qq]\xD]],sort{ $a->[1]<=>$b->[~0]}map{$_->$_}@_=>]}}select$_->[0],$,,$,,&0**5;die:}}
Edited to avoid the warning.

Comment on Flickering japh
Download Code
Re: Flickering japh
by davido (Archbishop) on Apr 13, 2012 at 18:21 UTC

    Oh yeah, I remember that: Nervous sub.

    I do get a warning since you're using ?.? as a pattern match delimiter without specifying 'm' in front of it. You might either suppress the warning, or add the 'm' in the appropriate place. I know that may deobfuscate slightly, but so does the warning. :)

    Cool way of doing it, and golfed down to four lines of code where mine was five. :)


    Dave

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://964931]
Approved by choroba
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (10)
As of 2014-12-25 20:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (163 votes), past polls