HDOJ 2069 Coin Change

Coin Change

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

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
  
  

 

普通母函数变体。题意：有五种面值的硬币，50分，25分，10分，5分，1分。现在，比如我们有11分，那么这11分换成硬币可以是1个10分和1个1分，2个5分和1个1分，1个5分和6个1分以及11个1分这4种情况。现在告诉你我们手上拥有的钱数，问如果要换成硬币，有多少中换法。注意：总硬币数不能超过100。

       我的解题思路：一般的母函数都是限制每种硬币的个数，而本题是限制所有硬币总和。令钱数为x的指数，我们可以把数组多加一维存储硬币的个数，这样coe[i][j]就表示钱数为i硬币数为j的方案数就行了。计算的时候要多嵌套一个枚举硬币数的循环，然后除了超出题目最大钱数要break，超出硬币最大数量也要break就行了。

一.暴力枚举

AC CODE

#include
using namespace std;  
  
int main()  
{  
    ios::sync_with_stdio( false );  
    int num[3000] = { 0 };  
    for ( int i = 0; i < 6; i ++ ) {  
        for ( int j = 0; j < 11; j ++ ) {  
            for ( int k = 0; k < 26; k ++ ) {  
                for  ( int l = 0; l < 51; l ++ ) {  
                    for ( int p = 0; p < 251; p ++ ) {  
                        if ( ( i + j + k + l + p ) > 100 ) {  
                            break;  
                        }  
                        num[i*50+j*25+k*10+l*5+p] ++;  
                    }  
                }  
            }  
        }  
    }  
    int n;  
    while ( cin >> n ) {  
        cout << num[n] << endl;  
    }  
    return 0;  
}


二.

母函数

AC CODE

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include

using namespace std;

const int N = 251;
const int M = 101;

int coe[N][M], tmp[N][M];   // coe[i][j] 表示钱数为i硬币数为j的方案数
int val[5] = {1, 5, 10, 25, 50};
int ans[N];
int n;

void Init();

void Generate();

int main()
{
    Init();
    while (~scanf("%d", &n))
    {
        printf("%d\n", ans[n]);
    }
    return 0;
}

void Init()
{
    memset(ans, 0, sizeof(ans));
    Generate();
    ans[0] = 1;
    for (int i=1; i
    {
        for (int j=0; j
        {
            ans[i] += coe[i][j];
        }
    }
    return;
}

void Generate()
{
    memset(coe, 0, sizeof(coe));
    memset(tmp, 0, sizeof(tmp));
    coe[0][0] = 1;
    for (int i=0; i<5; ++i)
    {
        for (int j=0; j
        {
            for (int k=0; k
            {
                if (coe[j][k] == 0) continue;
                for (int l=0; l
                {
                    if (val[i] * l + j >= N) break;     // 超出最大钱数
                    if (k + l >= M) break;              // 超出硬币最大数量
                    tmp[val[i] * l + j][k + l] += coe[j][k];
                }
            }
        }
        memcpy(coe, tmp, sizeof(coe));
        memset(tmp, 0, sizeof(tmp));
    }
    return;
}