Preparando MOJI

Sereja and Squares

2000ms 524288K

Description:

Sereja has painted n distinct points on the plane. The coordinates of each point are integers. Now he is wondering: how many squares are there with sides parallel to the coordinate axes and with points painted in all its four vertexes? Help him, calculate this number.

Input:

The first line contains integer n (1 ≤ n ≤ 105). Each of the next n lines contains two integers xi, yi (0 ≤ xi, yi ≤ 105), the integers represent the coordinates of the i-th point. It is guaranteed that all the given points are distinct.

Output:

In a single line print the required number of squares.

Sample Input:

5
0 0
0 2
2 0
2 2
1 1

Sample Output:

1

Sample Input:

9
0 0
1 1
2 2
0 1
1 0
0 2
2 0
1 2
2 1

Sample Output:

5

Informação

Codeforces

Provedor Codeforces

Código CF425D

Tags

binary searchdata structureshashing

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:50:47

Relacionados

Nada ainda