- #include<cstdio>
- #include<algorithm>
- #include<cstring>
- #include<cmath>
- #include<iostream>
- using namespace std;
- #define maxn 6050
- #define INF 99999999
- #define LL long long
- #define mod 100000000000000000
- LL dp[7500];
- int a[6] = {0,1,5,10,25,50};
- int n;
- int main(){
- memset(dp,0,sizeof(dp));
- dp[0] = 1;
- for (int i = 1; i <= 5; i++)
- for (int j = a[i]; j <= 7489; j++)
- dp[j] += dp[j-a[i]];
- while(scanf("%d",&n)!=EOF){
- printf("%lld\n",dp[n]);
- }
- return 0;
- }
UVA 674 coin change
最新推荐文章于 2019-11-08 16:27:07 发布