B-Dancing Stars on Me【几何·暑假训练赛7】

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.

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.

Output

For each test case, please output “YES” if the stars can form a regular polygon. Otherwise, output “NO” (both without quotes).

Sample Input

3
3
0 0
1 1
1 0
4
0 0
0 1
1 0
1 1
5
0 0
0 1
0 2
2 2
2 0

Sample Output

NO
YES
NO

Code

/*
判断各点连成后是否构成正多边形，我采用的方法有些投机——取一点（0,0），计算它到各点的
距离，对得到的各距离进行排序，必然对称；然后取此点相邻的一个点，比较得到的距离
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int star[110][2];
float dis[110],dis2[110];  //记得用浮点型

int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        for(int i=0;i<n;i++){
            for(int j=0;j<2;j++){
                scanf("%d",&star[i][j]);
                getchar();
            }
        }
        for(int i=0;i<n;i++){
            dis[i]=sqrt((star[i][0]-star[0][0])*(star[i][0]-star[0][0])+(star[i][1]-star[0][1])*(star[i][1]-star[0][1]));
        }
        sort(dis,dis+n);
        if(n&1){
            int flag=0;
            for(int i=1;i<n-1;i+=2){
                if(abs(dis[i]-dis[i+1])>1e-5){
                    flag=1;break;
                }
            }
            if(flag){
                printf("NO\n");continue;
            }
        }
        else{
            int flag=0;
            for(int i=1;i<n-2;i+=2){
                if(abs(dis[i]-dis[i+1])>1e-5){
                    flag=1;break;
                }
            }
            if(flag){
                printf("NO\n");continue;
            }
        }

        int a;
        for(int i=1;i<n;i++){
            float d=sqrt((star[i][0]-star[0][0])*(star[i][0]-star[0][0])+(star[i][1]-star[0][1])*(star[i][1]-star[0][1]));
            if((d-dis[1])<=1e-5){
                a=i;break;
            }
        }
        for(int i=0;i<n;i++){
            dis2[i]=sqrt((star[i][0]-star[a][0])*(star[i][0]-star[a][0])+(star[i][1]-star[a][1])*(star[i][1]-star[a][1]));
        }
        sort(dis2,dis2+n);
        int flag=0;
        for(int i=1;i<n;i++){
            if(abs(dis2[i]-dis[i])>1e-5){
                flag=1;break;
            }
        }
        if(flag){
            printf("NO\n");continue;
        }
        else printf("YES\n");
    }
    return 0;
}