HDOJ 2069 Coin Change(母函数)

Coin Change

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10289    Accepted Submission(s): 3451

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.

 

 

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

 

 

Author

Lily

 

 

Source

浙江工业大学网络选拔赛

 

 

Recommend

linle

 

//加一维限制数量。。。。。。

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int value[6]={0,1,5,10,25,50};

int c1[300][110],c2[300][110];
int n;

int main()
{
while(scanf("%d",&n)!=EOF)
{
   memset(c1,0,sizeof(c1));
   memset(c2,0,sizeof(c2));

   for(int i=0;i<=min(n,100);i++)
   {
        c1[i][i]=1;
   }

   for(int i=2;i<=5;i++)
   {
       for(int j=0;j<=n;j++)
       {
           for(int k=0;k+j<=n;k+=value[i])
           {
               for(int l=0;l<=100&&l+k/value[i]<=100;l++)
               {
                   c2[j+k][l+k/value[i]]+=c1[j][l];
               }
           }
       }

       for(int j=0;j<=n;j++)
       {
           for(int k=0;k<=100;k++)
           {
               c1[j][k]=c2[j][k];
               c2[j][k]=0;
           }
       }
   }

   int ans=0;
   for(int j=0;j<=100;j++)
   {
       ans+=c1[n][j];
   }

   printf("%d\n",ans);

}
    return 0;
}