UVA - 674 Coin Change
2013-09-06 19:07
363 查看
题意:用给你的五种硬币凑出n,求有几种方法,跟DAG本质上是一样的,同样是先建图,那这题的简单之处是已经给好我们硬币价值, dp[i] 表示凑出i有几种方法
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int MAXN = 8000; int dp[MAXN],n; int coin[5] = {50,25,10,5,1}; int main(){ memset(dp,0,sizeof(dp)); dp[0] = 1; for (int i = 0; i < 5; i++) for (int j = 1; j < MAXN; j++) if (j >= coin[i]) dp[j] += dp[j - coin[i]]; while (scanf("%d",&n) != EOF){ printf("%d\n",dp ); } return 0; }
相关文章推荐
- UVA 674 Coin Change
- Coin Change - UVa 674 换硬币的dp
- uva 674 Coin Change(类似完全背包)
- UVA674- Coin Change
- uva 674 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
- [背包九讲笔记] UVa 674 Coin Change
- UVa 674 & hdu 2069 Coin Change (母函数,dp)
- uva 674 - Coin Change(dp)
- UVA - 674 - Coin Change (背包型DP)
- UVA-674-Coin Change
- Uva 674 Coin Change
- UVa674 Coin Change
- uva 674 Coin Change
- UVa 674 - Coin Change