Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

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.

Comment on Re: Re: (Golf) Fragment Reassembly
Download Code

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://77593]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (5)
As of 2015-11-27 17:07 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (731 votes), past polls