UVa 147 - Dollars 背包

最新推荐文章于 2014-07-27 16:16:01 发布

cyendra

最新推荐文章于 2014-07-27 16:16:01 发布

阅读量802

点赞数

分类专栏：解题报告 DP 文章标签：动态规划题解

本文链接：https://blog.csdn.net/cyendra/article/details/8867201

版权

解题报告同时被 2 个专栏收录

260 篇文章 0 订阅

订阅专栏

89 篇文章 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

----------------------------

精度............为什么不能直接读double呢orz

-----------

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

//const int coins[12]={2000,1000,400,200,100,40,20,10,4,2,1};
const int coins[12]={1,2,4,10,20,40,100,200,400,1000,2000};
long long f[40000];
double money;
int m;

int main()
{
    memset(f,0,sizeof(f));
    f[0]=1;
    for (int i=0; i<11; i++)
    {
        for (int j=0; j<=6000-coins[i]; j++)
        {
            if (f[j])
            {
                f[j+coins[i]]+=f[j];
            }
        }
    }
    int a,b;
    //while (~scanf("%lf",&money))
    while (~scanf("%d.%d",&a,&b))
    {
        if (a==0&&b==0) break;
        m=a*20+b/5;
        money=double(a)+double(b)/100;
        printf("%6.2lf",money);
        printf("%17lld\n",f[m]);
    }
    return 0;
}