134
技術社區[雲棲]
動態規劃-uva-674
uva-674- Coin Change
Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.
For example, if we have 11 cents, then we can make changes with one 10-cent coin and one 1-cent coin, two 5-cent coins and one 1-cent coin, one 5-cent coin and six 1-cent coins, or eleven 1-cent coins. So there are four ways of making changes for 11 cents with the above coins. Note that we count that there is one way of making change for zero cent.
Write a program to find the total number of different ways of making changes for any amount of money in cents. Your program should be able to handle up to 7489 cents.
Input
The input file contains any number of lines, each one consisting of a number for the amount of money in cents.
Output
For each input line, output a line containing the number of different ways of making changes with the above 5 types of coins.
Sample Input
11
26
Sample Output
4
13
大意：有5種麵值的硬幣，1、5、10、25、50分。給定找零總額，問有多少種組合方法。
分析：動態規劃。int不會溢出。
注意：HDOJ-2069 與此題類似。但有要求，硬幣總數不能超過100個。似乎要用母函數。高端，不會。。。
最後更新：2017-04-03 08:26:11