Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

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

by thor (Priest)
on Feb 14, 2006 at 15:24 UTC ( [id://530139]=note: print w/replies, xml ) Need Help??


in reply to Challenge: Number of unique ways to reach target sum

I have to wonder: is there something special about the target of 667? For the solution that you came up with, does it generalize to other targets?

thor

The only easy day was yesterday

  • Comment on Re: Challenge: Number of unique ways to reach target sum

Replies are listed 'Best First'.
Re^2: Challenge: Number of unique ways to reach target sum
by Limbic~Region (Chancellor) on Feb 14, 2006 at 15:43 UTC
    thor,
    It is a somewhat arbitrary number chosen to reduce the search space. I had 10 numbers with a max of 100 and got 10 * 100 = 1000. I took 2/3 of that and got 667. My solution involves creating an upper and lower boundary through the search space to walk through and I wanted to make it narrow enough to complete this century.

    Cheers - L~R

[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://530139]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others examining the Monastery: (3)
As of 2024-04-19 01:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found