UVa-674-Coin Change
2014-09-27 12:28
453 查看
AOAPC
I: Beginning Algorithm Contests (Rujia Liu) :: Volume
5. Dynamic Programming
I: Beginning Algorithm Contests (Rujia Liu) :: Volume
5. Dynamic Programming
// 674 - Coin Change #include <iostream> #include <cstring> #define MAXN 7500 using namespace std; int coin[5] = {1, 5, 10, 25, 50}; int a[MAXN][5]; int m; int dp(int m, int n) { if(a[m] != -1) return a[m] ; a[m] = 0; for(int i = n; i < 5; i++) if(m >= coin[i]) a[m] += dp(m-coin[i], i); return a[m] ; } int main(void) { memset(a, -1, sizeof(a)); for(int i = 0; i < 5; i++) a[0][i] = 1; while(cin >> m) cout << dp(m, 0) << endl; return 0; }
相关文章推荐
- UVa 674 - Coin Change
- UVA 674 Coin Change
- uva 674 Coin Change
- UVA 674 Coin Change ,Commence
- 算法->完全背包问题 UVa 674 Coin Change
- UVA 674 - Coin Change
- UVA 674 Coin Change
- UVA - 674 Coin Change 经典问题
- UVA 674 coin change
- uva 674 - Coin Change
- uva 674 Coin Change
- uva 674 && hdu 2069 coin change(动态规划、母函数)
- UVa 674 - Coin Change
- UVa 674 Coin Change(经典DP)
- UVA 674 Coin Change【补充分析】
- UVa 674: Coin Change
- UVA - 674 Coin Change
- UVA.674 Coin Change (DP 完全背包)
- [背包九讲笔记] UVa 674 Coin Change
- uva 674 Coin Change