【HDU2069】【Coin Change】
来源:互联网 发布:制作ubuntu u盘启动盘 编辑:程序博客网 时间:2024/06/01 13:53
Coin Change
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15568 Accepted Submission(s): 5263
Problem Description
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, or two 5-cent coins and one 1-cent coin, or 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 100 coins.
For example, if we have 11 cents, then we can make changes with one 10-cent coin and one 1-cent coin, or two 5-cent coins and one 1-cent coin, or 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 100 coins.
Input
The input file contains any number of lines, each one consisting of a number ( ≤250 ) 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
1126
Sample Output
413
Author
Lily
Source
浙江工业大学网络选拔赛
Recommend
linle | We have carefully selected several similar problems for you: 1171 1398 1085 1028 2152
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std; int a[5] = {1,5,10,25,50};const int maxn = 300;const int maxnums = 100;int dp[maxn][110]; // dp[i][j] 表示的是货币总额恰好为i时候 并且所用货币种类数小于等于j 的方案总数int main(){memset(dp,0,sizeof(dp));for(int i=0;i<=100;i++){dp[0][i] = 1;}for(int i=0;i<5;i++){<span style="color:#ff0000;">for(int j=a[i];j<=300;j++)</span>{<span style="color:#ff0000;">for(int k=1;k<=100;k++) 可以互换位置只要i在外面就可以了</span>{dp[j][k] += dp[j-a[i]][k-1] ;}}}//dp[j][k] = dp[j-a[i]][k-1] + a[i]; // j从小到大 k从小到大 i在最外面 int x;while(scanf("%d",&x) != EOF){printf("%d\n",dp[x][100]);} return 0;}
0 0
- HDU2069 Coin Change,背包
- HDU2069 Coin Change 背包
- HDU2069 Coin Change 【暴力】
- HDU2069 Coin Change
- HDU2069 Coin Change (DP)
- 【HDU2069】【Coin Change】
- HDU2069 Coin Change(暴力)
- hdu2069 Coin Change
- 【背包/母函数】HDU2069-Coin Change
- Coin Change(hdu2069,暴力or母函数)
- 【母函数】hdu2069(Coin Change)母函数加深
- HDU2069 Coin change HDU 1114 Piggy-Bank HDU1712 ACboy needs your help
- HDU2069 & UVA 674 Coin Change(换硬币 dp 入门经典水题,背包问题)
- Coin Change
- Coin Change
- Coin change
- Coin Change
- Coin change
- 嵌入式操作系统ucos与linux比较
- SQL注入与编码技术
- NYOJ214单调递增子序列(二)【dp+二分查找】
- objective C程序 无参方法和有参方法声明实现及调用
- 机试算法讲解: 第23题 哦,最小公倍数
- 【HDU2069】【Coin Change】
- 黑马程序员——collection的Set集合
- PHP - 0 - 学习PHP概述
- 页面布局-百度首页
- 机试算法讲解:第24题 大水题:谁是素数?
- 控件布局——RelativeLayout(中)
- LVS集群之十种调度算法及负载均衡——理论
- 机试算法讲解: 第25题 人人都爱素数筛选法
- Windows 10 VHD安装