Coin Change
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
五种硬币,1,5,10,25,50,给出一个数,看有几种组成方式。
有点坑了,少看了一个条件(硬币数目要少于00)
就母函数模板有点变形而已。
#include <iostream>
using namespace std;
int c1[255][111],c2[255][111];
int main()
{
int val[6]={22222,1,5,10,25,50};
int i,j,k,l,n;
while(~scanf("%d",&n))
{
int sum=0;
memset(c1,0,sizeof(c1));
memset(c2,0,sizeof(c2));
for(i=0;i<=100;i++)
c1[i][i]=1;//1分的硬币肯定有一种
for(i=2;i<=5;i++)
{
for(j=0;j<=n;j++)
for(k=0;k+j<=n;k+=val[i])
for(l=0;l+k/val[i]<=100;l++)//判断硬币个数
c2[k+j][l+k/val[i]]+=c1[j][l];
for(j=0;j<=n;j++)
for(k=0;k<=100;k++)
c1[j][k]=c2[j][k],c2[j][k]=0;
}
for(i=0;i<=100;i++)
sum+=c1[n][i];
printf("%d\n",sum);
}
return 0;
}