UVA 674 Coin Change（完全背包）

最新推荐文章于 2021-04-29 13:43:00 发布

原创最新推荐文章于 2021-04-29 13:43:00 发布 · 386 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

背包dp 专栏收录该内容

16 篇文章

订阅专栏

博客围绕UVA 674 Coin Change题目展开，题目给出5种硬币（1、5、10、25、50），要求计算一定金额由这些硬币组成的方式数量。解题思路是将其看作完全背包模型，给出二维和一维dp转移方程，本题求方案数时用dp[j]=dp[j]+dp[j - cost[i]]。

UVA 674 Coin Change 解题报告

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87730#problem/E

题目：

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, two 5-cent coins and one 1-cent coin, 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 7489 cents.

Input

The input file contains any number of lines, each one consisting of a number 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

11
26

题目大意：

有5种硬币，分别是1，5,10,25,50。现有一定金额的钱由这5种硬币组成，求共有多少种组成方式。

思路：每种硬币可以无限制取，可以看成完全背包模型，dp[i][j]表示前i种硬币组成j元，完全背包的二维dp转移方程就是dp[i][j]=max(dp[i][j],dp[i-1][j-k*cost[i]]+k*w[i])(0<=k*cost[i]<=j)，一维的是dp[j]=max(dp[j],dp[j-cost[i]]+w[i])，本题求的是方案数，所以是dp[j]=dp[j]+dp[j-cost[i]]

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5;
int c[]={0,1,5,10,25,50};
int main()
{
    int dp[maxn],n;
    memset(dp,0,sizeof(dp));
    dp[0]=1;
    for(int i=1;i<=5;i++)
    {
        for(int j=0;j<maxn;j++)
            dp[j+c[i]]=dp[j]+dp[j+c[i]];
    }
    while(scanf("%d",&n)!=EOF)
        printf("%d\n",dp[n]);
    return 0;
}