poj2002

#include<stdio.h>
#include<malloc.h>
#include<string.h>
typedef struct Node
{
short x;
short y;
struct Node *next;
}Node;


Node *Hash[57][57] = {0};




void addNode(Node n);
int nodeValid(Node n);


int nodeValid(Node n)
{
Node *p;
int xhash = n.x;
int yhash = n.y;


xhash = (xhash<0 ? -xhash : xhash)%57;
yhash = (yhash<0 ? -yhash : yhash)%57;


p = Hash[xhash][yhash];
while(p)
{
if(p->x==n.x && p->y==n.y)
return 1;
p = p->next;
}
return 0;
}
void addNode(Node n)
{
Node *t;
int xhash = n.x;
int yhash = n.y;


xhash = (xhash<0 ? -xhash : xhash)%57;
yhash = (yhash<0 ? -yhash : yhash)%57;


t = (Node *)malloc(sizeof(Node) * 1);
t->x = n.x;
t->y = n.y;


t->next = Hash[xhash][yhash];
Hash[xhash][yhash] = t;
}


int main(void)
{
int a,b;
int solution;
int i,j;
int n;
Node nodes[1000];
Node n3,n4;
scanf("%d",&n);
while(n)
{
memset(Hash,0,sizeof(Node *)*57*57);
solution = 0;
for(i=0; i<n; i++)
{
scanf("%d%d",&nodes[i].x,&nodes[i].y);
addNode(nodes[i]);
}
for(i=0; i<n-1; i++)
{
for(j=i+1; j<n; j++)
{
a = nodes[j].y-nodes[i].y;
b = nodes[j].x-nodes[i].x;
n3.x = nodes[i].x - (a);
n3.y = nodes[i].y + (b);
n4.x = nodes[j].x - (a);
n4.y = nodes[j].y + (b);
if( nodeValid(n3) && nodeValid(n4) )
solution++;
n3.x = nodes[i].x + (a);
n3.y = nodes[i].y - (b);
n4.x = nodes[j].x + (a);
n4.y = nodes[j].y - (b);
if( nodeValid(n3) && nodeValid(n4) )
solution++;
}
}
printf("%d\n",solution/4);
scanf("%d",&n);
}
}