Codeforces 2C Commentator problem

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

DLNU-linglian

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

阅读量467

点赞数

分类专栏： Codeforces 文章标签：算法

本文链接：https://blog.csdn.net/linglian0522/article/details/71170082

版权

Codeforces 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

English

Desc

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.

Input

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.

Output

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.

Examples

input

0 0 10
60 0 10
30 30 10

output

30.00000 0.00000

中文

简介

Bercouver的奥运正在全面展开。这里每个人都有自己的目标：运动员竞争奖牌，运动评论员竞争更方便的职位，以提供有效的评论。今天的主要体育赛事是在三轮体育馆举行，评论员的目标是选择最好的观察点，也就是说可以观察所有三个体育场的地方。由于所有的运动比赛都具有同样的重要性，所以体育场应该以同样的角度（即每天体育馆的之间到观察点的距离都一样）观察。如果满足条件的点数超过一个，则具有最大观察角度的点被优先考虑。
请你帮助着名的Berland评论员G. Berniev找到最好的观察点。应该指出的是，体育馆不会相互隐藏，评论员可以很容易地看到一个体育场。

输入格式

输入数据由三条线组成，每行描述一个球场的位置(x,y,r)。
每行具有格式x， y， r ，其中（x， y）是体育场的中心的坐标（ - $10^3$ ≤ x， y ≤ & $10^3$ ），和 r （1 ≤ r ≤ $10^3$ ）是其半径。输入数据中的所有数字都是整数，体育馆没有共同点，他们的中心不在同一行。