PRAVOKUTNI
시간 제한: 1000ms메모리 제한: 128MB출처: COCI 2007-2008BOJ 3008
문제
N points are placed in the coordinate plane.
Write a program which calculates in how many ways a right triangle can be formed by three of the given points. A right triangle is one in which one of the angles is 90 degrees.
입력
The first line of input contains an integer N (3 ≤ N ≤ 1500), the number of points.
Each of the following N lines contains the coordinates of one point, two integers separated by a space. The coordinates will be between −109 and 109.
No two points will be located at the same coordinates.
출력
Output the number of right triangles.
예제
예제 1
입력
3 4 2 2 1 1 3
출력
1
예제 2
입력
4 5 0 2 6 8 6 5 7
출력
0
예제 3
입력
5 -1 1 -1 0 0 0 1 0 1 1
출력
7
코드를 제출하려면 로그인하세요.