UVA - 11137 Ingenuous Cubrency

Bryce1010模板

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2078

/*
(i,j)表示不超过i的整数的立方的和为j
d(i,j)表示(0,0)到(i,j)的路径有多少
22^3>10000
*/
#include <bits/stdc++.h>

using namespace std;
#define ll long long

const int MAXI=23;
const int MAXN=10000+5;

ll d[MAXI+10][MAXN+10];
void solve()
{
    memset(d,0,sizeof(d));
    d[0][0]=1;
    for(int i=1;i<MAXI;i++)
    {
        for(int j=0;j<MAXN;j++)
        {
            for(int a=0;j+a*i*i*i<MAXN;a++)
            {
                d[i][j+a*i*i*i]+=d[i-1][j];
            }
        }
    }
}
int main()
{
    ll n;
//#ifndef online_judge
//    freopen("test.txt","r",stdin);
//#endif 
    solve();
    while(cin>>n)
    {
        //ll cnt=0;
        cout<<d[22][n]<<endl;
    }
    return 0;
}