POJ 1971 Parallelogram Counting

 Parallelogram Counting

There are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose vertices lie on these points. In other words, find the number of 4-element subsets of these points that can be written as {A, B, C, D} such that AB || CD, and BC || AD. No four points are in a straight line.

Input

Input starts with an integer T (≤ 15), denoting the number of test cases.

The first line of each test case contains an integer n (1 ≤ n ≤ 1000). Each of the next n lines, contains 2 space-separated integers x and y (the coordinates of a point) with magnitude (absolute value) of no more than 1000000000.

Output

For each case, print the case number and the number of parallelograms that can be formed.

Sample Input

2

6

0 0

2 0

4 0

1 1

3 1

5 1

7

-2 -1

8 9

5 7

1 1

4 8

2 0

9 8

Sample Output

Case 1: 5

Case 2: 6

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
	int x,y;
}num[1010];
node k[1010*505];
node p;
bool cmp(node a,node b)
{
	if(a.x!=b.x)
	return a.x<b.x;
	else
	return a.y<b.y;
}
int main()
{
	int t,n,i,j;
	int cns=1;
	int sum,cnt,ans;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		scanf("%d%d",&num[i].x,&num[i].y);
		cnt=0;
		for(i=0;i<n;i++)
		{
			for(j=i+1;j<n;j++)
			{
				k[cnt].x=num[i].x+num[j].x;
				k[cnt++].y=num[i].y+num[j].y;

			}
		}
		sort(k,k+cnt,cmp);
		sum=0;
	    p.x=k[0].x;p.y=k[0].y;
		for(i=1;i<cnt;)
		{
			ans=1;
			while(p.y==k[i].y&&p.x==k[i].x)
			{
				ans++;i++;
			}
			p.x=k[i].x;
			p.y=k[i].y;
			i++;
			if(ans>1)
				sum+=ans*(ans-1)/2;

		}
		printf("Case %d: %d\n",cns++,sum);
	}
	return 0;
}