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
UVA674Coin Change母函数模板题目
最新推荐文章于 2021-03-24 00:12:10 发布
这篇博客介绍了如何运用动态规划(DP)方法解决UVA674 Coin Change问题。内容详细阐述了该ACM竞赛题目中的解题思路和母函数模板的应用,帮助读者理解如何在实际编程中解决此类找零问题。
摘要由CSDN通过智能技术生成