UVaOJ 674 Coin Change

来源：互联网发布：ubuntu16.04优化编辑：程序博客网时间：2024/06/14 16:34

题目大意：给出5种面值的硬币1,5,10,25,50，问相加之和为n的组合个数。

最开始是想到DAG模型，于是酱紫循环了

for (int i = 1; i < mx; i++){for (int j = 0; j < 5; j++){if (i >= a[j])dp[i] += dp[i - a[j]];}}

写完发现样例都过不了，才发现循环的姿势出问题了。

#define _CRT_SECURE_NO_DEPRECATE#include<iostream>#include<cstdio>#include<algorithm>#include<string>#include<cstring>#include<queue>#include<vector>#include<cmath>#include<ctime>#define mx 7490#define LL long long #define mod 1000000009#define esp 1e-12#define y1 y1234#define inf 0x3f3f3f3f#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const double PI = acos(-1.0);using namespace std;int a[] = { 1, 5, 10, 25, 50 };int dp[mx];int n;int main(){dp[0] = 1;for (int i = 0; i < 5; i++){for (int j = 1; j < mx; j++) {if (j >= a[i]) {dp[j] += dp[j - a[i]];}}}while (scanf("%d",&n)!=EOF){printf("%d\n", dp[n]);}return 0;}

0 0