[Ultraviolet A] 11137-ingenuous cubrency

For the DP problem, a table is required.

DP [I] [J] indicates a method that uses a number not greater than I to Form J.

The state equation is DP [I] [J] = d [I-1] [J] + sum {DP [I-1] [J-K * I] };

14327705

11137

Ingenuous cubrency

Accepted

C ++

0.049

10:20:48

#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;typedef long long LL;typedef unsigned long long ULL;const int maxn = 11111;const int maxd = 10000;LL dp[40][maxn];void List(){    memset(dp,0,sizeof(dp));    for(int i = 1 ; i <= maxd ; i++) dp[1][i] = 1;    for(int i = 2 ; i * i * i <= maxd ; i ++){        for(int j = 1; j <= maxd ; j ++){            dp[i][j] += dp[i - 1][j];            for(int k = 1; ; k ++){                if(j - k * i * i * i > 0)                    dp[i][j] += dp[i - 1][j - k * i * i * i];                else if(j - k * i * i * i == 0)                    dp[i][j] ++;                else                    break;            }        }    }}int main(){    List();    int n,k;    for(k = 1; k * k * k <= maxd ; k ++);    while(scanf("%d",&n) != EOF){        printf("%lld\n",dp[k - 1][n]);    }    return 0;}

[Ultraviolet A] 11137-ingenuous cubrency