poj2100 Graveyard Design

还是序列连续的区间和，注意整数的范围即可

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int maxn = 1e7 + 5;

int cnt;
pa p[1000005];

int main() {
    ll n;
    cin >> n;
    ll l = 1, r = 1;
    ll sum = 1;
    while (r < maxn) {
        if (sum >= n) {
            if (sum == n) p[cnt++] = make_pair(l, r);
            sum -= l * l;
            l++;
            if (l > r) { r = l; sum = l * l; }
        } else {
            r++;
            sum += r * r;
        }
    }
    cout << cnt << endl;
    for (int i = 0; i < cnt; i++) {
        cout << p[i].se - p[i].fi + 1;
        for (int j = p[i].fi; j <= p[i].se; j++) {
            cout << " " << j;
        }
        cout << endl;
    }
    return 0;
}