POJ 2002 Squares
来源:互联网 发布:上瘾网络剧欢快bgm 编辑:程序博客网 时间:2024/05/18 13:30
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.
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
41 00 11 10 090 01 02 00 21 22 20 11 12 14-2 53 70 05 20
Sample Output
161
Source
Rocky Mountain 2004
/*
题目大意是在二维平面坐标中给定N个点,然后通过查找的方式找出其中有多少个正方形。
解决方法用的是STL中的set函数,用pair将坐标作为一个数据类型存放在set中,然后每次枚举两个点,判断正方形的其他两个点是否存在。
*/
/*
题目大意是在二维平面坐标中给定N个点,然后通过查找的方式找出其中有多少个正方形。
解决方法用的是STL中的set函数,用pair将坐标作为一个数据类型存放在set中,然后每次枚举两个点,判断正方形的其他两个点是否存在。
*/
#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <stack>#include <cmath>#include <cstdio>#include <vector>#include <queue>#include <set>using namespace std;struct node{ int x,y;}a[1010];int f(int x1,int y1){ return (x1+y1)/2;}int main(){ int n; while(~scanf("%d",&n) && n) { set<pair<int,int> >s; for(int i=0;i<n;i++) { scanf("%d %d",&a[i].x,&a[i].y); a[i].x*=2;a[i].y*=2; //将每个点*2处理,防止之后的浮点数 s.insert(pair<int,int>(a[i].x,a[i].y)); //存入set } int sum = 0; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) { int x = f(a[i].x,a[j].x); //求中点横坐标 int y = f(a[i].y,a[j].y); //求中点竖坐标 if(s.find(pair<int,int>(x+(-1*(a[i].y-y)),y+(a[i].x-x)))!=s.end() && s.find(pair<int,int>(x-(-1*(a[i].y-y)),y-(a[i].x-x)))!=s.end()) //判断两个点是否存在 { sum++; } } } printf("%d\n",sum/2);//因为枚举两个点的时候,正方形有两个对角线,每个正方形会遇到两次,所以除以2 } return 0;}
0 0
- poj 2002 Squares
- poj 2002 Squares
- POJ 2002 Squares
- poj 2002 Squares
- poj 2002 Squares
- poj-2002 Squares
- POJ 2002 Squares
- POJ 2002 Squares
- BIT1033 POJ 2002 Squares
- POJ 2002 Squares
- POJ 2002 Squares
- POJ 2002 Squares Hash
- POJ 2002 Squares
- poj 2002 Squares
- POJ 2002 Squares
- POJ 2002 Squares
- poj-2002-Squares--二分
- poj 2002 Squares
- 通过openURL启动第三方app并传参数
- Calendar Game(找规律+博弈)
- Android编程权威指南-第十七章挑战练习
- 论程序员的社会地位
- poj3150--Cellular Automaton(矩阵优化)
- POJ 2002 Squares
- 杭电1181变形课
- POJ 1330 Nearest Common Ancestors
- Leetcode编程题解
- UITableView中关于cell里的按钮被点击时如何确定是哪一个cell
- 反混淆后的.net文件编译
- 如何给jquery添加方法
- C#中变量与对象、类型与类之间的区别
- 怎样在ABBYY PDF Transformer+中加盖图章