Description: 10. There are n different denominations of coins, each coin with a face value exists in the number of adequate T [n] Medium. Is to use these coins to find the money. Can use the various denominations of coins stored in an array of the number of Coins [n] Medium. The amount of money for any 0 < = m < = 20009, the design of a coin with minimal change, m method.
File list (Check if you may need any files):
findmoney.doc