#include <iostream>
#include<cmath>
using namespace std;
long long n;
struct pale
{
    long long x,k;
};
pale res[100000];
long long sum(long long x,long long k)
{
    return (k+1)*x*x+k*(k+1)*x+k*(k+1)*(2*k+1)/6;
}
long long gcd(long long a,long long b)
{
    if(b==0)
    return a;
    else return gcd(b,a%b);
}
int main()
{
    while(cin>>n)
    {
        if(n==0)
           break;
        long long root3;
        root3=(long long)exp(log((double )n*24)/3)/2;
        long long x,k,num=0,i;
        for(k=root3;k>=0;k--)
        {
            long long a=4*n;
            long long b=k*(k+1)*(k+2)/3;
            long long d=gcd(a,b);
             x=(long long)((sqrt(a/d-b/d)*sqrt(k+1)*sqrt(d))-k*(k+1))/(2*k+2);
             if(root3==k)
             cout<<x<<endl;
             if(n==sum(x,k)&&x>0)
             {
                 res[num].x=x;res[num++].k=k;
              }
        }
        cout<<num<<endl;
        for(i=0;i<num;i++)
        {
            cout<<res[i].k+1<<" ";
            for(k=0;k<=res[i].k;k++)
            cout<<res[i].x+k<<" ";
            cout<<endl;
        }
    }
    return 0;
}

• long long 越界,,,,,换个公式试试 (17) yy17yy 2011-04-03 08:48:49