1.22 Commentator problem

https://acs.jxnu.edu.cn/problem/CF2Chttps://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.

Bercouver奥运会正在如火如荼的进行。每个人都有自己的目标:运动员在为奖牌而竞争,运动评论员在为更方便的观察位置从而给跑步评价而竞争。今天主要的运动项目在三个圆形的体育馆举行,并且观察员的任务是选择最佳的观察位置,那就意味着三个体育馆都要被观察到。因为所有竞争者都是同等重要,所有体育馆都要从同一个角度被观察到。如果观察点有多个,观察角度最大的最好。

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.

请你帮助Berland著名的观察员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.

输入包括3行,每一行都描述了一个体育馆的位置。每行有3个数x,y,r,(x,y)表示的是体育馆的中心位置(-103<=x,y<=103),(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.

输出观察点的坐标,并保留5位小数点。如果没有答案坐标,则不需要输出。输出数据用空格隔开。

样例输入:

0 0 10
60 0 10
30 30 10

样例输出:

30.00000 0.00000
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值