Finding possible combination where Sum is equal to something

Question

0.00/5 (No votes)

See more:

Hi,

I have a requirement where i have to find a list of combinations where the sum =180.
I have an array of intergers and have to pick up the elements from this array only.

For example :
Array = {30,45,60,15,60,30}
now i as an output should get - 60,60,30,30 or 45,15,60,30,30 or 45,15,60,60

I am trying various approaches but its failing in one or the other scenario.

Please provide inputs.

Thanks

Posted 11-Nov-13 0:42am

adityasahver

Add a Solution

Comments

Richard MacCutchan 11-Nov-13 6:53am

Show some of the approaches you are using, and the errors you receive.

agent_kruger 11-Nov-13 6:54am

do you just need multiple records that give the sum 180

2 solutions

Solution 1

refer these links
http://stackoverflow.com/questions/19437855/algorithm-for-finding-a-group-of-numbers-in-a-list-that-equal-a-target[^]

http://stackoverflow.com/questions/10738926/efficient-algorithm-to-find-a-combination-which-summation-is-equal-to-a-known-n[^]

Posted 11-Nov-13 0:56am

Raajkumar.b

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

**Orcun Iyigun** · Accepted Answer · 2013-11-11T00:57:00

It is called subset sum problem[^] and here are your solutions:
Efficient algorithm to find a combination, which summation is equal to a known number, in a set of number[^]
Algorithm to find which numbers from a list of size n sum to another number[^]
Backtracking – Subset sum with C#[^]
Efficient way to generate combinations ordered by increasing sum of indexes[^]

Good luck,
OI