链接:http://acm.hdu.edu.cn/showproblem.php?pid=2069
题目:
Coin Change
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13076 Accepted Submission(s): 4367
Problem Description
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, or two 5-cent coins and one 1-cent coin, or 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 100 coins.
For example, if we have 11 cents, then we can make changes with one 10-cent coin and one 1-cent coin, or two 5-cent coins and one 1-cent coin, or 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 100 coins.
Input
The input file contains any number of lines, each one consisting of a number ( ≤250 ) 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
解题思路:
可以直接暴力,也可以用母函数来做。这里,我们介绍一下母函数的做法,关于母函数如果不清楚,可以参见http://blog.csdn.net/u010084308/article/details/36001887;
这题是个母函数的变形,在一般母函数的基础之上加上了一个限制条件,限制硬币的总个数不超过100,这样的话,我们就需要用二维数组来表示了,c1[251][101],第一维表示钱数,第二维表示使用的硬币的数目。这题数据量不大,我们可以离线打表。
代码:
#include <cstdio>
#include <cstring>
const int MAXN = 255;
int c1[MAXN][MAXN], c2[MAXN][MAXN];
int main()
{
int n, a[5] = {1, 5, 10, 25, 50};
int ans[MAXN];
memset(ans, 0, sizeof(ans));
memset(c1, 0, sizeof(c1));
memset(c2, 0, sizeof(c2));
c1[0][0] = 1;
for(int i = 1; i <= 5; i++)
{
for(int j = 0; j <= MAXN-5; j++)
{
for(int k = 0; j+k <= MAXN-5; k += a[i-1])
{
for(int p = 0; p+k/a[i-1]<= 100; p++)
c2[j+k][p+k/a[i-1]] += c1[j][p];
}
}
for(int j = 0; j <= MAXN-5; j++)
{
for(int k = 0; k <= 100; k++)
{
c1[j][k] = c2[j][k];
c2[j][k] = 0;
}
}
}
for(int j = 0; j <= MAXN-5; j++)
{
for(int i = 0; i <= 100; i++)
ans[j] += c1[j][i];
}
while(~scanf("%d", &n))
{
printf("%d\n", ans[n]);
}
return 0;
}