Problem:


Score : 300 points

Problem Statement

Does \sqrt{a} + \sqrt{b} < \sqrt{c} hold?

Constraints

1 \leq a, b, c \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a \ b \ c

Output

If \sqrt{a} + \sqrt{b} < \sqrt{c}, print Yes; otherwise, print No.

Sample Input 1

2 3 9

Sample Output 1

No

\sqrt{2} + \sqrt{3} < \sqrt{9} does not hold.

Sample Input 2

2 3 10

Sample Output 2

Yes

\sqrt{2} + \sqrt{3} < \sqrt{10} holds.



Sample input:
2 3 9


Sample output:
No

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
left = (a+b-c)**2
right = 4*a*b
if right > left:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt
a,b,c = map(int, input().split())
print("Yes" if sqrt(a)+sqrt(b) < sqrt(c) else "No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
print('Yes' if 4*a*b < (c-a-b)**2 else 'No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal
a, b, c = map(Decimal, input().split())

if Decimal(math.sqrt(a))+Decimal(math.sqrt(b)) < Decimal(math.sqrt(c)):
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

a, b, c = map(int, input().split())
print('Yes' if a + b < c and sqrt(a) + sqrt(b) < sqrt(c) else 'No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

a, b, c = map(int, input().split())
print('Yes' if a + b < c else 'No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

a, b, c = map(int, input().split())
print('Yes' if sqrt(a) + sqrt(b) < sqrt(c) else 'No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

a, b, c = map(int, input().split())
print('Yes' if sqrt(2) + sqrt(3) < sqrt(c) else 'No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

a, b, c = map(int, input().split())
print('Yes' if (sqrt(2) + sqrt(3)) ** 2 < c else 'No')

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
res = c - b - a
if res*res - 4*a*b > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

a,b,c=map(int,input().split())

if sqrt(a)+sqrt(b)<sqrt(c):
	print("Yes")
    
else:
	print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
sahen = 2*pow(a*b,1/2)
uhen = abs(c-a-b)
if sahen < uhen:
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
sahen = 2*pow(a*b,1/2)
uhen = c-a-b
if sahen < uhen:
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
sahen = 4*a*b
uhen = (c-a-b)**2
if sahen < uhen:
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
if math.sqrt(a)+math.sqrt(b) < math.sqrt(c):
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
p = 4*a*b
q = c-a-b
if q*q > p:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
p = 2*math.sqrt(a*b)
if c > a + b + p:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())

if c-a-b==0:
    print('No')
elif c-a-b>0:
    if 4*a*b < (c-a-b)**2:
        print('Yes')
    else:
        print('No')
else:
    if 4*a*b > (c-a-b)**2:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())

print('Yes' if (c-a-b)**2>4*a*b  else 'No')

Submission status: Wrong Answer

Solution code:
import math as m
def int_sqrt(n):
  def f(prev):
    while True:
      m = (prev + n / prev) / 2
      if m >= prev:
        return prev
    prev = m 
  return f(int(m.sqrt(n) * (1 + 1e-10)))
 
if __name__ == "__main__":
  a,b,c = map(int,input().split())
  if(c-a-b > 2*int_sqrt(a*b)):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math as m
def int_sqrt(n):
  def f(prev):
    while True:
      m = (prev + n / prev) / 2
      if m >= prev:
        return prev
    prev = m 
  return f(int(m.sqrt(n) * (1 + 1e-10)))
 
if __name__ == "__main__":
  a,b,c = map(int,input().split())
  if(int_sqrt(a)+int_sqrt(b) < int_sqrt(c)):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
def int_sqrt(n):
  def f(prev):
    while True:
      m = (prev + n / prev) / 2
      if m >= prev:
        return prev
      prev = m    
  return f(n)
 
if __name__ == "__main__":
  a,b,c = map(int,input().split())
  if(int_sqrt(a * (1 + 1e-10))+int_sqrt(b * (1 + 1e-10)) < int_sqrt(c * (1 + 1e-10))):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
def int_sqrt(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m    
    return f(n)

if __name__ == "__main__":
  a,b,c = map(int,input().split())
  if(int_sqrt(a)+int_sqrt(b) < int_sqrt(c)):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math as m
a,b,c = map(int,input().split())
 
if(int(m.sqrt(a))+int(m.sqrt(b)) < int(m.sqrt(c))):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math as m
a,b,c = map(int,input().split())
 
if(m.sqrt(a)+m.sqrt(b) < m.sqrt(c)):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
 
if(a+b < c):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())

if(pow(a,2)+pow(b,2) < pow(c,2)):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():
    a, b, c = in_nn()

    t1 = c - (a + b)
    t2 = 4 * a * b

    if t1 < 0:
        t1 = t1**2
        if t1 < t2:
            print('Yes')
        else:
            print('No')
    else:
        t1 = t1**2
        if t2 < t1:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():

    a, b, c = in_nn()

    t1 = c - (a + b)

    if t1 < 0:
        print('No')
    t1 = t1 * t1

    t2 = 4 * a * b

    if t2 < t1:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():

    a, b, c = in_nn()

    t1 = c - (a + b)
    t1 = t1 * t1

    t2 = 4 * a * b

    if t2 < t1:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[5]:


a,b,c = map(int, input().split())


# In[6]:


x = c-(a+b)
y = 4*a*b
if x**2 > y:
    print("Yes")
else:
    print("No")


# In[ ]:

Submission status: Wrong Answer

Solution code:
a,b,c=map(int, input().split())

if 4*a*b < (c-a-b)**2:
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

Solution code:
a, b, c = [int(_) for _ in input().split()]

if 4 * a * b < (c - b - a) ** 2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())

if (c - a - b) ** 2 > 4 * a * b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())

if (c - (a + b)) ** 2 > 4 * a * b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if (c-a-b)**2 > 4*a*b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if c-a-b-2*(a*b)**0.5>0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
if 2*math.sqrt(a*b)<c-a-b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(int, input().split())

if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=map(int, input().split())
if 4*a*b<(c-a-b)**2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=map(float, input().split())
if (a+b+2*sqrt(a*b)-c)**10<1>>40:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=map(float, input().split())
if a+b+2*sqrt(a*b)-c<1>>40:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=map(float, input().split())
if a+b+2*sqrt(a*b)-c<10**(-20):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=map(float, input().split())
if sqrt(a)+sqrt(b)-sqrt(c)<10**(-20):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=map(float, input().split())
if sqrt(a)+sqrt(b)-sqrt(c)<10**(-10):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=nm()

if (sqrt(a*10**10)+sqrt(b*10**10))<sqrt(c*10**10):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=nm()

if (sqrt(a*10**10)+sqrt(b*10**10))<sqrt(c)*10**10:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=nm()

if (sqrt(a)+sqrt(b))*10**10<sqrt(c)*10**10:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=nm()

if sqrt(a)+sqrt(b)<sqrt(c):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=nm()

if c-a-b-2*sqrt(a*b)>0.0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import sqrt

a,b,c=nm()

if c-a-b-2*sqrt(a*b)>0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())

if a*b < (c - a - b) ** 2 and a + b < c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())

if a*b < (c - a - b) ** 2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np

l = list(map(int, input().split()))
a = l[0]
b = l[1]
c = l[2]

if (np.sqrt(a)+np.sqrt(b)<np.sqrt(c)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
if a + b - c + 2*math.sqrt(a*b) < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a ** 0.5 + b ** 0.5 < c ** 0.5:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import sys

a, b, c = map(int, input().split())
if (2*math.sqrt(a*b) < c - a - b):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

a,b,c = map(int,input().split())

if 4*a*b < (c-a-b)**2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
from math import sqrt
a,b,c = map(Decimal, input().split())

t = 10**9
if sqrt(a)*t + sqrt(b)*t < sqrt(c)*t:
  print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
import math

a,b,c = map(int,input().split())

if a+b+(2*math.sqrt(a)*math.sqrt(b)) < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
from math import sqrt
a,b,c = map(Decimal, input().split())

if sqrt(a) + sqrt(b) < sqrt(c): print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
import math

a,b,c = map(int,input().split())

a = math.sqrt(a)
b = math.sqrt(b)
c = math.sqrt(c)

if a+b < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:

def main():
 a,b,c = map(int,input().split())
 lhs = a + b - c 
 rhs = 4 * a * b
 if lhs > 0  and lhs ** 2 < rhs:
  print('Yes')
 else:
  print('No')
main()

Submission status: Wrong Answer

Solution code:

def main():
 a,b,c = map(int,input().split())
 lhs = a ** 2 + b ** 2 - c ** 2
 rhs = 4 * a * b
 if lhs > 0  and lhs ** 2 < rhs:
  print('Yes')
 else:
  print('No')
main()

Submission status: Wrong Answer

Solution code:

def main():
 a,b,c = map(int,input().split())
 lhs = a ** 2 + b ** 2 - c ** 2
 rhs = 4 * a * b
 if lhs > 0  and lhs < rhs:
  print('Yes')
 else:
  print('No')
main()

Submission status: Wrong Answer

Solution code:
import decimal
def main():
 a,b,c = map(int,input().split())
 a = (decimal.Decimal)(a ** 0.5)
 b = decimal.Decimal(b ** 0.5)
 c = decimal.Decimal(c** 0.5)
 if a + b < c:
  print('Yes')
 else:
  print('No')
main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    a, b, c = [int(x) for x in input().split()]
    if a**0.5 + b**0.5 + 1e-14 < c**0.5:
        print("Yes")
    else:
        print("No")
    

        
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

7
3 1
4 1
5 9
2 6
5 3
5 8
9 7 5

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    a, b, c = [int(x) for x in input().split()]
    if a**0.5 + b**0.5 < c**0.5:
        print("Yes")
    else:
        print("No")
    

        
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

7
3 1
4 1
5 9
2 6
5 3
5 8
9 7 5

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    a, b, c = [int(x) for x in input().split()]
    if (sqrt(a) + sqrt(b))**2 < sqrt(c)**2:
        print("Yes")
    else:
        print("No")
    

        
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

7
3 1
4 1
5 9
2 6
5 3
5 8
9 7 5

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    a, b, c = [int(x) for x in input().split()]
    if round(sqrt(a),4) + round(sqrt(b),4) < round(sqrt(c),4):
        print("Yes")
    else:
        print("No")
    

        
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

7
3 1
4 1
5 9
2 6
5 3
5 8
9 7 5

"""

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    a, b, c = [int(x) for x in input().split()]
    if sqrt(a) + sqrt(b) < sqrt(c):
        print("Yes")
    else:
        print("No")
    

        
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

7
3 1
4 1
5 9
2 6
5 3
5 8
9 7 5

"""

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(int, input().split())

ar = math.sqrt(a)
br = math.sqrt(b)
cr = math.sqrt(c)

if ar + br < cr:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

A, B, C = map(int,input().split())

a = Decimal(A**0.5)
b = Decimal(B**0.5)
c = Decimal(C**0.5)

if a + b < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import *
from decimal import *
a,b,c=map(int,input().split())
if 4*a*b<(c-a-b)**2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import *
from decimal import *
a,b,c=map(int,input().split())
if Decimal( a**2+ b**2+2*a*b+4*(a+b)*sqrt(a*b))<Decimal(c**2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import *
from decimal import *
a,b,c=map(int,input().split())
if Decimal( a**2+ b**2+2*a+2*b+2*sqrt(a)*sqrt(b))<Decimal(c**2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import *
from decimal import *
a,b,c=map(int,input().split())
if Decimal( Decimal(a**(1/2))+ Decimal(b**(1/2)))<Decimal(c**(1/2)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import *
from decimal import *
a,b,c=map(int,input().split())
if Decimal( Decimal(sqrt(a))+ Decimal(sqrt(b)))<Decimal(sqrt(c)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import *
from decimal import *
a,b,c=map(int,input().split())
if Decimal(sqrt(a)+sqrt(b))<Decimal(sqrt(c)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd, fsum
from functools import lru_cache, reduce
from decimal import Decimal, getcontext
from operator import mul

INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)


# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

# 組合せnCr
def combinations_count(n, r):
    if n < r:
        return 0
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# 素数判定
def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True


# limit以下の素数を列挙
def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P

# 同じものを含む順列
def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        # set（集合）型で重複を削除、ソート
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]



# ここから書き始める
getcontext().prec = 100

a, b, c = map(int, input().split())
a_sqrt = Decimal(str(sqrt(a)))
b_sqrt = Decimal(str(sqrt(b)))
c_sqrt = Decimal(str(sqrt(c)))
# print(a_sqrt)
if fsum([a_sqrt, b_sqrt]) < c_sqrt:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
from decimal import Decimal, getcontext
from operator import mul

INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)


# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

# 組合せnCr
def combinations_count(n, r):
    if n < r:
        return 0
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# 素数判定
def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True


# limit以下の素数を列挙
def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P

# 同じものを含む順列
def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        # set（集合）型で重複を削除、ソート
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]



# ここから書き始める
getcontext().prec = 100

a, b, c = map(int, input().split())
a_sqrt = Decimal(str(sqrt(a)))
b_sqrt = Decimal(str(sqrt(b)))
c_sqrt = Decimal(str(sqrt(c)))
# print(a_sqrt)
if a_sqrt + b_sqrt < c_sqrt:
    print("Yes")
else:
    print("No")