10.　　设有n种不同面值的硬币，各硬币的面值存在于数足T[n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[n]中。对任意钱数0<=m<=20009，设计一个用最少硬币找钱m的方法。-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.