Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

bzip your JaPH today!

by ariels (Curate)
on Feb 27, 2002 at 14:09 UTC ( #147901=obfuscated: print w/replies, xml ) Need Help??

We theoreticians always claim it's worth expending extra effort to find the best algorithm for the task. As you can see, the program itself is entirely straightforward Perl.
#!/usr/local/bin/perl -w use strict; my$t=",rtlr\n h ahkP tcraneeeusoJ"; my$s=join'',sort split//,$t; my(@t); while ($s=~/(.)\1*/sg){my$l=$1;push@t,(pos$t)-1 while$t=~/$l/g} my$i=0;print map{substr($s,$i=$t[$i],1)}(1..@t)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://147901]
Approved by root
help
Chatterbox?
[karlgoethebier]: ...good Hot tuna. Note the stacks & racks in the background
[karlgoethebier]: ..the last hippies. They still perform. At least the survivors...
[Discipulus]: not survived
[Discipulus]: has pm some danish monk?
[Discipulus]: erix the problem was not rain in the brain.. ;=)

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (8)
As of 2017-11-17 20:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (272 votes). Check out past polls.

    Notices?