Greedy:Graveyard Design(POJ 2100)

 1 #include <iostream>
 2 #include <functional>
 3 #include <algorithm>
 4 #define MAX_N 10000001
 5 
 6 using namespace std;
 7 typedef long long LL_INT; 
 8 
 9 static int store[MAX_N][2];//只储存开始和结尾
10 
11 void Inivilize(void);
12 
13 int main(void)
14 {
15     LL_INT n, sum, tmp;
16     int    s, t, num;
17 
18     while (~scanf("%lld", &n))
19     {
20         sum = num = 0; s = t = 1;
21         while (1)
22         {
23             while ((tmp = (LL_INT)t*(LL_INT)t) <= n && sum < n)
24             {
25                 sum += tmp;
26                 t++;
27             }
28             if (sum == n)
29             {
30                 store[num][0] = s; store[num][1] = t;
31                 num++;
32             }
33             if (sum < n)
34                 break;
35             sum -= (LL_INT)s*(LL_INT)s; s++;
36         }
37         printf("%d\n", num);
38         for (int i = 0; i < num; i++)
39         {
40             printf("%d ", store[i][1] - store[i][0]);
41             for (int j = store[i][0]; j < store[i][1]; j++)
42                 printf("%d ", j);
43             printf("\n");
44         }
45     }
46     return EXIT_SUCCESS;
47 }