杭电5533 Dancing Stars on Me
来源:互联网 发布:河北省软件企业 编辑:程序博客网 时间:2024/05/20 15:38
Dancing Stars on Me
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 360 Accepted Submission(s): 217
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<stdio.h>int i,j,k,l,m,n,ans;double a[1100],b[1100],Min;int ac(int i,int j){return ((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));}int main(){scanf("%d",&k);while(k--){scanf("%d",&m);for(i=0;i<m;i++)scanf("%lf%lf",&a[i],&b[i]);Min=0x3f3f3f3f*1.0;//定义为无穷大 for(i=0;i<m;i++)for(j=i+1;j<m;j++)Min=Min<ac(i,j)?Min:ac(i,j);//找到最小的边 ans=0;for(i=0;i<m;i++)for(j=i+1;j<m;j++)if(ac(i,j)==Min)//最小边的个数为M ans++;if(ans==m)printf("YES\n");elseprintf("NO\n");}}
0 0
- 杭电5533 Dancing Stars on Me
- 杭电-5533Dancing 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
- hdoj 5533 Dancing Stars on Me
- HDOJ 5533 Dancing Stars on Me
- hdoj 5533 Dancing Stars on Me【数学】
- hdoj 5533 Dancing Stars on Me 【数学题】
- hdoj 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
- hdoj 5533 Dancing Stars on Me
- test
- 第四章:基于第二章HBase集群搭建实验
- 将计算机思维故事化——之设计模式简单工厂、工厂模式及抽象工厂
- 安卓开发之组件
- [LeetCode]Linked List Cycle II
- 杭电5533 Dancing Stars on Me
- cas在windows下集成AD域
- C语言 memcpy memmove
- PHP程序对象、数组串行化(序列化)
- Orlace 数据库连接的那些事儿:服务器端(四)
- 【转帖】安装Intel HAXM为Android 模拟器加速,30秒内启动完成
- Linux驱动环境配置之内核树的建立
- swing之进度监视
- ubuntu中安装和卸载apache2