Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re: Mission: Obfuscation (1)

by jryan (Vicar)
on Nov 19, 2002 at 06:45 UTC ( #214040=note: print w/replies, xml ) Need Help??


in reply to Mission: Obfuscation (1)

I was a bit disappointed that I had to follow a certain algorithm, but at least I took a few liberties with the 2nd step (Iterate over the expression x^2 + x + p such that 0 < x < p). Oh, and there isn't a single loop, if/unless statement, or subroutine in my entire program ;)

#!/usr/bin/perl -w use strict; my($p,$x)=3;p:{$x=0;x:{$_='s`.*(\\$x\\*\\*2\\+\\$x\\+\\$p).*`$1`ee'; eval"y/\\\\//d;$_";keys%_>$ARGV[0]-2?last p:(1x($_))!~/^(11+?)\1+$/x &&!exists$_{$_}?++$_{$_}:1;++$x;;$x<$p?goto x:last}$p=(sort{$b<=>$a} keys%_)[0];;goto p}$,=$";eval "@{[print=>q<2,sort{$a<=>$b}keys%_>]}"

Enjoy. (at least until BooK tops it!)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://214040]
help
Chatterbox?
[marto]: someone else writes: [http://www. evanmiller.org/why -im-learning-perl- 6.html|
[marto]: err, Why Iím Learning Perl 6

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (8)
As of 2017-07-26 14:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (395 votes). Check out past polls.