import math
EPS = 1e-6
dx = [1, -1, 0, 0]
dy = [0, 0, 1, -1]
class Node:
def __init__(self, x, y, r):
self.x = x
self.y = y
self.r = r
def dis(a, b):
return math.sqrt((a.x-b.x)**2 + (a.y-b.y)**2)
def check(p):
ret = 0
for i in range(1, 4):
ret += ((dis(p, c[i])/c[i].r - dis(p, c[(i+1)%3+1])/c[(i+1)%3+1].r) ** 2)
return ret
c = [None] * 4
p0 = Node(0, 0, 0)
for i in range(1, 4):
x, y, r = map(float, input().split())
c[i] = Node(x, y, r)
p0.x += x/3
p0.y += y/3
s = 1
while s > EPS:
flag = True
for i in range(4):
p = Node(p0.x+dx[i]*s, p0.y+dy[i]*s, 0)
if check(p) < check(p0):
p0.x += dx[i] * s
p0.y += dy[i] * s
flag = False
if flag:
s /= 2
if check(p0) < EPS:
print("{:.5f} {:.5f}".format(p0.x, p0.y))
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |