Codeforce 723A - The New Year: Meeting Friends
来源:互联网 发布:淘宝怎么看卖家信用 编辑:程序博客网 时间:2024/06/04 17:53
Description
There are three friend living on the straight line Ox in Lineland. The first friend lives at the pointx1, the second friend lives at the pointx2, and the third friend lives at the pointx3. 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 integersx1, 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.
Sample Input
7 1 4
6
30 20 10
20
题意:在x轴上有3个点,使他们会于一点,求最短的距离。
因为最短的路程就是这条直线覆盖一遍,所以结果就是最大的减去最小的。
#include <cstdio>#include <algorithm>using namespace std;int main(){ int a, b, c; scanf("%d%d%d", &a, &b, &c); printf("%d\n", max(a, max(b, c)) - min(a, min(b, c))); return 0;}
- Codeforce 723A - The New Year: Meeting Friends
- A. The New Year: Meeting Friends
- Codeforces 723A The New Year: Meeting Friends
- 【69.77%】【codeforces 723A】The New Year: Meeting Friends
- Codeforces — 723A. The New Year: Meeting Friends
- Codeforces 723A-The New Year: Meeting Friends
- CodeForces 723A-The New Year: Meeting Friends(很水)
- [codeforces]A. The New Year: Meeting Friends 水题
- Codeforces723 A. The New Year: Meeting Friends (水题)
- The New Year: Meeting Friends Codeforces Round#375-A
- Codeforces 723A The New Year: Meeting Friends(题意有偏差的水题)
- codeforces——723A—— The New Year: Meeting Friends
- CodeForces 723A he New Year: Meeting Friends
- Codeforces The New Year: Meeting Friends
- 【Codeforces Round 375 (Div 2) A】【水题】The New Year Meeting Friends
- Codeforces Round #375 (Div. 2)A. The New Year: Meeting Friends(水题)
- Codeforces Round #375 (Div. 2) A-The New Year: Meeting Friends
- codeforces723AThe New Year: Meeting Friends+水题
- Linux下编写支持多线程的库
- Mysql 内连接、外连接、全连接和交叉连接
- jQuery UI 实例 - 自动完成(Autocomplete)
- Atitit RSA非对称加密原理与解决方案
- Swift中的required修饰符
- Codeforce 723A - The New Year: Meeting Friends
- Weiss-(DSAA - in C,2.12)最大子序列求和
- MySQL 之 count(*) 与 count(1)
- pyspark-combineByKey详解
- 工作总结23 tomcat启动不了项目原因
- Monkey测试批处理
- Android 中点击两次返回键才退出
- 使用Amoeba实现MySQL的主从读写分离
- Atitti.数字证书体系cer pfx attilax总结