HDU 2069 Coin Change

Posted zlrrrr

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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;
}

  





以上是关于HDU 2069 Coin Change的主要内容,如果未能解决你的问题,请参考以下文章

hdu 2069 Coin Change(完全背包)

HDU2069 Coin Change(基础DP)

HDU2069 Coin Change(基础DP)

#2069:Coin Change(完全背包)

[HDOJ]Coin Change(DP)

HDU-2016 Coin Change (母函数 | 多重背包)