CodeForces
来源:互联网 发布:seo点击软件 编辑:程序博客网 时间:2024/06/14 06:44
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.
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.
Print one integer — the minimum total distance the friends need to travel in order to meet together.
7 1 4
6
30 20 10
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;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- vitrualbox Ubuntu10.04 Server安装增强功能
- HDOJ2467
- Spring笔记
- JavaWeb:报错信息The superclass "javax.servlet.http.HttpServlet" was not found on the Java Build Path
- WPS中为Grid控件添加边框
- CodeForces
- Spring与ActiveMQ整合
- 泛型小结
- hdu2818(带权并查集)
- 克鲁斯卡尔算法求最大/最小生成树
- 辗转相除法
- Pull解析方式
- Autowired 区别 Resource Spring中 @Autowired注解与@Resource注解的区别
- 教你彻底学会动态规划——入门篇