hdu 5533 Dancing Stars on Me
来源:互联网 发布:淘宝怎么买岛国资源 编辑:程序博客网 时间:2024/05/20 03:07
Dancing Stars on Me
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 348 Accepted Submission(s): 211
Problem 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 xi,yi , describe the coordinates of n stars.
1≤T≤300
3≤n≤100
−10000≤xi,yi≤10000
All coordinates are distinct.
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
Source
2015ACM/ICPC亚洲区长春站-重现赛(感谢东北师大)
Recommend
hujie | We have carefully selected several similar problems for you: 5551 5550 5549 5548 5547
#include<bits/stdc++.h>using namespace std;const int maxn=110;const double eps=1e-6;typedef pair<double,double> Pdd;Pdd a[maxn],mid;int n;double getdis(Pdd a,Pdd b){ return sqrt((b.second-a.second)*(b.second-a.second)+(a.first-b.first)*(a.first-b.first));}void doit(){ mid.first=mid.second=0; scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%lf%lf",&a[i].first,&a[i].second); mid.first+=a[i].first/n; mid.second+=a[i].second/n; } double len=getdis(mid,a[1]); // printf("%lf %lf %lf\n",mid.first,mid.second,len); for(int i=2;i<=n;i++){ // printf("%d= %lf\n",i, getdis(mid,a[i])); if(abs(getdis(mid,a[i])-len)>eps){ puts("NO");return; } } puts("YES");}int main(){ int t;scanf("%d",&t); while(t--)doit(); return 0;}
1 0
- hdu 5533 Dancing Stars on Me
- hdu 5533 Dancing Stars on Me
- HDU 5533 Dancing Stars on Me
- hdu 5533 Dancing Stars on Me
- HDU 5533:Dancing Stars on Me【数学】
- HDU 5533 Dancing Stars on Me
- HDU 5533 Dancing Stars on Me [数学]
- HDU 5533 Dancing Stars on Me
- HDU-5533 Dancing stars on me
- HDU Dancing Stars on Me
- Dancing Stars on Me HDU
- HDU杭电5533 Dancing Stars on Me
- hdu 5533 Dancing Stars on Me(水)
- HDU 5533 Dancing Stars on Me(凸包)
- HDU-5533-Dancing Stars on Me【2015长春赛区】
- hdu 5533 Dancing Stars on Me【计算几何】
- HDU-5533 Dancing Stars on Me(几何/极点排序)
- 文章标题 HDU 5533 : Dancing Stars on Me
- C# 防止界面假死 多线程进度条的合理使用
- hdu5532Almost Sorted Array
- 复选框,单选框
- 纯CSS实现文字一行居中,多行左对齐的方法
- 计算机编程领域最伟大的20个发明
- hdu 5533 Dancing Stars on Me
- 记事本界面
- 一些知名的博客,常常去逛逛
- C#TreeView复选框的选择
- Java for Web学习笔记(六):Servlet(4)HttpServletResponse
- hdu 5534 Partial Tree
- Mac下AndroidStudio升级svn到1.8以及更改svn Format为1.8
- android系统定制化添加按键驱动步骤
- MysqlHelper.cs(C# 调用MySql数据库)