Commentator problem

最新推荐文章于 2022-03-06 21:43:19 发布

Liuxf13

最新推荐文章于 2022-03-06 21:43:19 发布

阅读量105

点赞数

文章标签：其他

原文链接：https://codeforces.com/contest/2/problem/C

版权

描述：

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.

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.

输入：

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.

输出：

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

描述：

Bercouver奥运会正在全力展开，在这里每个人都有他们自己的目标：运动员们为了奖牌而比赛，体育评论员们为了能够在更加便利的位置上进行实况解说而努力。现如今这些主要的体育赛事在三个圆形体育场内举办，并且评论员的任务是去挑选最佳的观察点，意思是一个可以观察到三个体育场的点。因为所有的体育比赛都是同等重要的，所以体育场的观赛角度应该是一致的。如果满足条件的点数超过一个，则优先选择观测角度最大的点。

请你帮助伯兰著名的评论员G. Berniev找出最佳的观察点。值得注意的是，各场馆之间并不相互掩盖，评论员可以轻松地从另一个体育场看过去。