HDUOJ----Coin Change

Coin Change

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

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

浙江工业大学网络选拔赛

 

思路： 此题可以采取dfs，但是用分治法还是可以的，优化一下可以达到15ms......

在此贴出代码：

 #include<iostream>
 using namespace std;
 int main()
 {
     int n,count;
     int j,k,m,g,l;
     while(cin>>n)
     {
         count=;
         for( j=;j<=n/;j++)   //
         {
             k=m=g=l=;
             if(n==j*+k*+m*+g*+l)
                         {
                            count++;
                            break;
                         }
                         else
                             if(n<j*+k*+m*+g*+l)
                                 break;

             for( k=;k<=n/;k++)   //
             {
                 m=g=l=;
                 if(n==j*+k*+m*+g*+l)
                         {
                            count++;
                            break;
                         }
                         else
                             if(n<j*+k*+m*+g*+l)
                                 break;
                 for( m=;m<=n/;m++)   //
                 {
                     g=l=;
                     if(n==j*+k*+m*+g*+l)
                         {
                            count++;
                            break;
                         }
                         else
                             if(n<j*+k*+m*+g*+l)
                                 break;
                     for( g=;g<=n/;g++)  //
                     {
                         l=;
                         if(n==j*+k*+m*+g*+l)
                         {
                            count++;
                            break;
                         }
                         else
                             if(n<j*+k*+m*+g*+l)
                                 break;
                       for( l=;l<=-j-k-m-g;l++)  //
                       {
                         if(n==j*+k*+m*+g*+l)
                         {
                            count++;
                            break;
                         }
                         else
                             if(n<j*+k*+m*+g*+l)
                                 break;
                        }
                     }
                 }
             }
         }

     cout<<count<<endl;
     }
 return ;
 }