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

There can be only one!

by Erudil (Prior)
on May 15, 2000 at 16:15 UTC ( #11590=obfuscated: print w/ replies, xml ) Need Help??

#!/usr/bin/perl -w # there can be only one use strict; $_='$_={one(( one($")<<1)^one( $/))}{{one((one($;) <<($^=(one($/)>>1)>>1) +1)+one($/)>>1)}{{{one((( one($;)<<$^+1)+one($/)>>1)-$ ^)}{{{one(((one($;)<<$^+1)+one( $/)>>1)-1)}{one (one($"))}{{one ((one($;)<<$^)^ (one($")>>1)+1) }{one((one($;)< <$^)-$^)}{{one( ((one($;)<<$^)- $^)+1)}}{one((( one($;)<<$^+1)+ one($/)>>1)-1)} {one(($~=$=)<<1 ^one($")>>1)}{{ {one((one($;)<< $^)-one($/)-1)} {one(((one($;)< <$^+1)+one($/)> >1)-$^-1)}{one( one($"))}}{one( one($/)<<$^+1)} {one((one($;)<< $^)-one($/)-1)} {one(((one($;)< <$^+1)+one($/)> >1)-$^-1)}}}{{{one(((one($;)<<$^)-$^)-$^)}}}{one( one($"))}}{one(($~=$=)<<1^one($")>>1)}}{{one((one ($;)<<$^)-(one($")>>1)+1)}{one((one($;)<<$^)-(one ($")>>1)+$^+1)}}{{one(($~=$=)<<1^(one($")>>1)+$^+ 1)}{one((one($;)<<$^)-one($/)-1)}{one(((one($;)<< $^+1)+one($/)>>1)-$^-1)}}{one($=^(one($")>>1))';s ;{one;chr;g;y;{ne}}\012\040;.rd.;sd;eval;print;#1

Comment on There can be only one!
Download Code
RE: There can be only one!
by Anonymous Monk on May 15, 2000 at 21:18 UTC
    HAHA! you had to "one" up two cents eh? well, time for someone to get zero. Let's get cracking! maybe we can get every number from 0 to 100!
RE: There can be only one!
by Anonymous Monk on May 15, 2000 at 21:19 UTC
    btw. what do the >> and << mean? they were in two cents also
      They are bit-shift operators: They return the value of the left argument shifted left or right by the number of bits in the right argument.
      2<<4 #returns 32; 32>>3 #returns 4;


      vroom | Tim Vroom | vroom@cs.hope.edu
        could you explain this a little more in depth? i don't quite get what you mean by shifting the bytes
RE: There can be only one!
by raflach (Pilgrim) on May 15, 2000 at 23:34 UTC
    This is great!!!! and use strict!!!!!! WOW!!! Wish I could see more obfuscated code snippets this cool in form, but with more useful functionality! (Course if I want it why don't I write it right?) Oh well.
RE: There can be only one!
by ChuckularOne (Parson) on May 15, 2000 at 23:38 UTC
    Yow! That's a lot of work for a JAPH! Supercool, nonetheless. Once I get my coding skills up to snuff I've got to try some obfuscation.

    Your Humble Servant,
    -Chuck
RE: There can be only one!
by Anonymous Monk on May 20, 2000 at 07:52 UTC
    Sweet ass. The Kurgan would love it. If he was still together that is.
RE: There can be only one!
by Bourgeois_Rage (Beadle) on Jun 01, 2000 at 19:53 UTC
    Very nice. A bit surprising I must say

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://11590]
Approved by root
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: (2)
As of 2014-11-29 10:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (204 votes), past polls