欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1986A.X Axis
X Axis
You are given three points with integer coordinates , , and on the axis (). You can choose any point with an integer coordinate on the axis. Note that the point may coincide with , , or . Let be the total distance from the given points to the point . Find the smallest value of .
The distance between points and is equal to . For example, the distance between points and is .
Input
Each test consists of multiple test cases. The first line contains a single integer () — the number of test cases. Then follows their descriptions.
The single line of each test case contains three integers , , and () — the coordinates of the points.
Output
For each test case, output the smallest value of .
Note
In the first test case, the smallest value of is achieved when : .
In the second test case, the smallest value of is achieved when : .
In the third test case, the smallest value of is achieved when : .
In the fourth test case, the smallest value of is achieved when : .
Samples
8
1 1 1
1 5 9
8 2 8
10 9 3
2 1 1
2 4 1
7 3 5
1 9 4
0
8
6
7
1
3
4
8
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |