poj 2202 Squares(求正方形个数)
来源:互联网 发布:java后台接收上传图片 编辑:程序博客网 时间:2024/05/01 15:27
Squares
Time Limit: 3500MS Memory Limit: 65536K
Total Submissions: 18162 Accepted: 6969
Description
A square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same polygon. It is not the only polygon with the latter property, however, as a regular octagon also has this property.
So we all know what a square looks like, but can we find all possible squares that can be formed from a set of stars in a night sky? To make the problem easier, we will assume that the night sky is a 2-dimensional plane, and each star is specified by its x and y coordinates.
Input
The input consists of a number of test cases. Each test case starts with the integer n (1 <= n <= 1000) indicating the number of points to follow. Each of the next n lines specify the x and y coordinates (two integers) of each point. You may assume that the points are distinct and the magnitudes of the coordinates are less than 20000. The input is terminated when n = 0.
Output
For each test case, print on a line the number of squares one can form from the given stars.
Sample Input
4
1 0
0 1
1 1
0 0
9
0 0
1 0
2 0
0 2
1 2
2 2
0 1
1 1
2 1
4
-2 5
3 7
0 0
5 2
0
Sample Output
1
6
Time Limit: 3500MS Memory Limit: 65536K
Total Submissions: 18162 Accepted: 6969
Description
A square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same polygon. It is not the only polygon with the latter property, however, as a regular octagon also has this property.
So we all know what a square looks like, but can we find all possible squares that can be formed from a set of stars in a night sky? To make the problem easier, we will assume that the night sky is a 2-dimensional plane, and each star is specified by its x and y coordinates.
Input
The input consists of a number of test cases. Each test case starts with the integer n (1 <= n <= 1000) indicating the number of points to follow. Each of the next n lines specify the x and y coordinates (two integers) of each point. You may assume that the points are distinct and the magnitudes of the coordinates are less than 20000. The input is terminated when n = 0.
Output
For each test case, print on a line the number of squares one can form from the given stars.
Sample Input
4
1 0
0 1
1 1
0 0
9
0 0
1 0
2 0
0 2
1 2
2 2
0 1
1 1
2 1
4
-2 5
3 7
0 0
5 2
0
Sample Output
1
6
1
#include <cstdio>#include <cstring>#include<algorithm>#include <cmath>#include <vector>using namespace std;#define N 1000int n;struct node {int x;int y;}point[N];bool cmp(node a, node b){return (a.x < b.x || (a.x == b.x && a.y < b.y));}int bsearch(int x, int y){intmid, l = 0, r = n - 1;while (l <= r) {mid = (l + r) / 2;if (point[mid].x == x && point[mid].y == y) return 1;if (point[mid].x > x || (point[mid].x == x && point[mid].y > y)) {r = mid - 1;}else {l = mid + 1;}}return 0;}int main(){int x, y, i, j, count;while (scanf("%d", &n)&&n){count = 0;for (i = 0; i < n; i++)scanf("%d %d", &point[i].x, &point[i].y);sort(point, point + n, cmp);for (i = 0; i < n; i++) {for (j = (i + 1); j < n; j++) {x = point[i].y - point[j].y + point[i].x;y = point[j].x - point[i].x + point[i].y;if (bsearch(x, y) == 0) {continue;}x = point[i].y - point[j].y + point[j].x;y = point[j].x - point[i].x + point[j].y;if (bsearch(x, y)) {count++;}}}printf("%d\n", count / 2);}return 0;}
0 0
- poj 2202 Squares(求正方形个数)
- POJ 2002 Squares hash求正方形个数
- POJ 2002 Squares 求正方形的个数,点哈希
- Poj 2002 Squares (正方形个数 Hash)
- POJ 2002-Squares(hash拉链法-正方形个数)
- poj Squares 2002 (STL&&枚举+转换) 统计正方形的个数
- poj2002--Squares(n个点求正方形个数)
- POJ2002---Squares(找正方形的个数)
- poj 2002 Squares (哈希+正方形已知相邻两点求另外两点的坐标)
- HDU 4739 求正方形个数
- POJ 2002 Squares(计算几何 找正方形 hash枚举)
- POJ 2002 Squares(已知平面n点枚举正方形)
- uva201正方形squares
- 正方形(squares,UVa201)
- 正方形个数
- POJ2002Squares【求点集中正方形的个数 计算几何+Hash】
- 求包含点集的最小正方形个数。
- poj 2002 正方形个数 (对点的hash 存储)
- SVN提交版本时强制填写备注
- 数据结构课程设计之航空订票系统
- VelocityLayoutViewResolver和VelocityViewResolver的区别
- securityImage
- Day01 - Xcode常用快捷键、高级语言源码的编译到运行、三码运算、基础类型所占字节与取值范围
- poj 2202 Squares(求正方形个数)
- 欢迎使用CSDN-markdown编辑器
- JAVA基础(14) JSTL的C标签使用详解
- [CSS3] Transform Function
- vtk 求点到线的距离
- Linux安装mysql.xxx.rpm
- Quartz 时间配置的说明 及实例
- QT生成的exe自动拷贝依赖的dll并打包的方法
- 粒子效果