【69.77%】【codeforces 723A】The New Year: Meeting Friends

time limit per test1 second

memory limit per test256 megabytes

inputstandard input

outputstandard output

There are three friend living on the straight line Ox in Lineland. The first friend lives at the point x1, the second friend lives at the point x2, and the third friend lives at the point x3. They plan to celebrate the New Year together, so they need to meet at one point. What is the minimum total distance they have to travel in order to meet at some point and celebrate the New Year?

It’s guaranteed that the optimal answer is always integer.

Input

The first line of the input contains three distinct integers x1, x2 and x3 (1 ≤ x1, x2, x3 ≤ 100) — the coordinates of the houses of the first, the second and the third friends respectively.

Output

Print one integer — the minimum total distance the friends need to travel in order to meet together.

Examples

input

7 1 4

output

6

input

30 20 10

output

20

Note

In the first sample, friends should meet at the point 4. Thus, the first friend has to travel the distance of 3 (from the point 7 to the point 4), the second friend also has to travel the distance of 3 (from the point 1 to the point 4), while the third friend should not go anywhere because he lives at the point 4.

【题解】



应该选在3个点中位置在中间的点；

又或者你啥都不知道。

枚举选择的位置1..100累加和abs(i-a)+abs(i-b)+abs(i-c);

取min

#include <cstdio>
#include <algorithm>

using namespace std;
const int INF = 2100000000;

int a, b, c,ans;

int main()
{
    ans = INF;
    scanf("%d%d%d", &a, &b, &c);
    for (int i = 1; i <= 100; i++)
    {
        int dis1 = abs(i - a);
        int dis2 = abs(i - b);
        int dis3 = abs(i - c);
        int dis = dis1 + dis2 + dis3;
        ans = min(ans, dis);
    }
    printf("%d\n", ans);
    return 0;
}