nyoj 2100 Graveyard Design
2016-04-19 09:45
344 查看
该题题意是国王要建一个墓地,给出一个面积,看看哪几个连续数字做正方形的边,面积加在一起刚好和给出的数字相等。
也就是给出一个数字,找出n段连续的数字,使这n段数字的平方和等于给出的数字。
用尺取法很容易就能做出来。
#include <iostream>
#include <vector>
using namespace std;
struct result {
long long count;
long long left;
long long right;
};
int main()
{
long long n;
while (cin >> n)
{
long long l = 1;
long long r = 1;
long long sum = 0;
long long sq = 0;
long long rcount;
result a;
vector<result> point;
while (true)
{
while (sum < n)
{
sq = r*r;
sum += sq;
r++;
}
if (sq > n)
break;
if (sum == n)
{
a.count = r - l;
a.left = l;
a.right = r;
point.push_back(a);
}
sum -= l*l;
l++;
}
cout << point.size() << endl;
for (rcount = 0; rcount != point.size(); rcount++)
{
cout << point[rcount].count << " ";
for (long long i = point[rcount].left; i != point[rcount].right; i++)
{
cout << i << " ";
}
cout << endl;
}
}
}
也就是给出一个数字,找出n段连续的数字,使这n段数字的平方和等于给出的数字。
用尺取法很容易就能做出来。
#include <iostream>
#include <vector>
using namespace std;
struct result {
long long count;
long long left;
long long right;
};
int main()
{
long long n;
while (cin >> n)
{
long long l = 1;
long long r = 1;
long long sum = 0;
long long sq = 0;
long long rcount;
result a;
vector<result> point;
while (true)
{
while (sum < n)
{
sq = r*r;
sum += sq;
r++;
}
if (sq > n)
break;
if (sum == n)
{
a.count = r - l;
a.left = l;
a.right = r;
point.push_back(a);
}
sum -= l*l;
l++;
}
cout << point.size() << endl;
for (rcount = 0; rcount != point.size(); rcount++)
{
cout << point[rcount].count << " ";
for (long long i = point[rcount].left; i != point[rcount].right; i++)
{
cout << i << " ";
}
cout << endl;
}
}
}
相关文章推荐
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1001
- POJ ACM 1002
- 1611:The Suspects
- POJ1089 区间合并
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- POJ 2773 HAPPY 2006
- POJ 3090 Visible Lattice Points
- POJ-2409-Let it Bead&&NYOJ-280-LK的项链
- POJ-1695-Magazine Delivery-dp
- POJ1523 SPF dfs
- POJ-1001 求高精度幂-大数乘法系列
- POJ-1003 Hangover
- POJ-1004 Financial Management
- 用单调栈解决最大连续矩形面积问题
- 2632 Crashing Robots的解决方法
- 1573 Robot Motion (简单题)
- POJ 1200 Crazy Search(简单哈希)
- 【高手回避】poj3268,一道很水的dijkstra算法题