Description: Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.
To Search:
File list (Check if you may need any files):
test3-5\Debug\BuildLog.htm
.......\.....\mt.dep
.......\.....\stdafx.obj
.......\.....\test3-5.exe.embed.manifest
.......\.....\test3-5.exe.embed.manifest.res
.......\.....\test3-5.exe.intermediate.manifest
.......\.....\test3-5.obj
.......\.....\test3-5.pch
.......\.....\vc90.idb
.......\.....\vc90.pdb
.......\ReadMe.txt
.......\stdafx.cpp
.......\stdafx.h
.......\targetver.h
.......\test3-5.cpp
.......\test3-5.vcproj
.......\test3-5.vcproj.B9F12BE2664840F.Administrator.user
.......\Debug
test3-5
Download