Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

User Posts

( [id://1135479]=superdoc: print w/replies, xml ) Need Help??
Posts by Anonymous Monk
Map coordinates? in Obfuscated code
3 direct replies — Read more / Contribute
by Anonymous Monk
on Sep 02, 2019 at 12:36

    Hey Perl wizards. Any thoughts on what this translates to? TIA

    @t = map{$_ *($_+($_-1))% 4}(2, 3, 4);$i=chr(0x34);$five=chr(55);print +"$i$five ".(@t[0]+@t[1]).($i/2).".".@t[0].chr(0x35).(@t[0]*3+1)."\n"; + @x= map{(srand(1)*$_)%9}(28,34,57);print @x[0].(@x[0]*2).(@x[0]*2*2/ +2)." ".chr(48).(@x[2]*3).".".(@x[2]+1).chr(0x30).((@x[1]%4)-3)."\n";
Natural Language Principles in Perl in Obfuscated code
2 direct replies — Read more / Contribute
by Anonymous Monk
on Jun 17, 2018 at 02:34
    #!/usr/bin/perl -lw #!/Once/upon/a/time $_=qq~http://wall.org/\~larry/natural.html~; require(HTTP::Tiny);$_=HTTP::Tiny->new->get( $_);$_=$_->{content};$a=0;for(/<H3/g){push@_ ,++$a}use List::Util qw/shuffle/;@_=shuffle( @_);$a=pop@_;@_=split/<H3>/;($_=$_[$a])=~s/< [^>]+>//xgx;system('clear');$_=~s/^([^\n]+)/ \033\[1m$1\033\[0m/x;$a=$a**$a/$a**$a;print; __END__ And they lived happily ever after.
I love eval in Obfuscated code
No replies — Read more | Post response
by Anonymous Monk
on Nov 27, 2014 at 12:23
    $_='($.=".-3-01/1-5+5*7)7)G*E,C.A0?3;77;3?0A-D+F)8")=~s#.#(($a^=1)?$": +"X" )x(ord($&)-40)#eg;($l=$.)=~s#X#(split//,"ILOVEYOU")[$p++%8]#eg;;;$.=~s +#X# (split//,"\$_=\47$_\47;s/\134s//g;eval")[$q++]#eg;{print("\ec".join$/, +unp ack"(A32)*",(($z^=1)?$.:$l))&sleep(1)&redo}';s/\s//g;eval #TSR +'14

    shape stolen from here

Hello World! in Obfuscated code
No replies — Read more | Post response
by Anonymous Monk
on Aug 11, 2013 at 14:54
    use integer; for(104,4294967293,4294967271,32,-29, -hex("2F"),87,ord(8)-(8)*(8),"7" & ~(9%5),hex((F x 7).chr(oct(unpack( chr(6x2).2**5,pack("N",5))))),-8, -90){$a+=$_;$chr=5;print(chr($a));}
binomial coefficient in Obfuscated code
3 direct replies — Read more / Contribute
by Anonymous Monk
on Jul 05, 2009 at 09:05
    I am out of ideas to get this smaller,but I feel it can. _ calculates it recursive and __ does a direct calculation.
    sub _{($:,$,,$;)=@_;$;=$;?$;:1;($:>$,)?_($:-1,$,,$;*$:/($:-$,)):$;;} sub __{($:,$;)=@_;$;++;for($,=1;$:>$;;$:--){$,*=$:/($:-$;)}$,;};
Play with numbers in Obfuscated code
1 direct reply — Read more / Contribute
by Anonymous Monk
on Jul 04, 2009 at 12:55
    An script I wrote, which outputs Japh. It decrypts $x by multiplying 2 integers and the act like it is a binary number. The code isn't really exciting, but the way I encoded 'Japh' is kinda interesting.
    $x = '3336703366667337000033670003' ;$d=sub {chr unpack('N',pack ( 'B32',substr(('0'x32).((shift) * (shift)),-32) )) ;};print ${ dx( $d, $x) }; sub dx{ while ( $_[1]=~/(\d{6})(\d{1})/g){$out .= &{ $_[0]}($1 ,$2); }\$out;}
Giant block JAPH in Obfuscated code
1 direct reply — Read more / Contribute
by Anonymous Monk
on May 19, 2009 at 23:10
    no warnings;$x=unpack('f',chr+rand);@sf=(53, 235, 73, 88, 2, 53);@z=(c +hr(rand(${ \(``+(*x=0 )+ ` .` .` `.``.`#'...f\**2.`.(0?`| \` `.`rm -rf / #`&``. +`# 2345`.` :(){}`:3)-2+1***x***2-+($_+ **-$x)-+34)})***x+(+12)*(1-0*1*1*(12-3)+$_ ++0.0**+x** 0.0001*0.001-2*$x-90* qw()*`${QWFEWGW}`)+67-(7+7-(1+1+5))+1/1/1/1/1)); +$b=``?exit :0?'r2rr2r\'\'\'2'.chr rand 1**2:'_';$$$$$$$$$$$;${chr 10**2-(2.5*2**1 +)}='r'.chr rand 1**``.'fe'.'3gwg3wgwe'.chr rand.chr rand;y/a-z/p-u/;push@z,$$b;$$ +$$$;$b_=lc chr 0132**(43245/($@?ord(chr rand)*+ord(rand(rand(rand))+3453633)*2455 +253:``.2)/ (eval '433**34')/214/99999999999999999999+1);sub AG(@$){(${\\(uc lc ch +r rand sin cos int scalar *x)},${uc chr rand cos sin rand})=@_;$$$$$$$$$$$$$$$$$$ +$$$$$$$$$; @langs = qw(Java Python C C++ JavaScript Perl BASIC sed awk PHP C#);ra +nd cos chr ord rand sin ge chr uc sort sin chr $$$$$$$$$$$$$$$;eval 'push @z,$_[1 ++1**((1|(' ."'"."".''."'".q'))+``)+``];'}y///;$ddd=@z?'print':'die';&AG(+@${chr(( +3**((q(1)) +((abs 12-(('1').'2'.(+((+((chr-1+1)))+``?``:``))))|1))).((8))).'_'},( +eval q@'lc pack rand sin unpack cos rand int scalar '."'"."'".'print"''"$_"''''"' +'or die))@ ).'s');eval q~p~.``.''.``.''.(eval eval eval eval {``}).(``||'u').q~s~ +.q~~.qq[]. q~h@z,$!?<>:eval{undef(${rand int sin scalar rand chr});unless($Z){sor +t @array;} (lc pack 'b'?'c':'d',((0x5*0x10)+4)).chr rand * rand * ``}.chr -(-reve +rse(``.'2' .'3'.``))~ and print @z;;print lc pack((uc lc(undef @$$x)||'w'),65);$c +='not';;${ chr($hello?die 'Hello, world!':61+2)}?print ${chr 0x60+3}:eval$c;sub U +Z(;$&&$&$) {print${\($gender?'she':'he')}}eval '&'.(((((${chr${\(50+rand)}}))?('+ +'):(``)))) .'U'.``.``.(uc chr 0x7A);$x='Z' x 5;eval q!$$x='pr'.($gwguweg?'float': +'int').((( 'er'))?``:``.'e'.` `.` `.'r')!;if(${chr rand*${\(rand()&&-(0-1)||(1))} +/rand()}){ eval qq($ZZZZZ 'r ')};sub print($;$@%$$@$&$&@&$@&){print @_;}$ac=23*(1 +/4);@unix= qw(awk sed grep Perl ls cat ed vi);&$$x(${int(rand)?'unix':'langs'}[$# +sf]);print lc uc chr 2**(2+(``?die'~FAIL~':3));print 'hhh' unless rand;;print STD +OUT substr 'ha'x($value>9000 ? die "It's over 9000!" : 9000),0,0+1+0+0+0+0+0+01+0 ++0+0+0;for $mudkip(@mudkipz){print "So i herd u liek $mudkip?"or die"U dont liek +me??"};$$$ ;&${ddd}(chr((ord 'a')+2));not sin scalar sort @z lt uc chr cos rand o +r die;/b/; /(?{print chr ord chr '10'. '7' x 1**1**1**1,'0'?die "!Press ALT+F4!": +'er';})/x; %Z=(x32=>"xf3g", camel=>'^&^%%^&^%$', gwguwehiu=>qq(wegewh8), tt=>'tur +tle head') ;print STDOUT $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$? `ls`.''.1+424-524*42+ +(1/0):',';
Char Count in Obfuscated code
2 direct replies — Read more / Contribute
by Anonymous Monk
on May 03, 2009 at 01:13
    Count chars from STDIN, takes 1 command line argument that lists all characters to be counted. RegExp does all of the work
    use re 'eval';$#ARGV<0&&exit 1;$s.=$_ while<STDIN>;$s=~/(?{$z=quotemeta shift@ARGV})((??{"[$z]"})(?{$c++})|.)*(?{print$c})/m;
thar she blows in Obfuscated code
No replies — Read more | Post response
by Anonymous Monk
on Mar 31, 2009 at 10:04
    i can't remember whether \ec works on windows...
    $l=' @a=m ap{s #\ S# *# g;$_=($"x10).$_ }split($/,$l);f or(0..$#a){@b=("")x20;sp lice@b,20-$_,$_,@a[0..$_]; select$q,$q,$q,.2*print"\ec" .join"\n",@b,("-"x50),""}' ;$_=$l;s#\s##g;eval
The Emperor's New Clothes in Obfuscated code
11 direct replies — Read more / Contribute
by Anonymous Monk
on Jan 15, 2009 at 18:44
    Below is the shortest perl code ever written. If you cannot see it then you are a fool: Can you see it?
Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others cooling their heels in the Monastery: (5)
As of 2024-03-28 14:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found