Can anybody try the below logic using c#.net?

Question

1.00/5 (3 votes)

See more:

I have the following denominations 2,3,7. If we pass an input to the function then the function should return the total number of combinations.

For Example I passed the input as 9. Then the function should return 3. Because when we add the denominations
2+2+2+3=9 - Combination 1.
3+3+3=9 - Combination 2.
2+7=9 - Combination 3.

Posted 4-Jul-13 21:49pm

Rajesh Buddaraju

Add a Solution

Comments

Sergey Alexandrovich Kryukov 5-Jul-13 3:54am

Isn't it a fairly simple problem for someone who published 45 answers and one article?
Please start here: http://whathaveyoutried.com.
—SA

Johnny J. 5-Jul-13 4:06am

Very good blog post you linked to there! (y)

Sergey Alexandrovich Kryukov 5-Jul-13 4:09am

:-)

1 solution

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)

Sergey Alexandrovich Kryukov · Answer 1 · 2013-07-04T22:08:00

The simple brute force approach would be this:

The general combination can be represented as

2A + 3B + 7C

where A, B and C are less or equal to 0 and no more then N/2, N/3 or N/7, where N is the required sum. Then you can list all the combinations in a triple nested loop and check up if each of them fit or not. This process is easy to optimize a bit, as once you found some combination or exceeded the sum, it would not make any sense to increment any of the factors. Also, think about proper ordering of those three loops.

This is the first thing which comes to mind.

—SA