3432 -- Count Squares

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

Language:

Count Squares

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 3114		Accepted: 1384

Description

Given a set of points with integer coordinates x_i, y_i, i = 1...N, your program must find all the squares having each of four vertices in one of these points.

Input

Input file contains integer N followed by N pairs of integers x_i y_i.

Constraints

-10⁴ ≤ x_i, y_i ≤ 10⁴, 1 ≤ N ≤ 2000. All points in the input are different.

Output

Output file must contain a single integer — number of squares found.

Sample Input

Sample input 1
4 0 0 4 3 -3 4 1 7
Sample input 2
9
1 1  1 2  1 3  
2 1  2 2  2 3  
3 1  3 2  3 3

Sample Output

Sample output 1
1
Sample output 2
6

Hint

Bold texts appearing in the sample sections are informative and do not form part of the actual data.

Source

Northeastern Europe 2005, Far-Eastern Subregion

[Submit] [Go Back] [Status] [Discuss]

Home Page Go Back To top