UVa 674 - Coin Change
2013-03-25 21:53
239 查看
第一个动归程序,完全背包,本来是用记忆化搜索做的(貌似需要开二维数组来标记,一维数组标记不完,总有重复的数据),没做出来,用递推写了一下,过了~
代码如下:
代码如下:
#include<iostream> #include<cstdio> using namespace std; int dp[8000]; int coin[5] = {1, 5, 10, 25, 50}; int main() { dp[0] = 1; for(int i=0; i<5; i++) { for( int j= 0; j<7490; j++) dp[ j + coin[i] ] += dp[ j ]; } int num; while(scanf("%d", &num) != EOF) { printf("%d\n", dp[num]); } return 0; }
相关文章推荐
- UVA 674 Coin Change
- Coin Change - UVa 674 换硬币的dp
- UVa 674: Coin Change
- uva 674 Coin Change(类似完全背包)
- UVA674- Coin Change
- uva 674 Coin Change
- UVA674——DP(找钱1)—— Coin Change
- UVa 674 Coin Change(经典DP)
- UVA 674 Coin Change【补充分析】
- UVA 674 - Coin Change
- uva 674 - Coin Change(dp)
- [背包九讲笔记] UVa 674 Coin Change
- UVa 674 & hdu 2069 Coin Change (母函数,dp)
- UVA-674-Coin Change
- UVA - 674 - Coin Change (背包型DP)
- Uva 674 Coin Change
- UVa674 Coin Change
- uva 674 Coin Change
- UVa 674 - Coin Change
- UVA674-Coin Change,用动归思想来递推!