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=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 inline void write(LL a)
 {
     if (a<){printf("-");a=-a;}
     if (a>=)write(a/);
     putchar(a%+'');
 }
 inline void writeln(LL a){write(a);printf("\n");}
 int n,m,tot,ans;
 int p[];
 int mrk[];
 int main()
 {
     scanf("%d",&n);
     for (int i=;i<=;i++)p[i]=i*i*i,mrk[p[i]]=i;
     for (int i=;i<=;i++)
     {
         if (tot+p[i]>n)break;
         tot+=p[i];
         for (int j=i;j<=;j++)
         {
             if(tot+p[j]>n)break;
             tot+=p[j];
             for (int k=j;k<=;k++)
             {
                 if (tot+p[k]>n)break;
                 tot+=p[k];
                 for (int l=k;l<=;l++)
                 {
                     if (tot+p[l]>n)break;
                     tot+=p[l];
                     for (int m=l;m<=;m++)
                         if (tot+p[m]==n)ans++;
                     tot-=p[l];
                 }
                 tot-=p[k];
             }
             tot-=p[j];
         }
         tot-=p[i];
     }
     printf("%d\n",ans);
 }

Spoj BOKAM143SOU