Preparando MOJI

Number of Triplets

2000ms 262144K

Description:

You are given n points on a plane. All points are different.

Find the number of different groups of three points (A, B, C) such that point B is the middle of segment AC.

The groups of three points are considered unordered, that is, if point B is the middle of segment AC, then groups (A, B, C) and (C, B, A) are considered the same.

Input:

The first line contains a single integer n (3 ≤ n ≤ 3000) — the number of points.

Next n lines contain the points. The i-th line contains coordinates of the i-th point: two space-separated integers xi, yi ( - 1000 ≤ xi, yi ≤ 1000).

It is guaranteed that all given points are different.

Output:

Print the single number — the answer to the problem.

Sample Input:

3
1 1
2 2
3 3

Sample Output:

1

Sample Input:

3
0 0
-1 0
0 1

Sample Output:

0

Informação

Codeforces

Provedor Codeforces

Código CF181B

Tags

binary searchbrute force

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:36:46

Relacionados

Nada ainda