The New Year: Meeting Friends Codeforces Round#375-A
来源:互联网 发布:sql select where or 编辑:程序博客网 时间:2024/06/05 10:20
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
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.
一条直线上三点距离最短,那么肯定在最小和最大的之间,而最小点和最大点在中间相遇的距离是固定的,所以答案就是最大点减去最小点。
code:
import java.io.*;import java.util.*;public class Main {public static void main(String[] args) {Scanner sc=new Scanner(System.in);while(sc.hasNext()){int min=101;int max=-1;int a=sc.nextInt();if(a<min){min=a;}if(a>max){max=a;}int b=sc.nextInt();if(b<min){min=b;}if(b>max){max=b;}int c=sc.nextInt();if(c<min){min=c;}if(c>max){max=c;}int da=max-min;System.out.println(da);}}}
- The New Year: Meeting Friends Codeforces Round#375-A
- 【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
- [codeforces]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 The New Year: Meeting Friends
- A. The New Year: Meeting Friends
- Codeforces 723A The New Year: Meeting Friends(题意有偏差的水题)
- codeforces——723A—— The New Year: Meeting Friends
- CodeForces 723A he New Year: Meeting Friends
- Codeforces723 A. The New Year: Meeting Friends (水题)
- Codeforce 723A - The New Year: Meeting Friends
- codeforces723AThe New Year: Meeting Friends+水题
- 数据结构--求解最大公因子三个方法
- javascript中面向对象的程序设计——对象的创建
- Codeforces Gym 100548H The Problem to Make You Happy (图上博弈DP)
- Java数组
- Kindle DXG和Win10 64bits无法连接的问题
- The New Year: Meeting Friends Codeforces Round#375-A
- mvc框架留言框架实战之前端功能整理
- 反射程序集
- 【C/C++】对于可重入、线程安全、异步信号安全几个概念的理解
- MySQL 如何删除有外键约束的表数据
- Prototype_Level3
- 内存对齐
- 面向对象程序设计上机练习六(类和对象)
- 编译器错误处理系统