POJ-2002 hash_map

Description

A square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same polygon. It is not the only polygon with the latter property, however, as a regular octagon also has this property.

So we all know what a square looks like, but can we find all possible squares that can be formed from a set of stars in a night sky? To make the problem easier, we will assume that the night sky is a 2-dimensional plane, and each star is specified by its x and y coordinates.
Input

The input consists of a number of test cases. Each test case starts with the integer n (1 <= n <= 1000) indicating the number of points to follow. Each of the next n lines specify the x and y coordinates (two integers) of each point. You may assume that the points are distinct and the magnitudes of the coordinates are less than 20000. The input is terminated when n = 0.
Output

For each test case, print on a line the number of squares one can form from the given stars.
Sample Input

4
1 0
0 1
1 1
0 0
9
0 0
1 0
2 0
0 2
1 2
2 2
0 1
1 1
2 1
4
-2 5
3 7
0 0
5 2
0
Sample Output

1
6
1

记录下手写hash_map

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
const int maxsz=1e5+7;
struct hash_map{
	int head[maxsz],next[maxsz],size;
	pair<int,int> st[maxsz];
	void clear(){size=0,memset(head,-1,sizeof(head));}
	int Hash(pair<int,int> v){return v.first*v.first+v.second*v.second;}
	int insert(pair<int,int> val){
		int h=Hash(val)%maxsz;
		for(int i=head[h];~i;i=next[i])if(val==st[i])return 1;
		st[size]=val,next[size]=head[h],head[h]=size++;return 0;
	}
	int operator[](pair<int,int> val){
		int h=Hash(val)%maxsz;
		for(int i=head[h];~i;i=next[i])if(val==st[i])return 1;
		return 0;
	}
}H;
int main(){
	int n;
	while(scanf("%d",&n),n){
		H.clear();
		int cnt=0;
		vector<pair<int,int> >q(n);
		for(int i=0;i<n;++i)scanf("%d%d",&q[i].first,&q[i].second),H.insert(q[i]);
		for(int i=0;i<n;++i){
			for(int j=i+1;j<n;++j){
				pair<int,int>a=q[i],b=q[j],
				c(a.first+(a.second-b.second),a.second-(a.first-b.first)),
				d(b.first+(a.second-b.second),b.second-(a.first-b.first));
				if(H[c]&&H[d])++cnt;
			}
			for(int j=i+1;j<n;++j){
				pair<int,int>a=q[i],b=q[j],
				c(a.first-(a.second-b.second),a.second+(a.first-b.first)),
				d(b.first-(a.second-b.second),b.second+(a.first-b.first));
				if(H[c]&&H[d])++cnt;
			}
		}
		printf("%d\n",cnt>>2);
	}
	return 0;
}