有n种不同面值的硬币，各硬币面值存于数组T[1:n] 现用这些面值的钱来找钱；各面值的个数存在数组Coins[1:n]中。

对于给定的1<=n<=10，硬币面值数组、各面值的个数及钱数m，0<=m<=2001，编程计算找钱m的最少硬币数。

-There are n different denominations of coins, each coin denomination stored in the array T [1: n]　current face value of money with these find money　the number of each denomination there are an array of Coins [1: n] in. For a given 1 < = n < = 10, an array of coin denominations, the denomination of the money number and the number m, 0 < = m < = 2001, m program calculate the minimum number of coins find money.