hdu---2069Coin Change

Coin Change

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

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

 

//一道深搜的题目！  与一般的深搜不同的是，这里的每个硬币可以使用多个！

//一开始不知道怎么处理，很多重复的情况；后来是加了一个参数变量y，来防止重复。

//另外因为Your program should be able to handle up to 100 coins.这句话没注意，wa了一次。

Code：

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int n;int t;
int f[6]={0,50,25,10,5,1};
void d(int num,int y,int z){
    int i;
    if(num==0 && z<=100){
        t++; return ;
    }
    z++;
    for(i=1;i<=5;i++){
        if(num>=f[i] && f[i]>=y){
            //d(num+f[i],k);
            d(num-f[i],f[i],z);
        }
    }
}
int main()
{
    freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int i,j,k;
    while(scanf("%d",&n)!=EOF){
        t=0;
        d(n,0,0);
        printf("%d\n",t);
    }
    return 0;
}