A slightly different art of algorithmic obfuscation ...

( with hope that some Monks find it amusing )

#!/usr/bin/env perl $_ = 'Leave aerobic shrink curriculum, try Public starvation, write in +tractable lustrous JAPH - both work.'; $X = 44802; sub _{$s += ++$n * ord for @_; $n %= @I; $s %= $X}; @I = split ''; $_I = _@I; $_/=$_ for @_ = 1..$_I%34; for (0..$X) { $J = $c++ % @_; $V = $_[$J]; for (2..@_) { $j = ($J + ++$i) % @_; $_[$j] = ( ($_=$V) + ($V=$_[$j]) ) % @I; } last if $_I == _@I[@_]; ($i+=1) %= @_; } print @I[@_];

Replies are listed 'Best First'.
Re: Most CPU-consuming JAPH ever!
by nif (Sexton) on Jan 12, 2011 at 19:50 UTC

    Today i discussed the code with some colleagues, and i had to give some explanations before they smile. Some things becomes truly obscure only after they are explained. So i decided to give some comments about the code above.

    It's magic...

Re: Most CPU-consuming JAPH ever!
by tilly (Archbishop) on Jan 12, 2011 at 20:03 UTC
      Thank you for the link, i didn't saw this one before - it's really nice...
      Shell we try to pick more JAPHs together (a kind of JAPH index), the list on http://www.cpan.org/misc/japh is really incomplete?