UVa 147 Dollars（DP完全背包）

最新推荐文章于 2021-05-24 07:12:39 发布

virgoDd

最新推荐文章于 2021-05-24 07:12:39 发布

阅读量596

点赞数

CC 4.0 BY-SA版权

分类专栏： -动态规划 -UVa -------- 专题 -------- --------- OJ --------- 文章标签： ACM DP UVA 完全背包小白

本文链接：https://blog.youkuaiyun.com/acvay/article/details/38725485

-------- 专题 -------- 同时被 3 个专栏收录

239 篇文章

订阅专栏

--------- OJ ---------

239 篇文章

订阅专栏

-UVa

77 篇文章

订阅专栏

本文讨论了一个关于背包问题的简化实例，并通过代码实现了解决方案。同时，介绍了如何利用不同面额的货币计算特定金额的所有可能组合方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

很水的完全背包题大家都会的只是要注意把小数化为整数不然精度丢失很严重；

#include<cstdio>
#include<cstring>
using namespace std;
long long d[30005];
int val[12]={10000,5000,2000,1000,500,200,100,50,20,10,5},a;
int main()
{
    double fm;
    d[0]=1;
    for(int i=0;i<11;++i)
        for(int j=val[i];j<=30000;j+=5)
            d[j]+=d[j-val[i]];
    while (scanf("%lf",&fm),a=int(fm*100+0.5))
        printf("%6.2lf%17lld\n",fm,d[a]);
    return 0;
}

Dollars

New Zealand currency consists of $100, $50, $20, $10, and $5 notes and $2, $1, 50c, 20c, 10c and 5c coins. Write a program that will determine, for any given amount, in how many ways that amount may be made up. Changing the order of listing does not increase the count. Thus 20c may be made up in 4 ways: 1 20c, 2 10c, 10c+2 5c, and 4 5c.

Input

Input will consist of a series of real numbers no greater than $300.00 each on a separate line. Each amount will be valid, that is will be a multiple of 5c. The file will be terminated by a line containing zero (0.00).

Output

Output will consist of a line for each of the amounts in the input, each line consisting of the amount of money (with two decimal places and right justified in a field of width 6), followed by the number of ways in which that amount may be made up, right justified in a field of width 17.

Sample input

0.20
2.00
0.00

Sample output

  0.20                4
  2.00              293