시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 128 MB | 61 | 1 | 1 | 14.286% |
Given a set of points with integer coordinates $x_i, y_i$, $i = 1 \ldots N$, your program must find all the squares having each of four vertices in one of these points.
Input file contains integer $N$ followed by $N$ pairs of integers $x_i$ $y_i$.
Output file must contain a single integer -- number of squares found.
4 0 0 4 3 -3 4 1 7
1
9 1 1 1 2 1 3 2 1 2 2 2 3 3 1 3 2 3 3
6