Commentator problem
题目(https://acs.jxnu.edu.cn/problem/CF2C)描述:
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
翻译:
奥林匹克运动会正火热进行中。这里的每个人都有他们的目的:运动员竞争奖牌,评论员争夺方便的位置去进行跑步解说。今天主要的比赛在三个圆形体育馆进行,评论员的任务就是去选择最好的观望点(可以看到三个体育馆)。因为比赛都是同样重要的,体育观被看起来应该是以同样的角度。如果符合要求的观望点不止一个,那么角度最大的观望点最好。
请你帮助著名的波兰评论员 G. Berniev找到最好的观望点。值得注意的是,体育馆间不会相互遮挡,评论员可以轻松的从一个体育馆看到另一个体育馆。
输入:
输入有三行,每行表示一个体育馆的坐标。一行由x,y,r组成,x,y表示体育馆中心坐标( - 103 ≤ x, y ≤ 103), r表示体育馆半径 (1 ≤ r ≤ 103) 。所有的数字都是整数,体育馆的坐标都不同,他们的中心不会再同一条直线上。
输出:
输出观望点的坐标,保留五位小数。如果没有符合条件的点,不打印任何东西。数字间用一个空格隔开。
样例输入:
0 0 10
60 0 10
30 30 10
样例输出:
30.00000 0.00000