Re^4: How to generate restricted partitions of an integer

Sorry, I can not express it any better. Look at the example please. The answer, 50 is correct. I think 'How many ways' is good. Just search for any combination of 100, 50, 20 , 10 and 5 euro notes where the sum is 100 without repeating a combination. I hope it is clearer to you now.

Boris

Comment on Re^4: How to generate restricted partitions of an integer

Replies are listed 'Best First'.
Re^5: How to generate restricted partitions of an integer by thor (Priest) on Nov 11, 2004 at 17:27 UTC
Okay...now I understand the problem. If I dust of my math degree...I think this could be solved with generating functions. Basically, calculate (x+ x5+ x10 + x20 + x50 + x100)100 and find the coeffieient of x**100 in the resulting polynomial. Easy...;) thor `Feel the white light, the light within Be your own disciple, fan the sparks of will For all of us waiting, your kingdom will come`	[reply]
Re^6: How to generate restricted partitions of an integer by borisz (Canon) on Nov 11, 2004 at 18:17 UTC
Whow, that is pretty close. SubsetSumProblem. Boris	[reply]


Keep It Simple, Stupid
	PerlMonks