hdu 2069 限制个数的母函数（普通型）

Coin Change

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

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

题意: 能不能用1 5 10 25 50 组成输入的数，并且使用的个数不能超过100个。

思路:

多加一维维护个数。a[j][l] 表示值为j，用了l个的时候有多少种方案。

#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define INF 1000000001
#define MOD 1000000007
#define ll long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define pi acos(-1.0)
using namespace std;
const int MAXN = ;
int c[MAXN][],tp[MAXN][],n,val[];
int main()
{
    val[] = ,val[] = ,val[] = ,val[] = ,val[] = ;
    while(~scanf("%d",&n)){
        if(!n){
            puts("");
            continue;
        }
        memset(c,,sizeof(c));
        memset(tp,,sizeof(tp));
        for(int i = ; i <= min(n,); i++){
            c[i][i] = ;
        }
        for(int i = ; i <= ; i++){
            for(int j = ; j <= n; j++){
                for(int k = ; k + j <= n; k += val[i]){
                    for(int l = ; l + k / val[i] <= ; l ++){
                        tp[j + k][l + k / val[i]] += c[j][l];
                    }
                }
            }
            for(int j = ; j <= n; j++){
                for(int k = ; k <= ; k++){
                    c[j][k] = tp[j][k];
                    tp[j][k] = ;
                }
            }
        }
        int ans = ;
        for(int i = ; i <= ; i++){
            ans += c[n][i];
        }
        cout<<ans<<endl;
    }
    return ;
}