Preparando MOJI

Points

1000ms 262144K

Description:

You are given N points on a plane. Write a program which will find the sum of squares of distances between all pairs of points.

Input:

The first line of input contains one integer number N (1 ≤ N ≤ 100 000) — the number of points. Each of the following N lines contain two integer numbers X and Y ( - 10 000 ≤ X, Y ≤ 10 000) — the coordinates of points. Two or more points may coincide.

Output:

The only line of output should contain the required sum of squares of distances between all pairs of points.

Sample Input:

4
1 1
-1 -1
1 -1
-1 1

Sample Output:

32

Informação

Codeforces

Provedor Codeforces

Código CF76E

Tags

implementationmath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:30:46

Relacionados

Nada ainda