Spoj-BOKAM143SOU Checking cubes.

Given a integer N. Find number of possible ways to represent N as a sum of at most five cubes.

Input

First line contains N.

1<=N<=125000.

Output

Output the result

Example

Input:
64

Output:
2

这种题目。。直接暴力吧

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<ctime>
#define LL long long
#define inf 0x7ffffff
#define pa pair<int,int>
#define pi 3.1415926535897932384626433832795028841971
using namespace std;
inline LL read()
{
    LL x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
inline void write(LL a)
{
    if (a<0){printf("-");a=-a;}
    if (a>=10)write(a/10);
    putchar(a%10+'0');
}
inline void writeln(LL a){write(a);printf("
");}
int n,m,tot,ans;
int p[51];
int mrk[125001];
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=50;i++)p[i]=i*i*i,mrk[p[i]]=i;
    for (int i=0;i<=50;i++)
    {
        if (tot+p[i]>n)break;
        tot+=p[i];
        for (int j=i;j<=50;j++)
        {
            if(tot+p[j]>n)break;
            tot+=p[j];
            for (int k=j;k<=50;k++)
            {
                if (tot+p[k]>n)break;
                tot+=p[k];
                for (int l=k;l<=50;l++)
                {
                    if (tot+p[l]>n)break;
                    tot+=p[l];
                    for (int m=l;m<=50;m++)
                        if (tot+p[m]==n)ans++;
                    tot-=p[l];
                }
                tot-=p[k];
            }
            tot-=p[j];
        }
        tot-=p[i];
    }
    printf("%d
",ans);
}