uva-147 - Dollars
来源:互联网 发布:工作日计算软件 编辑:程序博客网 时间:2024/06/06 09:55
#include<iostream>#include<map>#include<string>#include<cstring>#include<cstdio>#include<cstdlib>#include<cmath>#include<queue>#include<vector>#include<algorithm>using namespace std;int coin[11]={10000,5000,2000,1000,500,200,100,50,20,10,5};long long dp[30010][20];long long dfs(int x,int s){int i;if(x<0)return 0;if(dp[x][s]!=-1)return dp[x][s];dp[x][s]=0;for(i=s;i<11;i++)dp[x][s]+=dfs(x-coin[i],i);return dp[x][s];}int main(){int i;double x;memset(dp,-1,sizeof(dp));for(i=0;i<11;i++)dp[0][i]=1;sort(coin,coin+11);dfs(30000,0);while(cin>>x){if(x==0)return 0;printf("%6.2f%17lld\n",x,max(dp[int((x+0.005)*100)][0],0ll));}}
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.202.000.00
Sample output
0.20 4 2.00 293
- UVA 147 - Dollars
- uva 147 Dollars
- uva 147 Dollars
- UVa 147Dollars
- Uva 147 Dollars
- UVA 147 Dollars
- UVa 147 Dollars 解答
- UVa 147 - Dollars
- UVa 147 - Dollars
- UVa 147 - Dollars 背包
- uva 147 - Dollars
- UVa 147 - Dollars
- UVa 147 - Dollars
- UVA-147-Dollars
- UVA 147 Dollars
- uva 147 - Dollars
- uva 147 Dollars
- UVa:147 Dollars
- rpath添加依赖库搜索路径
- SQL Server 致程序员(容易忽略的错误)
- JQuery/Javascript两个控件的focus和blur事件
- 【Leetcode】4Sum (Sum)
- java Pattern和Matcher详解
- uva-147 - Dollars
- Android电源管理
- jquery验证
- TCP/IP协议与Socket通信
- 一道职业能力测试题: 数正方形的个数
- 模板方法模式
- Arduino的详细介绍(基于Mega2560)(分文)——PWM的analogWrite()
- 用testsuite管理junit单元测试用例
- MongoDB常用操作命令大全