UVa 147 Dollars(DP完全背包)
2014-08-21 09:42
731 查看
#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 |
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 inwhich 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
相关文章推荐
- 【解题报告】uva147_Dollars(美元, dp, 完全背包)
- UVa 147 Dollars(DP完全背包)
- UVa 147 Dollars (浮点数完全背包)
- uva 147 Dollars(完全背包)
- Uva 147 Dollars(是完全背包)
- UVA - 147 Dollars (完全背包 入门题)
- uva147 Dollars ——完全背包
- uva147 - Dollars(完全背包)
- UVA147 完全背包DP(坑爹精度题)
- UVa 147 Dollars (完全背包)
- uva 147 Dollars(完全背包)
- UVA 147 Dollars(完全背包)
- UVA 147 Dollars (完全背包)
- UVA 147 Dollars 刀了(完全背包,精度问题)
- Uva 147 Dollars 完全背包
- uva 147 Dollars (dp + 完全背包)
- uva 147 - Dollars 钱币兑换问题(浮点数) 精度问题 完全背包
- uva 147 Dollars(完全背包)
- UVA 147 Dollars ( 完全背包+求解方案数精度问题)
- 【完全背包】UVA 147 Dollars