POJ - 2100 Graveyard Design(尺取法)

题目大意：给出一个数，问这个数有多少种组合方式
组合的规则为，该数为一系列连续的数的平方和

解题思路：尺取法的基本题了

#include <cstdio>
#include <vector>
using namespace std;

#define ll long long
const int N = 10000010;

struct Node {
    int x, y;
    Node() {}
    Node(int x, int y): x(x), y(y) {}
};

ll n;
vector<Node> v;

void solve() {
    ll l = 1, r = 1, Sum = 0, t;
    v.clear();
    while ((r - 1) * (r - 1) <= n) {
        while (Sum < n) {
            Sum += r * r;
            t = r * r;
            r++;
        }
        if (Sum == n) v.push_back(Node(l,r-1));
        if (l < r) {
            Sum -= l * l;
            l++;
        }
    }

    printf("%d\n", v.size());
    for (int i = 0; i < v.size(); i++) {
        printf("%d", v[i].y - v[i].x + 1);
        for (int j = v[i].x; j <= v[i].y; j++)
            printf(" %d", j);
        printf("\n");
    }
}

int main() {
    while (scanf("%lld", &n) != EOF) {
        if (n == 0) break;
        solve();
    }
    return 0;
}