AtCoder Beginner Contest 180
B
Various distances
AtCoder
⌀ 0
原题
← AC →
翻译中…

Problem Statement

翻译中…

Given is a point $(x_1,\ldots,x_N)$ in an $N$-dimensional space.

翻译中…

Find the Manhattan distance, Euclidian distance, and Chebyshev distance between this point and the origin. Here, each of them is defined as follows:

翻译中…
  • The Manhattan distance: $|x_1|+\ldots+|x_N|$
  • The Euclidian distance: $\sqrt{|x_1|^2+\ldots+|x_N|^2}$
  • The Chebyshev distance: $\max(|x_1|,\ldots,|x_N|)$
翻译中…

Constraints

翻译中…
  • $1 \leq N \leq 10^5$
  • $-10^5 \leq x_i \leq 10^5$
  • All values in input are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N
x_1 \ldots x_N

翻译中…

Output

翻译中…

Print the Manhattan distance, Euclidian distance, and Chebyshev distance between the given point and the origin, each in its own line. Each value in your print will be accepted when its absolute or relative error from the correct value is at most $10^{-9}$.

翻译中…

样例

Input #1
2
2 -1
Output #1
3
2.236067977499790
2
Each of the distances is computed as follows: - The Manhattan distance: $|2|+|-1|=3$ - The Euclidian distance: $\sqrt{|2|^2+|-1|^2}=2.236067977499789696\ldots$ - The Chebyshev distance: $\max(|2|,|-1|)=2$
Input #2
10
3 -1 -4 1 -5 9 2 -6 5 -3
Output #2
39
14.387494569938159
9
题目信息
题号
abc180_b
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。