hdoj 5533 Dancing Stars on Me【数学】
来源:互联网 发布:求生之路2游侠网络联机 编辑:程序博客网 时间:2024/05/31 13:16
Dancing Stars on Me
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 588 Accepted Submission(s): 312
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亚洲区长春站-重现赛(感谢东北师大)
#include<cstring>#include<cstdio>#include<cmath>#define min(a, b) a>b?b:ausing namespace std;const int inf = 0x3f3f3f;double x[150],y[150];double a[1010][1010];double getline(int i, int j){return sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));}int main(){int T;scanf("%d", &T);while(T--){memset(a, 0 , sizeof(a));double t = inf;int n;scanf("%d", &n);for(int i = 0; i < n; i++){scanf("%lf%lf", &x[i], &y[i]);}for(int i = 0; i < n; i++){for(int j = i+1; j < n; j++){a[i][j] = getline(i,j);t = min (t, a[i][j]);}}int num = 0;for(int i = 0; i < n; i++){for(int j = i+1; j < n; j++){if(t == a[i][j])num++;}}if(num==n)puts("YES");elseputs("NO");}return 0;}
0 0
- hdoj 5533 Dancing Stars on Me【数学】
- hdoj Dancing Stars on Me 5533 (数学几何&&技巧)
- 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 [数学]
- HDOJ 5533 Dancing Stars on Me(凸包,convex hall)
- 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
- 杭电5533 Dancing Stars on Me
- 杭电-5533Dancing Stars on Me
- HDU 5533 Dancing Stars on Me
- sort函数的用法,自定义comp参数。
- Gradle多渠道打包
- iptables学习概要总结
- ssdb下载安装
- Ubnutu忘记用户密码怎么办
- hdoj 5533 Dancing Stars on Me【数学】
- iOS动画和特效(三)MotionEffects
- Python中的__main__
- Access to DialectResolutionInfo cannot be null when 'hibernate.dialect' not set——【hibernate 日常错误】
- 底层_读取文件时上锁_demo
- thinkphp3.2 控制器
- vim 正则表达式
- Java源码 SpringMVC Mybatis Shiro Bootstrap Rest Webservice
- MyEclipse代码提示设置