G - sorry 没有北门
来源:互联网 发布:怎么做钓鱼软件 编辑:程序博客网 时间:2024/04/30 14:53
Description
The sky was brushed clean by the wind and the stars were cold in a black sky. What a wonderful night. You observed that, sometimes the stars can form a regular polygon in the sky if we connect them properly. You want to record these moments by your smart camera. Of course, you cannot stay awake all night for capturing. So you decide to write a program running on the smart camera to check whether the stars can form a regular polygon and capture these moments automatically.
Formally, a regular polygon is a convex polygon whose angles are all equal and all its sides have the same length. The area of a regular polygon must be nonzero. We say the stars can form a regular polygon if they are exactly the vertices of some regular polygon. To simplify the problem, we project the sky to a two-dimensional plane here, and you just need to check whether the stars can form a regular polygon in this plane.
Formally, a regular polygon is a convex polygon whose angles are all equal and all its sides have the same length. The area of a regular polygon must be nonzero. We say the stars can form a regular polygon if they are exactly the vertices of some regular polygon. To simplify the problem, we project the sky to a two-dimensional plane here, and you just need to check whether the stars can form a regular polygon in this plane.
Input
The first line contains a integer $T$ indicating the total number of test cases. Each test case begins with an integer $n$, denoting the number of stars in the sky. Following $n$ lines, each contains $2$ integers $x_i, y_i$, describe the coordinates of $n$ stars.
$1 \le T \le 300$
$3 \le n \le 100$
$-10000 \le x_i, y_i \le 10000$
All coordinates are distinct.
$1 \le T \le 300$
$3 \le n \le 100$
$-10000 \le x_i, y_i \le 10000$
All coordinates are distinct.
Output
For each test case, please output "`YES`" if the stars can form a regular polygon. Otherwise, output "`NO`" (both without quotes).
Sample Input
330 01 11 040 00 11 01 150 00 10 22 22 0
Sample Output
NOYESNO
因为坐标都是整数,所以只存在正四边形的情况。。。
#include<stdio.h>#include<algorithm>using namespace std;struct node{int x,y;}p[2000];int cmp(node a,node b){if(a.x!=b.x)return a.x>b.x;elsereturn a.y>b.y;}int main(){int t;scanf("%d",&t);while(t--){int n,f1=0,f2=0;scanf("%d",&n);int i;for(i=0;i<n;i++){scanf("%d%d",&p[i].x,&p[i].y);}sort(p,p+n,cmp);if(n==4){if(p[0].x-p[1].x==p[2].x-p[3].x) f1=1; if(p[0].y-p[1].y==p[2].y-p[3].y) f2=1;}if(f1==1&&f2==1) printf("YES\n");else printf("NO\n");}return 0;}
0 0
- G - sorry 没有北门
- Sorry
- sorry
- sorry
- 出了北门往南走
- sorry dear
- 不用sorry
- sorry csdn!!!!!
- Sorry!Microsoft。
- 選擇說聲--Sorry
- 手机没有4G信号
- Oracle 11g 没有dbconsole 服务
- Hot! 成都北门车站班期时刻表 班车信息
- 烟花办明在工体北门设点
- I am sorry
- say sorry to myself
- sorry dear (2)
- Lesson 3 Sorry,Sir
- 使用yum源安装CDH Hadoop集群
- poj 2516 Minimum Cost KM算法
- 跨域问题:Access-Control-Allow-Origin
- 数据结构-多项式
- UIDeviceOrientation
- G - sorry 没有北门
- 使用Git+msysGit上传项目
- UEFI BIOS模式下Windows系统启动过程以及引导文件修复方法
- Java基础类库简介及lang包介绍
- 前后台切换会调用哪些方法
- HDOJ 1003 Max Sum参考程序
- Eclipse DDMS检测不到设备问题及解决方法
- 九度OJ 1357:疯狂地Jobdu序列 (数字特性)
- iBatis iterate标签