POJ2100 Graveyard Design【尺取法】
来源:互联网 发布:华为移动数据不能上网 编辑:程序博客网 时间:2024/04/30 07:36
Graveyard Design
Time Limit: 10000MS Memory Limit: 64000KTotal Submissions: 7094 Accepted: 1733Case Time Limit: 2000MS
Description
King George has recently decided that he would like to have a new design for the royal graveyard. The graveyard must consist of several sections, each of which must be a square of graves. All sections must have different number of graves.
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.
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
Input file contains n --- the number of graves to be located in the graveyard (1 <= n <= 1014 ).
Output
On the first line of the output file print k --- the number of possible graveyard designs. Next k lines must contain the descriptions of the graveyards. Each line must start with l --- the number of sections in the corresponding graveyard, followed by l integers --- the lengths of section sides (successive positive integer numbers). Output line's in descending order of l.
Sample Input
2030
Sample Output
24 21 22 23 243 25 26 27
Source
Northeastern Europe 2004, Northern Subregion
问题链接:POJ2100 Graveyard Design。
题意简述:对于输入的n,求一段连续的正整数,使得其平方和等于n。
问题分析:
采用尺取法解决。
step1.从1开始,先求出最前面的子序列,使之平方和大于或等于n;step2.重复step3和step4,直到整数的平方小于n为止;
step3.若子序列平方和等于n,则先把解放入向量变量中;去掉子序列的第1个元素,子序列的后面再加上后续整数的平方和;
step4.将向量中的解取出,输出结果。
AC的C++语言程序如下:
/* POJ2100 Graveyard Design */#include <iostream>#include <vector>#include <stdio.h>using namespace std;vector<pair<long long, long long> > ans;void solve(long long n){ ans.clear(); long long start = 1, end = 1, sum = 0; while (start * start <= n) { while (end * end <= n && sum < n) { sum += end * end; end++; } if (sum == n) ans.push_back(make_pair(start, end)); sum -= start * start; start++; } int len = ans.size(); printf("%d\n", len); for (int i = 0; i < len; i++) { printf("%lld", ans[i].second - ans[i].first); for (int j = ans[i].first; j < ans[i].second; j++) printf(" %d", j); printf("\n"); }}int main(){ long long n; while(scanf("%lld", &n) != EOF) solve(n); return 0;}
阅读全文
0 0
- POJ2100-Graveyard Design【尺取法】
- poj2100 Graveyard Design 尺取法
- POJ2100 Graveyard Design【尺取法】
- (尺取法)poj2100,Graveyard Design
- 尺取法入门2 poj2100 Graveyard Design
- POJ2100-Graveyard Design
- POJ2100-Graveyard Design
- NUC1840 Graveyard Design【尺取法】
- POJ2100 Graveyard Design 区间法
- poj2100 -- Graveyard Design(区尺法)
- POJ 2100 - Graveyard Design(尺取法)
- POJ - 2100 Graveyard Design(尺取法)
- POJ-2100Graveyard Design(尺取法)
- POJ 2100 Graveyard Design(尺取法)
- poj 2100 Graveyard Design(尺取法)
- POJ 2100 Graveyard Design 尺取法
- POJ - 2100 Graveyard Design(尺取法)
- POJ 2100 Graveyard Design(尺取法)
- jsp添加判空提示
- Hadoop 平台和应用程序框架(用于有道翻译)
- sql 2008 安装问题
- php的抽象类和接口
- Netty学习系列(一)-- 掀开你神秘的面纱
- POJ2100 Graveyard Design【尺取法】
- Java 类的继承
- GRE难句典型结构1
- 扩展和定制Heritrix之Extractor
- bootstrap 模态框怎么去设置点击保存后关闭模态框
- C语言面试题进阶篇
- 三种数组去重方法的遍历效率比较
- 线段树模板
- Linux下逻辑地址-线性地址-物理地址图解(转)