zoukankan      html  css  js  c++  java
  • 5F

    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

     1 #include<stdio.h>
     2 int main()
     3 {
     4     int n,m, a,b,c,d,e;
     5     while(~scanf("%d", &n))
     6     {
     7         if(n)
     8         {
     9             m=0;
    10             for(a=0;a<=5;a++)
    11                 for(b=0;b<=10-2*a;b++)
    12                     for(c=0;c<=25-5*a-2*b;c++)
    13                         for(d=0;d<=50-10*a-5*b-2*c;d++)
    14                             for(e=0;e<=100-a-b-c-d;e++)
    15                                 if(50*a+25*b+10*c+5*d+e==n)
    16                                 { m++; break; }
    17             printf("%d
    ", m);
    18         }
    19         else printf("1
    ");
    20     }
    21     return 0;
    22 }
    View Code
    // 背包怎么做T^T
  • 相关阅读:
    POJ3259 Wormholes
    leetCode-Plus One
    leetCode-Pascal's Triangle
    leetCode-Longest Continuous Increasing Subsequence
    leetCode-Missing Number
    leetCode-Maximum Product of Three Numbers
    leetCode-Image Smoother
    leetCode-Contains Duplicate
    机器学习实战笔记-使用Apriori算法进行关联分析
    leetCode-Degree of an Array
  • 原文地址:https://www.cnblogs.com/goldenretriever/p/10355813.html
Copyright © 2011-2022 走看看