当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1791:Where is the little Jgshining?

题目描述
When Jgshining is a baby, he already showed his high intelligence. For example ,when somebody asked him“Who do you love, Dad? Mom?”,He always answered:“Both!”.When he stayed together with Mom, Dad and brother, he always selects a position from where it is the same distance to all three people. Now, you are given the positions of dad, mom and brother, please print the point where Jgshining will select?
If there is no this kind of position, please output “No this position”, otherwise, you should print this point.
输入解释
Input contains an integer N in the first line, which indicates the number of test data. And then N lines follow. Each line consists of three pairs of numbers xi and yi, separated by a space.
输出解释
For each test data you should output the point where Jgshining will select,please output the point which has minimal distance from three people if more than one point satisfy the question. One line per case.
输入样例
2
0 0 1 0 0 1
0 0 1 0 2 0
输出样例
0.5 0.5
No this position
来自杭电HDUOJ的附加信息
Author lcy
Recommend lcy

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1791

最后修改于 2020-10-25T22:47:47+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000/1000MS(Java/Others) 32768/32768K(Java/Others)