hdu---2428Stars

Stars

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 1452    Accepted Submission(s): 503

Problem Description

    Lucy loves stars very much. There are N (1 <= N <= 1000) stars in the sky. Assume the sky is a flat plane. All of the stars lie on it with a location (x, y), -10000 <= x, y <= 10000. Now, Lucy wants you to tell her how many squares with each of four vertices formed by these stars, and the edges of the squares should parallel to the coordinate axes.

 

 

Input

    The first line of input is the number of test case.
    The first line of each test case contains an integer N. The following N lines each contains two integers x, y, meaning the coordinates of the stars. All the coordinates are different.

 

 

Output

    For each test case, output the number of squares in a single line.

 

 

Sample Input

2 1 1 2 4 0 0 1 0 1 1 0 1

 

 

Sample Output

0 1

 

 

//是一道枚举+优化的题目       这里的优化体现在枚举之后  查找另外两点是采用的二分方法，不然会超时。

// 明早打下这个题目