noiopenjudge6049:买书
代~码~通~俗~易~懂~
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;
#define MAXN (1100)
const int k[] = {0,10,20,50,100};
int dp[MAXN];
int main()
{
int n;
cin >> n;
dp[0] = 1;
for(int i = 1; i <= 4; ++ i)
for(int j = n; j >= k[i]; -- j)
for(int l = 1; l <= j/k[i]; ++ l)
dp[j] += dp[j-l*k[i]];
if(!n) dp[n] = 0;
cout << dp[n] << endl;
return 0;
}