Marc Majcher wrote:
> Also, the ICFP Programming Contest just started about an hour ago:
>
> http://icfpcontest.cse.ogi.edu/
> http://icfpcontest.cse.ogi.edu/task.html
>
> You've got 72 hours to get in there and get your Perl on with those
> Haskell, Dylan and O'Caml types.
While it's a really good way to waste time, it sounds interesting :)
The problem is: How are you going to make execution time per turn stay below
a second (see the rules)? That's not much for such a task and Perl.
Steffen
--
@n=(544290696690,305106661574,116357),$b=16,@c=' ,JPacehklnorstu'=~
/./g;for$n(@n){map{$h=int$n/$b**$_;$n-=$b**$_*$h;$c[@c]=$h}c(0..9);
push@p,map{$c[$_]}@c[c($b..$#c)];$#c=$b-1}print@p;sub'c{reverse @_}
