Description: With n different coins, the face value of the coins stored in the array of T 〔1: n〕 in. Now use these coins to find the money. You can use the number of coins of various denominations stored in the array Coins 〔1: n〕 in.
The amount of money for any 0 ≤ m ≤ 20001, find the money to design a coin with at least m of the method.
To Search:
- [4.16] - Data structure in the greedy algorithm,
- [120] - Algorithm to achieve optimal decompositi
File list (Check if you may need any files):
lesscoins\program\program\program.vcproj
.........\.......\.......\program.vcproj.LIJIAQIAN2_1.Administrator.user
.........\.......\.......\Debug\BuildLog.htm
.........\.......\.......\.....\program.exe.embed.manifest
.........\.......\.......\.....\vc80.idb
.........\.......\.......\.....\vc80.pdb
.........\.......\.......\.....\program.exe.embed.manifest.res
.........\.......\.......\.....\program.exe.intermediate.manifest
.........\.......\.......\.....\mt.dep
.........\.......\.......\.....\lesscoins.obj
.........\.......\.......\lesscoins.cpp
.........\.......\program.ncb
.........\.......\program.sln
.........\.......\program.suo
.........\.......\debug\program.exe
.........\.......\.....\program.pdb
.........\.......\.....\program.ilk
.........\.......\program\Debug
.........\.......\program
.........\.......\debug
.........\program
lesscoins
Download