UVa 11137 (完全背包方案数) Ingenuous Cubrency

 1 //#define LOCAL
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <cstring>
 5 using namespace std;
 6 
 7 const int maxn = 10;
 8 long long dp[maxn + 10];
 9 
10 int main(void)
11 {
12     #ifdef LOCAL
13         freopen("11137in.txt", "r", stdin);
14     #endif
15 
16     dp[0] = 1;
17     for(int i = 1; i <= 21; ++i)
18     {
19         int v = i * i * i;
20         for(int j = v; j <= maxn; ++j)
21             dp[j] += dp[j - v];
22     }
23     int n;
24     while(scanf("%d", &n) == 1)
25         printf("%lld\n", dp[n]);
26     return 0;
27 }