翻译练习 Day6
2022/1/22 23:06:10
本文主要是介绍翻译练习 Day6,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
题目:Commentator problem | JXNUOJ
翻译:
Commentator problem
1000ms 65536K
描述:
The Olympic Games in Bercouver are in full swing now. Here everyone has their own objectives: sportsmen compete for medals, and sport commentators compete for more convenient positions to give a running commentary. Today the main sport events take place at three round stadiums, and the commentator's objective is to choose the best point of observation, that is to say the point from where all the three stadiums can be observed. As all the sport competitions are of the same importance, the stadiums should be observed at the same angle. If the number of points meeting the conditions is more than one, the point with the maximum angle of observation is prefered.
在伯库弗举行的奥运会正火热地进行着。在这里,每个人都有自己的目标:运动员为奖牌而竞争,体育评论员为更方便的位置进行连续评论而竞争。今天,主要的体育赛事在三个圆形体育场举行,解说员的目标是选择最好的观察点,也就是说,从那里可以观察到所有的三个体育场。由于所有的体育比赛都具有同等的重要性,所以体育场的观景角度应该是相同的。当满足条件的点数大于1时,优先选择观测角度最大的点。
Would you, please, help the famous Berland commentator G. Berniev to find the best point of observation. It should be noted, that the stadiums do not hide each other, the commentator can easily see one stadium through the other.
请你帮助著名的伯兰评论员G. Berniev找到一个最佳的观察点。需要指出的是,两个场馆之间并不相互隐藏,解说员可以很容易地通过场馆看到另一个。
输入:
The input data consists of three lines, each of them describes the position of one stadium. The lines have the format x, y, r, where (x, y) are the coordinates of the stadium's center ( - 103 ≤ x, y ≤ 103), and r (1 ≤ r ≤ 103) is its radius. All the numbers in the input data are integer, stadiums do not have common points, and their centers are not on the same line.
输入数据由三行组成,每一行描述一个体育场的位置。格式 x , y , r 。在( x , y )体育场中心的坐标是(- 103≤ x , y ≤103),和 r (1≤ r ≤103)是它的半径。输入的数据中所有的数字都是整数,体育场没有公共点,它们的中心也不在同一条线上。
输出:
Print the coordinates of the required point with five digits after the decimal point. If there is no answer meeting the conditions, the program shouldn't print anything. The output data should be left blank.
打印所需点的坐标,保留小数点后五位。如果没有满足条件的答案,程序不打印任何东西。输出数据应留空。
样例输入:
0 0 10 60 0 10 30 30 10
样例输出:
30.00000 0.00000
这篇关于翻译练习 Day6的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-11-23Springboot应用的多环境打包入门
- 2024-11-23Springboot应用的生产发布入门教程
- 2024-11-23Python编程入门指南
- 2024-11-23Java创业入门:从零开始的编程之旅
- 2024-11-23Java创业入门:新手必读的Java编程与创业指南
- 2024-11-23Java对接阿里云智能语音服务入门详解
- 2024-11-23Java对接阿里云智能语音服务入门教程
- 2024-11-23JAVA对接阿里云智能语音服务入门教程
- 2024-11-23Java副业入门:初学者的简单教程
- 2024-11-23JAVA副业入门:初学者的实战指南