CodeForces - 723A A. The New Year: Meeting Friends

最新推荐文章于 2020-04-17 22:30:42 发布

原创最新推荐文章于 2020-04-17 22:30:42 发布 · 379 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#codeforces

题解专栏收录该内容

79 篇文章

订阅专栏

三个朋友分别居住在直线上的不同位置，他们计划新年聚会。为了使总行走距离最短，需要找到一个相遇点。本篇介绍如何通过简单的算法找出这个最优位置。

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 pointx2, 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

解题思路：先排序，最大的到和最小的到中间路程就是最小

代码：

#include<cstdio>
int main(){
	int a,b,c,t;
	scanf("%d%d%d",&a,&b,&c);
	if(a>b){
		t=a;a=b;b=t;
	}
	if(a>c){
		t=a;a=c;c=t;
	} 
	if(b>c){
		t=b;b=c;c=t;
	}
	printf("%d",c-a);
	return 0;
}