Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re^3: Challenge: Number of unique ways to reach target sum

by tall_man (Parson)
on Oct 12, 2006 at 06:26 UTC ( #577757=note: print w/replies, xml ) Need Help??


in reply to Re^2: Challenge: Number of unique ways to reach target sum
in thread Challenge: Number of unique ways to reach target sum

My second script can be used to generate all the partitions, just by running it for each index up to the count. You could even wrap it in an iterator, just like that Partitions::Unrestricted package you wrote a while ago.
  • Comment on Re^3: Challenge: Number of unique ways to reach target sum

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://577757]
help
Chatterbox?
NodeReaper takes a ball from the brass monkey

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (3)
As of 2016-12-10 10:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (160 votes). Check out past polls.