poj 2100

 #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

#define MAX_SQAURE_COUNT 66943

struct Result {
Result (int b, int l)
: begin(b), length(l){}
int begin;
int length;
};

class ResultCmper {
public:
bool operator () (const Result & r1, const Result & r2)
{
return r1.length > r2.length;
}
};

vector<Result> results;
long long squareBuffer[MAX_SQAURE_COUNT + 1];

void initSquareBuffer()
{
squareBuffer[0] = 0;
for (long long i = 1; i <= MAX_SQAURE_COUNT; ++ i)
{
squareBuffer[i] = i * i + squareBuffer[i - 1];
}
}

int main()
{
initSquareBuffer();
long long graveCount;
while (cin >> graveCount)
{
results.clear();
for (long long i = 1; i <= MAX_SQAURE_COUNT; ++ i)
{
if (squareBuffer[i - 1] >= graveCount) {
continue;
}
long long p1 = i, p2 = i * (i - 1);
long long tmp = graveCount - squareBuffer[i - 1];
int begin = 1;
int end = sqrt((double)tmp);
while (begin != end)
{
long long mid = (begin + end) / 2;
if (p1 * mid * mid + p2 * mid < tmp) {
begin = mid + 1;
} else {
end = mid;
}
}
if (p1 * begin * begin + p2 * begin == tmp) {
results.push_back(Result(begin, i));
}
}

sort(results.begin(), results.end(), ResultCmper());
cout << results.size() << endl;
for (int i = 0; i < results.size(); ++ i)
{
cout << results[i].length;
for (int j = results[i].begin, limit = results[i].begin + results[i].length - 1; j <= limit; ++ j)
{
printf(" %d", j);
}
cout << endl;
}
}
return 0;
}