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

Re^3: Golf: Buying with exact change

by blokhead (Monsignor)
on Feb 22, 2005 at 18:16 UTC ( #433438=note: print w/ replies, xml ) Need Help??

in reply to Re^2: Golf: Buying with exact change
in thread Golf: Buying with exact change

Here's a solution that doesn't have the arbitrary restriction on the solution size, although since it uses the same regex trick as above, the inputs must still be <32k. It's 75 characters:

($",$n,$_)="}|1{";while($n++<$_[-1]){$_.=1;/^(1{@_})*$/ or$n=0}length()-pop

But the non-regex ideas are interesting to me, as I wasn't sure it was easily possible without the regex logic.


Comment on Re^3: Golf: Buying with exact change

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (8)
As of 2015-12-01 03:13 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 (792 votes), past polls