pku 2100

 给定一个数1=<n<=1e14,求有多少个 sigma(m*m+(m+1)*(m+1)+...+(m+k)*(m+k)) == n  (m,k需要要我们去求！）并将答案打印出来。

    因为  sigma(m*m+(m+1)*(m+1)+...+(m+k)*(m+k)) = （k+1)*m*m+(k*k+k)*m+(k*(3*k+2*k*k+1)/6;                                                                 k<=（24*n)^(1/3)/2+1;枚举k，解方程即可

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <list>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

#define PF(x) (scanf("%d",&x))
#define PT(x,y) (scanf("%d%d",&x,&y))
#define PR(x) (printf("%d\n",x))
#define PRT(x,y)(printf("%d %d\n",x,y))
#define PB(x)(scanf("%I64d",&x))
#define PRB(x)(printf("%I64d\n",(x)))
#define For(i,n) for(LL i=0;i<(n);i++)
#define CLR(ar) (memset(ar,0,sizeof(ar)))
#define CLR1(ar) (memset(ar,-1,sizeof(ar)))
#define Max(x,y) (x)>(y)?(x):(y)
#define Min(x,y) (x)>(y)?(y):(x)
#define L(x) (x<<1)
#define R(x) ((x<<1)|1)
#define Mid(x,y) ((x+y)>>1)

typedef __int64 LL;
#define N 100000005
#define M 105
#define Mod 1000
#define Inf 0x7fffffff
vector<LL> G[10000];

bool mod(double s,int m)
{
	LL k = s/m;
	if(fabs(s-k*m)<1e-2) return true;
	return false;
}
bool equals(double s,LL ss)
{
	if(fabs(s-ss)<1e-2) return true;
	return false;
}
void init()
{
	//freopen("out.txt","w",stdout);
	//freopen("fds.txt","r",stdin);
	LL n;
	while(scanf("%I64d",&n)!=EOF)
    {
		LL len = (LL) (pow(n*24.0,1.0/3)+1)/2+2;
		LL count = 0;
	    for(LL i=len;i>=0;i--)
		{
			double k = (double)(i*3+2*i*i+1)*i;
		   if(i==8370) 
			   n=n;
			if(mod(k,6))
			{
				 k = k/6; if(k>n) continue;

				double a = i+1,b = i*i+i,c=n-k;
				double data = b*b+4*a*c;
				double ans1 = (-b+sqrt(data))/2.0/a;

				LL ans = (LL)ans1;ans1=ans;
				if(ans1<0) continue;
				if(equals(ans1*ans1*a+b*ans1,c))
				{
					if(!G[count].empty())G[count].clear();
					if(equals(ans1,0)) ans=1,G[count].push_back(i),i--;
					else G[count].push_back(i+1);
					G[count].push_back(ans);G[count].push_back(ans+i);
					count++;
				}
			}
		}
		PRB(count);
		
		for(int i=0;i<count;i++)
		{
			printf("%I64d",G[i][0]);
			for(LL j=G[i][1];j<=G[i][2];j++)
				printf(" %I64d",j);
			puts("");
		}
	}
	return ;
}

int main()
{
	init();
	return 0;
}