题意:
给n个点,问能组成多少个正多边形
思路:
1、求正多边形即求正方形
2、枚举每条边,通过枚举的边,查询以当前边为对角线的正方形,另外两个点是否存在,查询用二分实现
3、由于每个正方形有两条对角线,所以答案要除以2
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define N 505
#define M 105
#define INF 0x3f3f3f3f
#define mod 1000000007
#define eps 1e-8
struct node
{
int a,b;
bool friend operator<(node x,node y){
if(x.a == y.a) return x.b < y.b;
return x.a < y.a;
}
}no[N];
int tol;
int n;
bool _find(double a,double b) //二分查找
{
int l = 0,r = n-1;
while(l<=r){
int mid = l + r >> 1;
if(abs(no[mid].a-a)<eps && abs(no[mid].b-b)<eps) return 1;
if( (no[mid].a < a && abs(no[mid].a - a) > eps) || (abs(no[mid].a - a) < eps && (no[mid].b < b && abs(no[mid].b - b) > eps))){
l = mid + 1;
}else r = mid - 1;
}
return 0;
}
int main()
{
while(~scanf("%d",&n)){
for(int i=0;i<n;i++){
scanf("%d%d",&no[i].a,&no[i].b);
}
sort(no,no+n);
int ans = 0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
double mid_a = (no[i].a + no[j].a) / 2.; //以该边为正方形对边线的中点的 横坐标
double mid_b = (no[i].b + no[j].b) / 2.; //以该边为正方形对边线的中点的 纵坐标
double a = mid_a + mid_b - no[i].b;
double b = mid_b + no[i].a - mid_a;
if(!_find(a,b)) continue;
a = mid_a + no[i].b - mid_b;
b = mid_b + mid_a - no[i].a;
if(!_find(a,b)) continue;
ans++; //若对应的两个点都存在,则答案加一
}
}
cout<<ans/2<<endl;
}
}