UVa 357 - Let Me Count The Ways

　　题目大意：也是硬币兑换问题，与147、674用同样的方法即可解决。

 #include <cstdio>
 #include <cstring>
 #define MAXN 30001

 const int coin[] = {, , , , };
 long long dp[MAXN];

 int main()
 {
 #ifdef LOCALi
     freopen("in", "r", stdin);
 #endif
     memset(dp, , sizeof(dp));
     dp[] = ;
     for (int k = ; k < ; k++)
         for (int i = ; i < MAXN; i++)
             if (i >= coin[k])
                 dp[i] += dp[i-coin[k]];
     int n;
     while (scanf("%d", &n) != EOF)
     {
         if (dp[n] == )  printf("There is only 1 way to produce %d cents change.\n", n);
         else  printf("There are %lld ways to produce %d cents change.\n", dp[n], n);
     }
     return ;
 }