UVA - 357 Let Me Count The Ways

找零问题，不解释

#include<cstdio>#include<cstring>#include<algorithm>#define MAX 35000using namespace std;long long dp[MAX],coin[5]={1,5,10,25,50};int main(){    int n,i,j;    memset(dp,0,MAX);    dp[0]=1;    for(i=0;i<5;i++)    {        for(j=coin[i];j<MAX;j++)            dp[j]+=dp[j-coin[i]];    }    while(scanf("%d",&n)!=EOF)    {        if(n<5)            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 0;}