Uva 11137 Ingenuous Cubrency（整数划分方案 背包）

Uva 11137 Ingenuous Cubrency（整数划分方案 背包）

#define LL long long
#define M 10000
#define DEBUG puts("It's here!")
#define INF 1<<29
#define CLS(x,v) memset(x,v,sizeof(x))
#define FU(i,a,n)  for(int i=a;i<(n);++i)
#define FD(i,a,n)  for(int i=n;i>a;++i)
#define Three(x)  ((x)*(x)*(x))
#define filer freopen("C:\\Users\\sq\\Desktop\\1.in","r",stdin)
#define filew freopen("C:\\Users\\sq\\Desktop\\2.out","w",stdout)


int a[22];
LL dp[M]={0};
int n,k;
void  solve()
{
    for(int i=0;i<=21;i++)
      a[i]=Three(i);
    dp[0]=1;
    for(int i=1;i<=21;i++)
        for(int j=a[i];j<M;j++)
            dp[j]+=dp[j-a[i]];
}
int main()
{
    int n; solve();
    while(~scanf("%d",&n))
    {
       printf("%lld\n",dp[n]);
    }
    return 0;
}