Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Distance II

Your task is to calculate the distance between two $n$ dimensional vectors $x = \{x_1, x_2, ..., x_n\}$ and $y = \{y_1, y_2, ..., y_n\}$.

The Minkowski's distance defined below is a metric which is a generalization of both the Manhattan distance and the Euclidean distance.

\[
D_{xy} = (\sum_{i=1}^n |x_i - y_i|^p)^{\frac{1}{p}}
\]

It can be the Manhattan distance

\[
D_{xy} = |x_1 - y_1| + |x_2 - y_2| + ... + |x_n - y_n|
\]

where $p = 1 $.

It can be the Euclidean distance

\[
D_{xy} = \sqrt{(|x_1 - y_1|)^{2} + (|x_2 - y_2|)^{2} + ... + (|x_n - y_n|)^{2}}
\]

where $p = 2 $.

Also, it can be the Chebyshev distance

\[
D_{xy} = max_{i=1}^n (|x_i - y_i|)
\]

where $p = \infty$

Write a program which reads two $n$ dimensional vectors $x$ and $y$, and calculates Minkowski's distance where $p = 1, 2, 3, \infty$ respectively.

Input

In the first line, an integer $n$ is given. In the second and third line, $x = \{x_1, x_2, ... x_n\}$ and $y = \{y_1, y_2, ... y_n\}$ are given respectively. The elements in $x$ and $y$ are given in integers.

Output

Print the distance where $p = 1, 2, 3$ and $\infty$ in a line respectively.
The output should not contain an absolute error greater than 10-5.

Constraints

$1 \leq n \leq 100$

$0 \leq x_i, y_i \leq 1000$

Sample Input

3
1 2 3
2 0 4

Sample Output

4.000000
2.449490
2.154435
2.000000

Solution in Ruby (judge verdict: Accepted)

count = gets.to_i;

aryX = gets.split(' ').map(&:to_i);
aryY = gets.split(' ').map(&:to_i);
aryZ = Array.new(count)

for index in 0..count -1 do
	aryZ[index] = (aryX[index].to_i - aryY[index].to_i).abs;
end

sumP1 = 0.to_f;
for indexP1 in 0..count - 1 do
	sumP1 = sumP1 + aryZ[indexP1].to_f;
end

sumP2 = 0.to_f;
for indexP2 in 0..count - 1 do
	sumP2 = sumP2 + aryZ[indexP2] * aryZ[indexP2];
end

sumP3 = 0.to_f;
for indexP3 in 0..count - 1 do
	sumP3 = sumP3 + aryZ[indexP3] * aryZ[indexP3] * aryZ[indexP3];
end

sumPmax = aryZ[0].to_f;
for indexPmax in 0..count - 1 do
	if sumPmax < aryZ[indexPmax] then
		sumPmax = aryZ[indexPmax];
	end
end

puts "%.6f" % sumP1;
puts "%.6f" % Math.sqrt(sumP2);
puts "%.6f" % Math.cbrt(sumP3);
puts "%.6f" % sumPmax;