链接:http://poj.org/problem?id=2002
给出坐标系中的点,问最多有几个正方形;
枚举其中两个点,找剩余两点是否存在,O(n^2)。
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
#include <string>
#include <map>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 1000000
#define MAXM 4500000
const int mod=5077;
struct node
{
int x,y,next;
}poi[6000];
int a[2005],b[2005],head[6000],ind;
void add_(int x, int y)
{
int u=(x*x+y*y)%mod;
poi[ind].x=x;
poi[ind].y=y;
poi[ind].next=head[u];
head[u]=ind++;
}
bool find_(int x, int y)
{
int u=(x*x+y*y)%mod;
for(int i=head[u]; i+1; i=poi[i].next)
if(x==poi[i].x && y==poi[i].y)
return 1;
return 0;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==0)break;
ind=0;
memset(head,-1,sizeof(head));
for(int i=0; i<n; ++i)
{
scanf("%d%d",&a[i],&b[i]);
add_(a[i],b[i]);
}
int x1,x2,y1,y2,ans=0;
for(int i=0; i<n; ++i)
{
for(int j=i+1; j<n; ++j)
{
x1=a[i],x2=a[j];
y1=b[i],y2=b[j];
if(x1>x2){swap(x1,x2);swap(y1,y2);}
if(y2<=y1 && x1!=x2)
if( find_(x1+y1-y2, y1+x2-x1) && find_(x2+y1-y2, y2+x2-x1))
ans++;
}
}
printf("%d\n",ans);
}
return 0;
}
/*
4
1 5
3 3
4 5
-1 -6
4
-4 2
-4 2
-4 2
-4 2
*/