POJ2100-Graveyard Design
来源:互联网 发布:淘宝如何设置发货地 编辑:程序博客网 时间:2024/05/21 10:23
Graveyard Design
Time Limit: 10000MS Memory Limit: 64000KTotal Submissions: 7036 Accepted: 1717Case 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
题意:给你一个数,问有多少种一段连续的数的平方和等于这个数,并输出这些方案
解题思路:尺取法,当一段数的平方和等于这个数时,保存答案
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <cmath>#include <map>#include <bitset>#include <set>#include <vector>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;LL ans[1005][100005];int main(){ LL n; while(~scanf("%lld",&n)) { int cnt=0; LL head=0,rear=0,sum=0; while(rear*rear<n) { rear++; sum+=rear*rear; while(sum>n) { head++; sum-=head*head; } if(n==sum) { cnt++; int k=1; for(LL i=head+1;i<=rear;i++) ans[cnt][k++]=i; ans[cnt][0]=k-1; } } printf("%d\n",cnt); for(int i=1;i<=cnt;i++) { printf("%d",ans[i][0]); for(int j=1;j<=ans[i][0];j++) printf(" %d",ans[i][j]); printf("\n"); } } return 0;}
阅读全文
0 0
- POJ2100-Graveyard Design
- POJ2100-Graveyard Design
- POJ2100 Graveyard Design 区间法
- POJ2100-Graveyard Design【尺取法】
- poj2100 Graveyard Design 尺取法
- POJ2100 Graveyard Design【尺取法】
- poj2100 -- Graveyard Design(区尺法)
- (尺取法)poj2100,Graveyard Design
- 尺取法入门2 poj2100 Graveyard Design
- poj-2100 Graveyard Design
- POJ 2100 Graveyard Design
- nyoj 2100 Graveyard Design
- POJ 2100 Graveyard Design
- hdoj2100 Graveyard Design
- poj 2100 Graveyard Design
- POJ 2100 Graveyard Design
- POJ 2100 Graveyard Design
- poj2100
- git教程
- 集合划分问题
- jqgrid setCell 根据单元格 值的不同 设置不同的样式 属性
- squeezedet windows 安装(cpu)
- 安卓计算器程序
- POJ2100-Graveyard Design
- spring注入List不允许,解决办法
- 几种缓存比较
- com.google.gson.internal.LinkedTreeMap cannot be cast to xxx
- 前端规范(2)---Css和Sass编码规范
- Java面向对象,内部类概述
- 【Java实战】DecimalFormat对数值格式化的舍入问题——RoundingMode
- softAP配网:用Android手机为linux无屏设备输入wifi密码
- 标准I/O文件编程(一)