Score : $300$ points

问题描述

在数轴上居住着 $N$ 个人。

第 $i$ 个人位于坐标 $X_i$ 处。

你将组织一场所有 $N$ 人都必须参加的会议。

会议可以在任意 整数坐标 上举行。如果你选择在坐标 $P$ 处召开会议，那么第 $i$ 个人将会花费 $(X_i - P)^2$ 点体力来参加会议。

找出这 $N$ 个人所需的最小总体力消耗点数。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

There are $N$ people living on a number line.

The $i$-th person lives at coordinate $X_i$.

You are going to hold a meeting that all $N$ people have to attend.

The meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate $P$, the $i$-th person will spend $(X_i - P)^2$ points of stamina to attend the meeting.

Find the minimum total points of stamina the $N$ people have to spend.

Constraints

• All values in input are integers.
• $1 \leq N \leq 100$
• $1 \leq X_i \leq 100$

Input

Input is given from Standard Input in the following format:

$N$

$X_1$ $X_2$ $...$ $X_N$

Output

Print the minimum total stamina the $N$ people have to spend.

Sample Input 1

2
1 4

Sample Output 1

5

Assume the meeting is held at coordinate $2$. In this case, the first person will spend $(1 - 2)^2$ points of stamina, and the second person will spend $(4 - 2)^2 = 4$ points of stamina, for a total of $5$ points of stamina. This is the minimum total stamina that the $2$ people have to spend.

Note that you can hold the meeting only at an integer coordinate.

Sample Input 2

7
14 14 2 13 56 2 37

Sample Output 2

2354

update @ 2024/3/10 17:15:48