UVA 674 coin change
2014-03-27 19:15
281 查看
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<iostream>
using namespace std;
#define maxn 6050
#define INF 99999999
#define LL long long
#define mod 100000000000000000
LL dp[7500];
int a[6] = {0,1,5,10,25,50};
int n;
int main(){
memset(dp,0,sizeof(dp));
dp[0] = 1;
for (int i = 1; i <= 5; i++)
for (int j = a[i]; j <= 7489; j++)
dp[j] += dp[j-a[i]];
while(scanf("%d",&n)!=EOF){
printf("%lld\n",dp
);
}
return 0;
}
#include<algorithm>
#include<cstring>
#include<cmath>
#include<iostream>
using namespace std;
#define maxn 6050
#define INF 99999999
#define LL long long
#define mod 100000000000000000
LL dp[7500];
int a[6] = {0,1,5,10,25,50};
int n;
int main(){
memset(dp,0,sizeof(dp));
dp[0] = 1;
for (int i = 1; i <= 5; i++)
for (int j = a[i]; j <= 7489; j++)
dp[j] += dp[j-a[i]];
while(scanf("%d",&n)!=EOF){
printf("%lld\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
- UVA 674 Coin Change
- UVA 674 Coin Change
- Coin Change - UVa 674 换硬币的dp
- uva 674 Coin Change(类似完全背包)
- UVA674- Coin Change
- uva 674 - 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