Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Re: (Golf) Fragment Reassembly

by dws (Chancellor)
on May 03, 2001 at 11:11 UTC ( #77593=note: print w/replies, xml ) Need Help??


in reply to Re: (Golf) Fragment Reassembly
in thread (Golf) Fragment Reassembly

Ok, here's my current solution at 192 chars.

If we're only counting inside of sub assemble { ... } then I count 185 characters (and it passes my stress tests). Though if you use "assemble", as the problem statement suggests, you're up back up to 192 characters. Still, that's excellent.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://77593]
help
Chatterbox?
[LanX]: ellipse aka ... aka yadda yadda is a new command
[LanX]: sopw!
[1nickt]: Sorry kgb can't help there, not a perltidy user.

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













    Results (277 votes). Check out past polls.

    Notices?