2017 Multi-University Training Contest - Team 2

Regular polygon

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 177    Accepted Submission(s): 74

Problem Description

On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make.

 

Input

The input file consists of several test cases. Each case the first line is a numbers N (N <= 500). The next N lines ,each line contain two number Xi and Yi(-100 <= xi,yi <= 100), means the points’ position.(the data assures no two points share the same position.)

 

Output

For each case, output a number means how many different regular polygon these points can make.

 

Sample Input

4
0 0
0 1
1 0
1 1
6
0 0
0 1
1 0
1 1
2 0
2 1

 

Sample Output

1
2

 

Source

2017 Multi-University Training Contest - Team 2

 

最弱的一题，不过这个正多边形必然是正方形有点骚，不好想啊

#include <bits/stdc++.h>
using namespace std;
int main() {
    int x[],y[];
    int n;
    while(cin>>n) {
        set<pair<int,int> >S;
        for(int i=; i<n; i++) {
            cin>>x[i]>>y[i];
            S.insert(make_pair(x[i],y[i]));
        }
        int cnt=;
        for(int i=; i<n; i++)
            for(int j=; j<i; j++) {
                int mx=x[i]+x[j],dx=max(x[i],x[j])-min(x[i],x[j]);
                int my=y[i]+y[j],dy=max(y[i],y[j])-min(y[i],y[j]);
                if ((mx+dy)&||(my+dx)&) continue;
                int sg=((x[i]-x[j])*(y[i]-y[j])<)?:-;
                if (S.count(make_pair((mx+dy)/,(my+sg*dx)/))&&S.count(make_pair((mx-dy)/,(my-sg*dx)/)))
                    cnt++;

            }
        cout<<cnt/<<endl;
    }
    return ;
}