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:
from decimal import Decimal

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

r_ab=Decimal(str((a*b)**0.5))
s=Decimal(str((c-a-b)/2))

print("Yes" if r_ab < s else "No")

Submission status: Wrong Answer

Solution code:
in_list = list(map(int,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
if (2*b*c + 2*c*a) < (c*c + a*a + b*b - 2*a*b):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
a,b,c = map(int,input().split())
routeA = pow(a,0.5)
routeB = pow(b,0.5)
routeC = pow(c,0.5)

if routeA + routeB > routeC or Decimal(routeA) + Decimal(routeB) == Decimal(routeC):
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

import math
left = 2*math.sqrt(a*b)
right = c-(a+b)

print('Yes') if left<right else print('No')

Submission status: Wrong Answer

Solution code:
import math
abc = input()
abc = abc.split(' ')
a = int(abc[0])
b = int(abc[1])
c = int(abc[2])

if math.sqrt(a)+math.sqrt(b)<math.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 + 2 * math.sqrt(a*b) < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

s = math.sqrt(a)/math.sqrt(c)
t = math.sqrt(b)/math.sqrt(c)

if (s+t)<1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
import fractions
import decimal

a,b,c=map(float, input().split())
# if(a>=c or b>=c):
#     print("No")
# elif(a**0.5+b**0.5 < c**0.5):
#     print("Yes")
# else:
#     print("No")
if((a+b)*2>c):
    if(c>10**5):
        print("Yes")
    else:
        print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b,c = inpl()
x = round(math.sqrt(a*b),6)*2+a+b-c
if x <= 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

import math
ketaa = len(str(a))
fa=0.0
fbai=0
if ketaa >= 8:
      fbai=10**7
      fa=float(a/(10**7))
elif ketaa >= 6:
        fbai=10**5
        fa=float(a/(10**5))
else: 
        fbai=1
        fa=float(a)        

tmpRa = math.sqrt(fa) * fbai

ketaa = len(str(b))
fa=0.0
fbai=0
if ketaa >= 8:
      fbai=10**7
      fa=float(b/(10**7))
elif ketaa >= 6:
        fbai=10**5
        fa=float(b/(10**5))
else: 
        fbai=1
        fa=float(b)        

tmpRb = math.sqrt(fa) * fbai

ketaa = len(str(c))
fa=0.0
fbai=0
if ketaa >= 8:
      fbai=10**7
      fa=float(c/(10**7))
elif ketaa >= 6:
        fbai=10**5
        fa=float(c/(10**5))
else: 
        fbai=1
        fa=float(c)        

tmpRc = math.sqrt(fa) * fbai

ab = tmpRa + tmpRb

if ab < tmpRc:
    print("YES")
else: print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

a, b, c = map(int, read().split())
if a + b - c > 0:

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
try:
    a,b,c=map(int,input().split())
    a=a**0.5
    b=a**0.5
    c=c**0.5
    if a+b<c:
        print('Yes')
    elif a+b>=c:
        print('No')
    else:
        pass
except EOFError:
    pass

Submission status: Wrong Answer

Solution code:
import math
a,b,c = (int(x) for x in input().split())
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
  print("Yes\n")
else:
  print('No\n')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if(r>=0):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
a,b,c=map(int, input().split())
def nroot(a_, n, x=1.0, eps=1e-10):
    while abs(a_ - x**n) > eps:
        x = ( (n-1)*x + a_/(x**(n-1)) ) / n
    return x


a = np.array(a,dtype= 'float128')
b = np.array(b,dtype= 'float128')
c = np.array(c,dtype= 'float128')

#print(nroot(a_ = 3,n=2,x=a))
#print(math.sqrt(a))
#print(a**0.5)
#print(np.sqrt(a))
#print(np.sqrt(a)*np.sqrt(a))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a,b,c = (int(x) for x in input().split())

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
abc = input()
a, b, c = int(abc.split()[0]), int(abc.split()[1]), int(abc.split()[2])
# ab2 = a + b + 2*sqrt(a*b)
# print(sqrt(a))
# print(sqrt(b))
# print(sqrt(c))
if  a + b + 2*sqrt(a*b) - c < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
sys.maxsize = 10**300
a, b, c = map(int, input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 1000
import math

words = lambda t : list(map(t, input().split()))
a,b,c = words(int)

at = Decimal(a).sqrt()
bt = Decimal(b).sqrt()
ct = Decimal(c).sqrt()
for i in range(1,math.ceil(math.sqrt(max(a,b,c)))+100):
    if i**2 == a:
        at = i
    if i**2 == b:
        bt = i
    if i**2 == c:
        ct = i

if at + bt < ct:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

check_1 = 4*a*b < (c-a-b)**2
check_2 = 4*a*c < (c+a-b)**2
check_3 = 4*b*c < (c+b-a)**2

print('Yes' if check_1&check_2&check_3 else 'No')

Submission status: Wrong Answer

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

if (float(int(a)**(1/2)) + float(int(b)**(1/2))) < float(int(c)**(1/2)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
a, b, c = list(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:
a, b, c = map(int,input().split(' '))
hidari = a**(1/2) + b**(1/2)
if hidari < c**(1/2):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
K = a**(1/2)+b**(1/2)
L = c**(1/2)
if K<L:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
import numpy

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')
elif (a + b) > c:
    print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c=map(int,input().split())
a=np.array(a)
b=np.array(b)
c=np.array(c)
a=float(a)
b=float(b)
c=float(c)
#a=a.astype(np.float128)
#b=b.astype(np.float128)
#c=c.astype(np.float128)
d=a*b
if c-(a+b+2*(d**0.5))>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from decimal import *

rline = sys.stdin.readline


def solve():
    a, b, c = input().split()
    getcontext().prec = 300
    print(Decimal.sqrt(Decimal(a)))
    if Decimal.sqrt(Decimal(a)) + Decimal.sqrt(Decimal(b)) < Decimal.sqrt(Decimal(c)):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
# c.py
import math
a, b, c = map(int, input().split())
if  a + b + math.floor(math.sqrt(4 * a * b) * 100) / 100 < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
in_list = list(map(int,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
if (2*a*b + 2*b*c + 2*c*a) < (c*c + a*a + b*b):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if v<u:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:

import sys
import math
import fractions
import bisect
import queue
import heapq
import collections
import itertools
sys.setrecursionlimit(4100000)

MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18

'''
1行のint=====================================
N, K = map(int, input().split())
N, M = map(int, input().split())
A, B = map(int, input().split())

H, W = map(int, input().split())

L, R = map(int, input().split())

1行のstring=================================
S, T = input().split()

1行の整数配列================================
P = list(map(int,input().split()))

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

L = list(map(int,input().split()))
R = list(map(int,input().split()))

T = list(map(int,input().split()))

改行あり整数==================================
X = []
Y = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    X.append(x1)
    Y.append(y1)

A = []
for i in range(N):
    a=int(input())
    A.append(a)

Pair = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    Pair.append((x1, y1))
    
2次元整数配列=====================================
A = []
for i in range(N):
    tmp = list(map(int,input().split()))
    A.append(tmp)


N行M列の初期化====================================
dp = [[VAL] * RETU for i in range(GYO)]

'''


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

eps = 0.00001

if(A + B - C + 2* math.sqrt(A*B) < - eps):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = [int(x) for x in input().split()]

def nroot(a, n, x=1.0, eps=1e-7, cnt_max=500):
    cnt = 0
    while abs(a - x**n) > eps and cnt <= cnt_max:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
        cnt += 1
    return x

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
print(a,b,c)
left=(a*a)+math.sqrt(2*a*b)+(b*b)
right=c*c

if left<right:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from decimal import *
ctx = getcontext()
ctx.prec = 30
A, B, C = map(Decimal, map(int, input().split(' ')))
print('Yes' if (ctx.add(ctx.sqrt(A), ctx.sqrt(B))<ctx.sqrt(C)) else 'No')

Submission status: Wrong Answer

Solution code:
import math
L = input().split()

l = [ int(n) for n in L ]

a = l[0]
b = l[1]
c = l[2]


# ans = math.sqrt(a) +math.sqrt(b) - math.sqrt(c)
# ans = a + b -c +2*math.sqrt(a*b)
# ans = a**2 + b **2 + c **2 -2*a*b -2*b*c-2*a*c 

ans = (a-b)**2 + (b-c)**2 + (c-a)**2 - b**2 -c**2 -a**2 

if ans > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

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

    if math.fsum([math.sqrt(a),math.sqrt(b)]) < math.sqrt(c):
        print("Yes")
    else:
        print("No")

main()

Submission status: Wrong Answer

Solution code:
arr = input().split()
a=int(arr[0])
b=int(arr[1])
c=int(arr[2])

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())

ab = int((a * b) ** 0.5)
    

if a + b + 2 * ab < c:
    if (a * b) ** 0.5 - ab >= 0.5:
        if a + b + 2 * ab +1 < c:
            print("Yes")
        else:
            print("No")
            
    else:
        print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, getcontext
getcontext().prec = 100
a,b,c = map(int,input().split())

if Decimal(c**0.5) - Decimal(a**0.5) - Decimal(b**0.5) > 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

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

a = Decimal(a)
b = Decimal(b)
c = Decimal(c)

d = Decimal(int(round(abs(c - a - b),0)))

if Decimal(4*a*b)< Decimal(d*d):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b,c = inpl()
x = round(math.sqrt(a*b),15)*2+a+b-c
if x <= 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

ab_root = math.sqrt(a * b)

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

Submission status: Wrong Answer

Solution code:
import sys
import math
def input(): return sys.stdin.readline().rstrip()

a, b, c = map(int, input().split())
print('Yes' if c-(a+b + 2*math.sqrt(a*b))>0 else 'No')

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c=map(int, input().split())
if (a/c)**2+(b/c)**2+2*np.sqrt(a*b/(c**2))<1:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

square_list = [i**2 for i in range(1, 10**5)]

def integer_squareroot(x):
    imin = 0
    imax = x
    while imin <= imax:
        imid = (imin + imax) // 2
        imid_squared = imid ** 2
        if imid_squared <= x:
            imin = imid + 1
        else:
            imax = imid - 1

    return imin - 1


A = list(map(int, input().split()))
for i in range(3):
    if A[i] in square_list:
        A[i] = integer_squareroot(A[i])
    else:
        A[i] = math.sqrt(A[i])

if A[0] + A[1] + 1e7 < A[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
a,b,c = [int(x) for x in stdin.readline().rstrip().split()]

if a**0.5+b**0.5<c**0.5:
    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) < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math as m

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

roota = m.sqrt(a)
rootb = m.sqrt(b)
rootc = m.sqrt(c)
ab = roota + rootb

if ab < rootc :
  print('Yes')
elif ab >= rootc :
  print('No')

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(int, input().split())
res1 = (c - (a + b)) ** 2
res2 = 4 * a * b

if res2 < res1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import decimal
import math

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

Submission status: Wrong Answer

Solution code:
import numpy

input = input().split()

a = numpy.sqrt(float(input[0]))
b = numpy.sqrt(float(input[1]))
c = numpy.sqrt(float(input[2]))
if a+b<c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

ra = str(math.sqrt(a / c))
rb = str(math.sqrt(b / c))

da = decimal.Decimal(ra)
db = decimal.Decimal(rb)

if da + db - decimal.Decimal("1.0") < decimal.Decimal("0.0"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=list(map(lambda i:int(i),input().split()))

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

Submission status: Wrong Answer

Solution code:
mi = lambda : map(int,input().split())

import math

a,b,c = mi()

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

Submission status: Wrong Answer

Solution code:
def f(b, x):
    return x**2 - b
def df(b, x):
    return 2 * x
    h = 1e-9
    return (f(b, x + h) - f(b, x)) / h

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

x = 1
while True:
    xnew = x - f(a, x) / df(a, x)
    if abs(xnew - x) < 1e-6:
        break
    x = xnew
    
y = 1
while True:
    ynew = y - f(b, y) / df(b, y)
    if abs(ynew - y) < 1e-6:
        break
    y = ynew
    
z = 1
while True:
    znew = z - f(c, z) / df(c, z)
    if abs(znew - z) < 1e-6:
        break
    z = znew

if x + y < z:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

x = 4 * a * b
y = (c - a - b) ** 2

if x < y:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
print('AC')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
try:
    a,b,c=map(int,input().split())
    a=a**0.5
    b=a**0.5
    c=c**0.5
    if a+b<c:
        print("Yes")
    elif a+b>=c:
        print("No")
    else:
        pass
except EOFError:
    pass

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = [int(x) for x in input().split()]

def nroot(a, n, x=1.0, eps=1e-7, cnt_max=20):
    cnt = 0
    while abs(a - x**n) > eps and cnt <= cnt_max:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
        cnt += 1
    return x

if nroot(a, 2, math.sqrt(a)) + nroot(b, 2, math.sqrt(b)) < nroot(c, 2, 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())
if (sqrt(a) + sqrt(b))**2 < c:
    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:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
# import heapq
# import math
# from collections import defaultdict, Counter, deque
# from bisect import *
# import itertools
# import fractions
# # import sys
# sys.setrecursionlimit(10 ** 7)
# MOD = 10 ** 9 + 7
# input = sys.stdin.readline


# def lcm(a, b):
#     return a * b / fractions.gcd(a, b)


# def make_divisors(n):
#     divisors = []
#     for i in range(1, int(n**0.5)+1):
#         if n % i == 0:
#             divisors.append(i)
#             if i != n // i:
#                 divisors.append(n//i)

#     # divisors.sort()
#     return divisors


# def factorize(n):
#     fct = []  # prime factor
#     b, e = 2, 0  # base, exponent
#     while b * b <= n:
#         while n % b == 0:
#             n = n // b
#             e = e + 1
#         if e > 0:
#             fct.append((b, e))
#         b, e = b + 1, 0
#     if n > 1:
#         fct.append((n, 1))
#     return fct


# def is_prime(n):
#     if n == 1:
#         return False

#     for k in range(2, int(math.sqrt(n)) + 1):
#         if n % k == 0:
#             return False

#     return True


# def primes(n):
#     is_prime = [True] * (n + 1)
#     is_prime[0] = False
#     is_prime[1] = False
#     for i in range(2, int(n**0.5) + 1):
#         if not is_prime[i]:
#             continue
#         for j in range(i * 2, n + 1, i):
#             is_prime[j] = False
#     return [i for i in range(n + 1) if is_prime[i]]

# def modpow(a, n, mod):
#     res = 1
#     while n > 0:
#         if n & 1:
#             res = res * a % mod
#         a = a * a % mod
#         n >>= 1
#     return res


# def modinv(a, mod):
#     return modpow(a, mod - 2, mod)


# def cnk(a, b):
#     MOD = 10**9+7
#     ret = 1
#     for i in range(b):
#         ret *= (a-i)
#         ret %= MOD
#         ret = ret * modinv(i+1, MOD) % MOD
#     return ret


# class UnionFind:
#     def __init__(self, n):
#         self.sz = [-1 for i in range(n)]

#     # 検索
#     def find(self, x):
#         if self.sz[x] < 0:
#             return x
#         else:
#             self.sz[x] = self.find(self.sz[x])
#             return self.sz[x]

#     # 併合
#     def union(self, x, y):
#         x = self.find(x)
#         y = self.find(y)
#         if x == y:
#             return False
#         if self.sz[x] > self.sz[y]:
#             x, y = y, x
#         self.sz[x] += self.sz[y]
#         self.sz[y] = x

#     # 同じ集合に属するか判定
#     def same(self, x, y):
#         return self.find(x) == self.find(y)

#     # xが含まれている集合のサイズを求める
#     def size(self, x):
#         return -self.sz[self.find(x)]

# class WeightedUnionFind:
#     def __init__(self, n):
#         self.par = [i for i in range(n+1)]
#         self.rank = [0] * (n+1)
#         # 根への距離を管理
#         self.weight = [0] * (n+1)

#     # 検索
#     def find(self, x):
#         if self.par[x] == x:
#             return x
#         else:
#             y = self.find(self.par[x])
#             # 親への重みを追加しながら根まで走査
#             self.weight[x] += self.weight[self.par[x]]
#             self.par[x] = y
#             return y

#     # 併合
#     def union(self, x, y, w):
#         rx = self.find(x)
#         ry = self.find(y)
#         # xの木の高さ < yの木の高さ
#         if self.rank[rx] < self.rank[ry]:
#             self.par[rx] = ry
#             self.weight[rx] = w - self.weight[x] + self.weight[y]
#         # xの木の高さ ≧ yの木の高さ
#         else:
#             self.par[ry] = rx
#             self.weight[ry] = -w - self.weight[y] + self.weight[x]
#             # 木の高さが同じだった場合の処理
#             if self.rank[rx] == self.rank[ry]:
#                 self.rank[rx] += 1

#     # 同じ集合に属するか
#     def same(self, x, y):
#         return self.find(x) == self.find(y)

#     # xからyへのコスト
#     def diff(self, x, y):
#         return self.weight[x] - self.weight[y]


class manacher:

    def __init__(self, l):
        self.n = len(l)
        self.m = 2*self.n+1
        self.d = ['&']*self.m
        self.r = [0]*self.m
        for i in range(self.n):
            self.d[2*i+1] = l[i]
        self.make_r()

    def make_r(self):
        i, j = 0, 0
        while i < self.m:
            while j <= i < self.m-j and self.d[i-j] == self.d[i+j]:
                j += 1
            self.r[i] = j
            k = 1
            while k <= i < self.m-k and k+self.r[i-k] < j:
                self.r[i+k] = self.r[i-k]
                k += 1
            i += k
            j -= k

    def judge(self, start, end):
        center = start+end
        return 2 * end - 1 < center + self.r[center]


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

    left = 4 * a * b
    right = (c - a - b)** 2
    if a == 1 and b == 1 and c == 2:
        print("No")
        exit()

    if left < right:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
mod = 10**9 + 7

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))


a, b, c = na()
if a * (a - 2*b) + b*(b-2*c) + c*(c-2*a) > 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import math


def main():

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    a, b, c = map(int, input().split())
    if a + b + c + 2 * (a * b) ** (1 / 2) - 2 * (a * c) ** (1 / 2) - 2 * (b * c) ** (1 / 2) < 0:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
in_list = list(map(int,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
if 2*a*b + 2*b*c + 2*c*a < c*c + a*a + b*b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
from math import sqrt
mod=10**9+7
a,b,c=map(int, input().split())


#if sqrt(a)+sqrt(b)<sqrt(c):
if (((a+b-c)%mod)**2)%mod<4*((a*b)%mod)%mod:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
# import math
# sqrt = math.sqrt

# def int_sqrt2(n):
#     def f(prev):
#         while True:
#             m = (prev + n / prev) / 2
#             if m >= prev:
#                 return prev
#             prev = m
    
#     return f(int(sqrt(n) * (1 + 1e-20)))

# from decimal import *

# getcontext().prec = 20      # デフォルト28桁のところを20桁にする
# m = int(Decimal(n).sqrt())
# print m ** 2 - n            # -2222221948

def linput():
    return list(map(int, input().split()))

def gcd(n,m):
    while m:
        n,m = m, n%m
    return n

def lcm(n,m):
    return n*m//gcd(n,m)


def main():
    # N = int(input())
    A,B,C = linput()
    # vA = linput()
    # S = input()
    # mX = [linput() for _ in [0,]*N]

    # res = 0
    # res = -(-N//M)

    # LH = A**.5 + B**.5
    # RH = C**.5

    # rtAB = int(Decimal(A*B).sqrt())
    # rtAB = int_sqrt2(A*B)

    LH = A * B * 4
    RH = (C-A-B)**2

    res = ("No","Yes")[-RH < LH < RH]

    print(res)

main()

Submission status: Wrong Answer

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