HDU-5533 Dancing stars on me
来源:互联网 发布:多媒体播放器软件 编辑:程序博客网 时间:2024/05/20 02:29
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.
All coordinates are distinct.
330 01 11 040 00 11 01 150 00 10 22 22 0
NOYESNO题目大意:判断给出的坐标可不可以构成正m边形
首先要知道,因为坐标是整数,只有当 m == 4 的时候才有可能是正方形,别的都不可能所以只要判断是不是正方形就 ok 了, 可是给出的坐标不一定是按照顺序给出的,所以要判断一下,让他按照顺序给出
#include <cstdio>#define MAXN 1100#define INF 0x3f3f3f3fdouble x[MAXN],y[MAXN];double map[MAXN][MAXN];double fun(int i,int j){return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);}int main(){int T;int N;int i,j;scanf("%d",&T);while(T--){scanf("%d",&N);for(i=1;i<=N;++i){scanf("%lf%lf",x+i,y+i);}double min=INF;for(i=1;i<=N;++i){for(j=i+1;j<=N;++j){map[i][j]=fun(i,j);if(min>map[i][j]){min=map[i][j];}}}int cnt=0;for(i=1;i<=N;++i)for(j=i+1;j<=N;++j)if(min==map[i][j])cnt++;if(cnt==N) printf("YES\n");else printf("NO\n");}return 0;}
阅读全文
0 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
- 随笔--零碎
- Word Break
- bzoj1800: [Ahoi2009]fly 飞行棋
- HDU 2043 密码
- 对于iOS delegate的粗浅理解(之后深入研究再补充)
- HDU-5533 Dancing stars on me
- centos下安装munge
- java入门(二)
- 不用获取权限的悬浮球
- 柔性数组
- 医学图像处理涉及到的窗宽窗位 1
- 行为型模式之模板模式实现
- 服务器使用Gzip压缩数据,加快网络传输(Java 例子)
- Android USB默认连接模式为MTP