Dancing Stars on Me（UVALive 7189）

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, 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

题解：

给n个点，问能否构成正多边形。计算出任意两点之间距离，只要有n-1条最短边即达到要求。

代码如下：

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<map>
#include<set>
#define max(a,b)   (a>b?a:b)
#define min(a,b)   (a<b?a:b)
#define swap(a,b)  (a=a+b,b=a-b,a=a-b)
#define maxn 27
#define N 100000000
#define INF 0x3f3f3f3f
#define mod 1001113
#define e  2.718281828459045
#define eps 1.0e18
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define read(x) scanf("%d",&x)
#define put(x) prllf("%d\n",x)
#define memset(x,y) memset(x,y,sizeof(x))
#define Debug(x) cout<<x<<" "<<endl
#define lson i << 1,l,m
#define rson i << 1 | 1,m + 1,r
#define ll long long
//std::ios::sync_with_stdio(false);
//cin.tie(NULL);
//const int maxn=;
using namespace std;

ll a[107],b[107],s[5100];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        for(int i=0; i<n; i++)
            cin>>a[i]>>b[i];
        int k=0;
        for(int i=0; i<n-1; i++)
            for(int j=i+1; j<n; j++)
            {
                s[k++]=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]);
            }
        sort(s,s+k);
        int sum=0;
        for(int i=0; i<=k; i++)
            if(s[i]==s[0])
                sum++;
        //cout<<sum<<endl;
        if(sum==n)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
        memset(a,0);
        memset(b,0);
        memset(s,0);
    }
    return 0;
}