coin-change

Coin change problem with infinite number of coins of each denomination

I want to know the idea of algorithm for the coin change problem where each denomination has infinte number of coins. Means how to apply DP (like the standard coin change problem) For e.g in set 1,10,15, change for 35 gives--2 coins of 10 and one coin of 15 Also give me an idea of brute forcing algorithm for this. I know to iterate ove...

coin changing problem

suppose i have a set of coins having denominations a1, a2, ... ak. one of them is known to be equal to 1. i want to make change for all integers 1 to n using the minimum number of coins. any ideas for the algorithm. eg. 1, 3, 4 coin denominations n = 11 optimal selection is 3, 0, 2 in the order of coin denominations. n = 12 optimal ...