zoukankan      html  css  js  c++  java
  • HDU 2069 Coin Change

    http://acm.hdu.edu.cn/showproblem.php?pid=2069

    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
     
    代码:
    #include <bits/stdc++.h>
    using namespace std;
    
    const int maxn = 1e5 + 10;
    int a[1111][1111];
    int b[6]= {1, 5, 10, 25, 50};
    
    int main()
    {
        int n;
        while(~scanf("%d", &n))
        {
            memset(a, 0, sizeof(a));
            a[0][0]=1;
            for(int j = 0; j <= 4; j ++)
            {
                for(int i = b[j]; i <= n; i ++)
                {
                    for(int k = 1;k <= 100; k++)
                    {
                        if(i >= b[j])
                            a[k][i] += a[k-1][i - b[j]];
                    }
                }
            }
            int sum = 0;
            for(int i = 0; i <= 100; i ++)
            {
                sum += a[i][n];
            }
            printf("%d
    ",sum);
        }
        return 0;
    }
    

      

  • 相关阅读:
    笔记
    作用域及this指向案例总结
    笔记
    JS 事件(捕获和冒泡 兼容性写法)
    tab标签
    笔记
    JS入门(10.16)
    JS入门(10.15)
    关键渲染路径
    Practice1小学四则运算(改进)
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9380171.html
Copyright © 2011-2022 走看看