← 返回题目
题库练习 Sereja and Squares
← 上一题 下一题 →

A9375 | Sereja and Squares

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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.

输入格式

The first line contains integer $n$ $(1<=n<=10^{5})$ . Each of the next $n$ lines contains two integers $x_{i},y_{i}$ $(0<=x_{i},y_{i}<=10^{5})$ , the integers represent the coordinates of the $i$ -th point. It is guaranteed that all the given points are distinct.

输出格式

In a single line print the required number of squares.

输入输出样例

输入 #1
5
0 0
0 2
2 0
2 2
1 1
输出 #1
1
输入 #2
9
0 0
1 1
2 2
0 1
1 0
0 2
2 0
1 2
2 1
输出 #2
5
C++ 编辑器
输入
输出