Description: N has a different face value coins, the face value of the coins stored in the array T [1: n] in. Is to use these coins to find the money. Can use the various denominations of the coins stored in an array of the number of Coins [1: n] in. The amount of money for any 0 < = m < = 20001, the design of a coin with at least the method of m money.
- [ofcoins.Rar] - c write a data structure for the procedu
- [power] - Multiple power-counting problems ?Descri
- [findmoney] - 10. There are n different denominations
- [code] - Algorithm acm C++
File list (Check if you may need any files):
20060830113 宋溪 最少硬币问题
.............................\zuishaoyingbi.cpp
.............................\zuishaoyingbi.exe
.............................\最少硬币问题.doc
Download