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[@_];
In reply to Most CPU-consuming JAPH ever! by nif
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |