HDU 6055 Regular polygon —— 2017 Multi-University Training 2

Regular polygon

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

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

题目大意：有n个点，问总共能形成多少个正多边形。

思路：实际上只能形成正四边形，在官方题解里给出了相关的论文。。。然后就变成了一道水题，暴力枚举点对，查找每个点对是否有对应的点对形成正方形。由于坐标存在负数，对输入数据做一下处理，以及注意横（纵）坐标差值<=200，注意到这两点基本没问题了。具体看代码。

AC代码：

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 struct Node{
     int x;
     int y;
 }node[];
 bool vis[][];
 int main()
 {
     int n,dx,dy,a,b;
     while(~scanf("%d", &n))
     {
         int res=;
         memset(vis, , sizeof(vis));
         for(int i=;i<n;i++){
             scanf("%d%d", &a, &b);
             a+=;
             b+=;
             node[i].x=a;
             node[i].y=b;
             vis[node[i].x][node[i].y]=;
         }

         for(int i=;i<n;i++)
             for(int j=i+;j<n;j++){
                 dx=node[i].x-node[j].x;
                 dy=node[i].y-node[j].y;
                 if(vis[node[i].x+dy][node[i].y-dx]==&&vis[node[j].x+dy][node[j].y-dx]==)
                     res++;
                 if(vis[node[i].x-dy][node[i].y+dx]==&&vis[node[j].x-dy][node[j].y+dx]==)
                     res++;

             }
         cout<<res/<<endl;
     }
 }