hdu 2069 Coin Change 背包。本来打算用母函数再写一遍的,发现代码极其相似,就没写
来源:互联网 发布:mac怎么解压zip 编辑:程序博客网 时间:2024/04/28 16:39
Coin Change
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14982 Accepted Submission(s): 5070
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
浙江工业大学网络选拔赛
由于最多只能用100枚硬币,所以数组得再加一维
dp[i][j]代表的是总额为i需要j枚硬币。
dp[i][j] = dp[i-v][j-1] ;
代码;
#include <stdio.h>#include <string.h>#define MAX 300#define COUNT 100const int type[]={50,25,10,5,1} ;int dp[MAX][110] ;int max(int a , int b){return a>b?a:b ;}int main() {dp[0][0] = 1 ;for(int i = 0 ; i < 5 ; ++i){for(int j = type[i] ; j <= 250 ; ++j){for(int m = 0 ; m < 100 ; ++m){dp[j][m+1] += dp[j-type[i]][m] ;}}}int n ;while(~scanf("%d",&n)){int ans = 0 ;for(int i = 0 ; i <= 100 ; ++i)ans += dp[n][i] ;printf("%d\n",ans) ;}return 0 ;}
与君共勉
0 0
- hdu 2069 Coin Change 背包。本来打算用母函数再写一遍的,发现代码极其相似,就没写
- hdu 2069 Coin Change (母函数)
- [母函数]HDU 2069 Coin Change
- 【母函数】HDU-2069 Coin Change
- HDU 2069 Coin Change 母函数求解
- hdu 2069 Coin Change(母函数)
- HDU -- 2069 Coin Change 【母函数进阶】
- HDU-2069 Coin Change (母函数)
- HDU 2069 Coin Change【带总数限制的母函数】
- 【背包/母函数】HDU2069-Coin Change
- 杭电hdu 2069 Coin Change 母函数
- UVa 674 & hdu 2069 Coin Change (母函数,dp)
- (简单母函数进阶版,暴力)hdu 2069 Coin Change
- uva 674 && hdu 2069 coin change(动态规划、母函数)
- HDU 2069 Coin Change
- hdu 2069 Coin Change
- HDU 2069 Coin Change
- HDU 2069 Coin Change
- 计算机网络复习——以太网
- Android之Widget
- 商业新闻稿的写作和发布
- prim算法
- mysql : Lock wait timeout exceeded; try restarting transaction
- hdu 2069 Coin Change 背包。本来打算用母函数再写一遍的,发现代码极其相似,就没写
- 就业报到证的常见问题解答汇总
- iOS 开发实用工具
- 欢迎使用CSDN-markdown编辑器
- std::string 是否包含字串
- Oracle trunc()函数的用法
- The transaction log for database 'xx' is full,Error: 9002, Severity: 17, State: 2
- 点击Edittext之外的地方关闭Edittext
- meteor 自定义账户系统