UVA 357 Let Me Count The Ways 完全背包

又是重复问题，LRJ估计要突出这里基础的重要性，提交时忘了把freopen去掉。汗，反正乱刷UVA，WA就WA了

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
LL dp[30080];
int coin[]={1,5,10,25,50};
int main()
{
    freopen("sample.txt","r",stdin);
    int n;
    dp[0]=1;
    for (int i=0;i<5;i++)
        for (int j=0;j<30004;j++)
    {
        dp[j+coin[i]]+=dp[j];
    }
    while (scanf("%d",&n)!=EOF)
    {
        if (dp[n]==1)printf("There is only %lld way to produce %d cents change.\n",dp[n],n);
        else printf("There are %lld ways to produce %d cents change.\n",dp[n],n);
    }
    return 0;
}