UVA - 674 Coin Change

题意：用给你的五种硬币凑出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[n]);    }    return 0;}