代码
#include <bits/stdc++.h>
#define int long long
#define F(i, a, b) for (int i = (a); i <= (b); i++)
#define dF(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 500005, M = (N << 1), inf = 1e16, mod = 1e9 + 7;
int n, m, k, x, y, z, ans, t;
int w[N], f[N];
int v[4] = {10, 20, 40, 100};
void solve()
{
cin >> n;
f[0] = 1;
for (int i = 0; i < 4; i ++ )
{
for (int j = v[i]; j <= n; j ++ )
{
f[j] += f[j - v[i]];
}
}
cout << f[n] << "\n";
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin >> T;
while (T -- )
{
solve();
}
}
