uva 357

最新推荐文章于 2021-08-04 15:15:41 发布

superpig101

最新推荐文章于 2021-08-04 15:15:41 发布

阅读量742

点赞数

分类专栏： dp 文章标签：动态规划

本文链接：https://blog.youkuaiyun.com/pigsuper/article/details/10160649

版权

dp 专栏收录该内容

15 篇文章

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstring>
const int maxn = 30010;
using namespace std;
int cent[6]={0,1,5,10,25,50};
long long dp[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n)){
         for(int i=0; i<=n; ++i)
             dp[i] = 1;
         for(int i=2; i<6; ++i)
          for(int j=cent[i]; j<=n; ++j){
             dp[j] = dp[j-cent[i]] + dp[j];
          }
        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;
}