Time Limit: 10000MS | Memory Limit: 64000K | |
Total Submissions: 5957 | Accepted: 1413 | |
Case Time Limit: 2000MS |
Description
After a consultation with his astrologer, King George decided that the lengths of section sides must be a sequence of successive positive integer numbers. A section with side length s contains s2 graves. George has estimated the total number of graves that will be located on the graveyard and now wants to know all possible graveyard designs satisfying the condition. You were asked to find them.
Input
Output
Sample Input
2030
Sample Output
2 4 21 22 23 24
3 25 26 27
solution:
此題用尺取甚好~
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 200;
struct node{
int num, l, r;
}a[maxn];
int main()
{
ll n;
while (~scanf("%lld", &n))
{
int cnt = 0;
ll r = 1, sum = 0;
for (ll i = 1;i*i<=n; i++)
{
while (sum < n&&r*r <= n)
{
sum += r*r;
r++;
}
if (sum == n)
{
a[cnt].num = r - i; a[cnt].l = i; a[cnt].r = r - 1;
cnt++;
}
sum -= i*i;
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++)
{
printf("%d ", a[i].num);
for (int j = a[i].l; j <= a[i].r; j++)
printf("%d%c", j, j == a[i].r ? '\n' : ' ');
}
}
return 0;
}