UVa 674 Coin Change (完全背包&最优解的方案数)
2013-09-23 00:00
447 查看
674 - Coin Change
Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=615
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, two 5-cent coins and one 1-cent coin, 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 7489 cents.
Input
The input file contains any number of lines, each one consisting of a number 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
11 26
Sample Output
4 13
完整代码:
/*0.042s*/ #include<cstdio> #include<cstring> const int maxn = 7490; const int coin[5] = {1, 5, 10, 25, 50}; int dp[maxn]; int main(void) { int n; memset(dp, 0, sizeof(dp)); dp[0] = 1; for (int k = 0; k < 5; ++k) for (int i = coin[k]; i < maxn; ++i) dp[i] += dp[i - coin[k]]; ///方案数叠加起来 while (~scanf("%d", &n)) printf("%d\n", dp ); return 0; }
相关文章推荐
- UVa 674 Coin Change(完全背包)
- UVA 674 Coin Change(完全背包)
- UVA - 674 Coin Change(完全背包)
- UVA 674 Coin Change(完全背包)
- UVA - 674 Coin Change(完全背包)
- UVA 674 - Coin Change(完全背包)
- uva674 Coin Change ——完全背包
- Uva-674 Coin Change (完全背包 入门题)
- UVA 674 - Coin Change 完全背包求状态数
- uva 674 Coin Change(完全背包)
- uva674 - Coin Change(完全背包)
- 算法->完全背包问题 UVa 674 Coin Change
- UVaOJ-674 Coin Change (完全背包)
- uva 674 && hdu 2069 coin change(水完全背包)
- POJ-1787 Charlie's Change (完全背包+输出方案 入门题)
- UVA 674 Coin Change 换硬币 经典dp入门题
- UVA - 674 - Coin Change(动态规划)
- uva 674 Coin Change
- 背包问题——“完全背包”最优方案总数分析及实现
- UVA674 完全背包DP