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

Winkin' Blinkin'...

by Guildenstern (Deacon)
on Nov 04, 2003 at 16:57 UTC ( #304473=obfuscated: print w/replies, xml ) Need Help??

...or everything I know about obfu, I learned from Erudil.
(Yes, I stole some elements from my other JAPH, but they're not the important parts.)

This has been tested under ActiveState 5.8, Cygwin 5.8, and 5.6.1 under RH 9 so far.

#!/usr/bin/perl -w use strict; $|++;$_='$^X="42858384006578". "798472698200486982760072656". "775698200";;$~=substr($^X,-1, (2>>1));;$^=(chr(substr($^X,2, (2>>1)))x(substr($^X,-3,3)>>2) );;;map{substr($:,$.++,1)=chr( substr($^X,$_,2)+(2<<4))}(4,20 ,32,44,40,6);map{foreach$"(0.. $~){do{$a=int(rand((substr($^X ,7,3)>>4)));;}while(substr($_, $a,1)ne(chr((1<<2)+substr($^X, 0,2))));;;substr($_,$a,1)=chr( substr($^X,$a*2,2)+(1<<5));;;} s/\./ /g;;print;$~++;;;eval($: .(\'$b,\'x3).substr($^X,-1,1). \'.\'.(2>>1).substr($^X,-2,1)) ;$_=$^;print;}map{$_=chr((1<<2 )+substr($^X,0,2))x(substr($^X, 23,3)>>3);}($^X=~/../g);';eval; print(chr(substr($^X,3,1)*2));;

Update: Looks like I needed an extra line feed for some cases.


Guildenstern
Negated character class uber alles!

Replies are listed 'Best First'.
Re: Winkin' Blinkin'...
by nimdokk (Vicar) on Nov 04, 2003 at 20:43 UTC
    Well done my good and noble Lord Rosencrantz!;-)


    "Ex libris un peut de tout"

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://304473]
Front-paged by broquaint
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (5)
As of 2016-10-01 18:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?






    Results (3 votes). Check out past polls.