codeforces723AThe New Year: Meeting Friends+水题
来源:互联网 发布:python电影推荐系统 编辑:程序博客网 时间:2024/05/29 18:22
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.
水题:给出x轴上3个点,求一个点到3个点距离最小。数据很小,直接暴力枚举就好了。
#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<algorithm>#include<cstdlib>#include<queue>#include<vector>#include<map>#include<stack>#include<set>#define pi acos(-1.0)#define EPS 1e-6 //log(x)#define e exp(1.0); //2.718281828#define mod 1000000007#define INF 0x7fffffff#define inf 0x3f3f3f3ftypedef long long LL;using namespace std;int main(){ int x[5]; scanf("%d %d %d",&x[0],&x[1],&x[2]); sort(x,x+3); int ans=inf; for(int i=x[0];i<=x[2];i++){ ans=min(ans,abs(i-x[0])+abs(i-x[1])+abs(i-x[2])); } cout<<ans<<endl; return 0;}
- codeforces723AThe New Year: Meeting Friends+水题
- [codeforces]A. The New Year: Meeting Friends 水题
- Codeforces723 A. The New Year: Meeting Friends (水题)
- A. The 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 723A The New Year: Meeting Friends
- 【69.77%】【codeforces 723A】The New Year: Meeting Friends
- Codeforces — 723A. The New Year: Meeting Friends
- The New Year: Meeting Friends Codeforces Round#375-A
- Codeforce 723A - The New Year: Meeting Friends
- CodeForces 723A he 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 Round #375 (Div. 2) A-The New Year: Meeting Friends
- codeforces——723A—— The New Year: Meeting Friends
- CSS Positioning(定位)
- 枚举类
- Oracle视图view
- Ubuntu学习笔记一
- POJ - 2584(二分匹配入门)
- codeforces723AThe New Year: Meeting Friends+水题
- 矩阵快速幂入门 + 求Fibonacci数列
- iOS全局返回按钮定制问题解决方案
- 操作系统(8)--并发性学习笔记
- mysql使用问题
- codeforces#375(div.2)723D - Lakes in Berland dfs+bfs
- 利用mathematica制作二维码
- Linux洗C语言基础编程——折半查找法
- poj 2096 Collecting Bugs【概率dp 逆向求期望】