2017 Multi-University Training Contest - Team 2 &hdu 6055 Regular polygon

Regular polygon

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

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个整数点 问你组成正多边形的有几组

因为题目给的是整数点 只要正四边形才能是整点

所以我们只要枚举其中任意两个点 利用旋转公式可以得到其它两个点 判断其他两个点是否存在就可以了

旋转公式是 x=xcos@-ysin@

          y=xsin@-ycos@;

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<cstdlib>
 #include<string.h>
 #include<set>
 #include<vector>
 #include<queue>
 #include<stack>
 #include<map>
 #include<cmath>
 typedef long long ll;
 typedef unsigned long long LL;
 using namespace std;
 const double PI=acos(-1.0);
 const double eps=0.0000000001;
 const int N=+;
 struct node{
     int x,y;
 }a[N];
 int vis[N][N];
 int main(){
     int n;
     while(scanf("%d",&n)!=EOF){
         memset(vis,,sizeof(vis));
         for(int i=;i<=n;i++){
             scanf("%d%d",&a[i].x,&a[i].y);
             vis[a[i].x+][a[i].y+]=i;
         }
         ll ans=;
         int x,y;
         int xx,yy;
         int len;
         for(int i=;i<=n;i++){
             for(int j=i+;j<=n;j++){
                 if(i==j)continue;
                 x=(a[j].y-a[i].y)+a[i].x;
                 y=(a[j].x-a[i].x)*(-)+a[i].y;
                 xx=-(a[i].y-a[j].y)+a[j].x;
                 yy=(a[i].x-a[j].x)+a[j].y;
                 int t1=vis[x+][y+];
                 int t2=vis[xx+][yy+];
                 if(t1&&t2)ans++;
                 x=-(a[j].y-a[i].y)+a[i].x;
                 y=(a[j].x-a[i].x)+a[i].y;
                 xx=(a[i].y-a[j].y)+a[j].x;
                 yy=-(a[i].x-a[j].x)+a[j].y;
                 int t3=vis[x+][y+];
                 int t4=vis[xx+][yy+];
                 if(t3&&t4)ans++;
             }
         }
        // cout<<ans<<endl;
         ans=ans/;
         printf("%I64d\n",ans);
     }
 }