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:
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:
a,b,c = map(int,input().split())
result = "No"
if 4*a*b < (c-a-b)**2:
    result = "Yes"

print(result)

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

a, b, c = map(int, input().split())
aa = Decimal(math.sqrt(a))
bb = Decimal(math.sqrt(b))
cc = Decimal(math.sqrt(c))

if aa + bb < cc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

a,b,c=map(int,input().split())
from decimal import *



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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, input().split())
mod = 10**5

def calc(x,y):
    x0 = x % mod
    x1 = x // mod
    y0 = y % mod
    y1 = y // mod
    ans0 = x0*y0 % mod
    ans1 = (x0*y0 // mod) + (x1*y0 % mod) + (x0*y1 % mod)
    ans2 = x1*y1 + ans1//mod
    ans1 = ans1 % mod
    return([ans2,ans1,ans0])

a_2 = calc(a,a)
b_2 = calc(b,b)
c_2 = calc(c,c)
ab = calc(2*a,b)
ac = calc(2*a,c)
bc = calc(2*b,c)

def calc2(x,y,z):
    ans = [0,0,0]
    for i in range(3):
        ans[i] = x[i] + y[i] + z[i]

    ans[1] += ans[2] // mod
    ans[0] += ans[1] // mod
    ans[1] = ans[1] % mod
    ans[2] = ans[2] % mod

    return(ans)

plus = calc2(a_2,b_2,c_2)
minus = calc2(ab, ac, bc)

for i in range(3):
    if(plus[i] > minus[i]):
        print('Yes')
        exit()
    elif(plus[i] < minus[i]):
        print('No')
        exit()


print('No')

Submission status: Wrong Answer

Solution code:
import math
def solve():
    a,b,c = map(int, input().split())
    if mySqrt(a) + mySqrt(b) < mySqrt(c):
        print('Yes')
    else:
        print('No')
    
def mySqrt(a, n=2, x=1.0, eps=1e-6):
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x
if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
getcontext().prec = 100
x = list(map(Decimal, input().split())) 
a = Decimal(x[0]).sqrt()
b = Decimal(x[1]).sqrt()
c = Decimal(x[2]).sqrt()

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
from decimal import *
getcontext().prec = 100000
if ((Decimal(c)-Decimal(a)-Decimal(b))**2)>(4*Decimal(a)*Decimal(b)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

ma = Decimal(str(a))
mb = Decimal(str(b))
mc = Decimal(str(c))

if math.sqrt(ma) + math.sqrt(mb) < math.sqrt(mc):
    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)
s=a+b
if s>=c:
    print('No')
else :
    print('Yes')

Submission status: Wrong Answer

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

if a + b +2*round(np.sqrt(a*b), 15) < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

from decimal import *

getcontext().prec = 300      # デフォルト28桁のところを20桁にする


A, B, C = input_int()

A = Decimal(A).sqrt()
B = Decimal(B).sqrt()
C = Decimal(C).sqrt()

C -= B
C -= A

if 0 < C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

x = 4 * a * b

y = (c - a - b) * (c - a - b)

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
N = list(map(int, input().split()))
l = 4*N[0]*N[1]
r = (N[2]-N[0]-N[1])**2
if l < r:
  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 pow(a + b - c, 2) >= 4 * (a * b):
    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:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(a: int, b: int, c: int):
    from math import sqrt, log10
    # from fractions import Fraction

    # fa = Fraction(sqrt(a)+sqrt(b), 20)
    # fc = Fraction(sqrt(c), 20)
    if round(sqrt(a)+sqrt(b), 10) < round(sqrt(c), 10):
    # if fa < fc:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a*b*4 < (c-a-b)**2:
    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")
print(a + b + 2*(a*b)**0.5)

Submission status: Wrong Answer

Solution code:
import numpy as np
a, b, c = map(int,input().split())
dif = np.around(np.sqrt(a),10) + np.around(np.sqrt(b),10) - np.around(np.sqrt(c),10)
sum_ = np.around(np.sqrt(a),10) + np.around(np.sqrt(b),10) + np.around(np.sqrt(c),10)
if dif * sum_ / sum_ < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

num = input().split(" ")
n_1 = int(num[0])
n_2 = int(num[1])
n_3 = int(num[2])
s_1 = math.sqrt(n_1) + math.sqrt(n_2)
s_2 = math.sqrt(n_3)
if s_1 < s_2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

asq = math.sqrt(a)
bsq = math.sqrt(b)
csq = math.sqrt(c)

if (asq+bsq)<csq:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
ans = a ** 2 + b ** 2 + c ** 2 - 2 * (a*b + b*c + c*a)

if ans >= 0:
  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)
if ab2 < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
import math
from fractions import gcd
import sys
#input = sys.stdin.readline


#N=int(input())

#A=list(map(int,input().split()))
#XY=[list(map(int,input().split())) for i in range(N)]

a,b,c=map(int,input().split())
X=gcd(gcd(a,b),c)
c//=X
a//=X
b//=X
if c**.5-a**.5-b**.5>0.1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy
s = input().split()
a = float(s[0])
b = float(s[1])
c = float(s[2])
if -2*numpy.sqrt(a*b)+c-a-b>0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = [int(i) for i in input().split()]
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())
sq = 2*math.sqrt(a*b)
if c-a-b-sq>0:
    print('Yes')

else:
    print('No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from decimal import *
a, b, c = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
a, b, c = map(int, input().split())
a = str(math.sqrt(a))
b = str(math.sqrt(b))
c = str(math.sqrt(c))
print(['No', 'Yes'][Decimal(a) + Decimal(b) < Decimal(c)])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# import numpy as np
import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
from decimal import Decimal


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

    if (a == c) or (b == c):
        res = 'No'
        print(res)
        sys.exit()

    left = (a * b + b * c + c * a) * 2
    right = a ** 2 + b ** 2 + c ** 2

    if left < right:
        res = 'Yes'
    else:
        res = 'No'

    print(res)



main()

Submission status: Wrong Answer

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

import math

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

     s_a = math.sqrt(a)
     s_b = math.sqrt(b)
     s_c = math.sqrt(c)

     if s_a + s_b < s_c:
          print('Yes')
     else:
          print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt
a, b, c = map(int, input().split())
if (c - a - b >= a + b): 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
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)


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

Submission status: Wrong Answer

Solution code:
a,b,c=[int(j) for j in input().split()]
if pow(pow(a,0.5)+pow(b,0.5),2)-c<0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
import math
h=input().split()
a,b,c=int(h[0]),int(h[1]),int(h[2])

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

Submission status: Wrong Answer

Solution code:
abc = input().split()

a = int(abc[0])
b = int(abc[1])
c = int(abc[2])

import math
if 4*a*b < a**2 + b**2 +c**2 - 2*a*c -2*b*c + 2*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< (int(c - a - b))**2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print('Yes' if a+b < c else '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:
a,b,c = [int(i) for i in 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:
a, b, c = map(int, input().split())
d = c - a - b
if d < 0 or a*b > d**2:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ma = Decimal(str(a))
mb = Decimal(str(b))
mc = Decimal(str(c))

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

Submission status: Wrong Answer

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    a,b,c = inpm()
    if (a**.5+b**.5) < c**.5:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(float,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:
import math
a,b,c=input().split();
a=math.sqrt(int(a))/2;
b=math.sqrt(int(b))/2;
c=math.sqrt(int(c))/2;
sum=a+b
if(sum < 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:
import math

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

s=a+b+2*round(math.sqrt(a))*round(math.sqrt(b))
t=c
#s=math.sqrt(a) + math.sqrt(b)
#t=math.sqrt(c)

#print(s,t)

if s < t:
  ans="Yes"
else:
  ans="No"

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
a,b,c = map(int,input().split())
X=a+b+2*((a*b)**0.5)
if X<c:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a,b,c=map(int, input().split())
a *= 10000000000
b *= 10000000000
c *= 10000000000
import numpy as np
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())
a = math.sqrt(a)
b = math.sqrt(b)
c = math.sqrt(c)

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

Submission status: Wrong Answer

Solution code:
import math
 
a,b,c=[int(x) for x in input().rstrip().split()]



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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

r = "Yes" if sqrt(a) + sqrt(b) < sqrt(c) else "No"

print(r)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int, input().split())
if a+b-c + 2*int((a*b)**0.5 + 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)*math.sqrt(b))+round(math.sqrt(a)**2)+round(math.sqrt(b)**2)<round(math.sqrt(c)**2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
from collections import deque, defaultdict
import bisect
from math import factorial, sqrt


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

    right = (c - a - b) ** 2
    left = 4 * a * b

    if right > left:
        if right - left < 1e-4:
            print("No")
        else:
            print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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")
  
print(math.sqrt(a) + math.sqrt(b))
print(math.sqrt(c))

Submission status: Wrong Answer

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

import math

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

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
a_s = math.pow(a, 0.5)
b_s = math.pow(b, 0.5)
c_s = math.pow(c, 0.5)
if a_s + b_s < c_s:
    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.hex()+B.hex()<C.hex():
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

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

	#if a >= c or b >= c:
		#print("No")
		#sys.exit()

	#if len(str(max(a,b,c) - min(a,b,c))) < 1:
		#if math.sqrt(a) + math.sqrt(b)  > math.sqrt(c):
			#print("Yes")
		#else:
			#print("No")
	#else:
	if math.sqrt(a) + math.sqrt(b) > math.sqrt(c):
		print("Yes")
	else:
		print("No")


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

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 c - a - b >= 0:

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

Submission status: Wrong Answer

Solution code:
import sys
import itertools
import math
from collections import deque
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(10000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

from decimal import *
getcontext().prec = 30000

a,b,c = IL()
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
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:
a, b, c = map(int,input().split())

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

Submission status: Wrong Answer

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

if a+b+2.0*sqrt(a*b) < c:
    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:
import math 

# print the error when x<0 
inp = list(map(int,input().split()))
a=inp[0]
b=inp[1]
c=inp[2]
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(lambda x: int(x) ** 0.5, input().split())
print("Yes" if (a + b < c) else "No")

Submission status: Wrong Answer

Solution code:
import math
import decimal

decimal.getcontext().prec = 28
a,b,c = list(map(int,input().split()))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
from decimal import *
getcontext().prec = 100
if ((Decimal(c)-Decimal(a)-Decimal(b))**2)>(4*Decimal(a)*Decimal(b)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import *
import sys
a,b,c = map(int,input().split())
getcontext().prec = 1000
if a + b >= c:
  print('No')
  sys.exit(0)
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
  print('Yes')
  sys.exit(0)
print('No')

Submission status: Wrong Answer

Solution code:
inp = list(map(int,input().split()))
if (inp[0]+inp[1]-inp[2] < -2 * (inp[0]*inp[1])**0.5):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

import math

ab = math.sqrt(a)+math.sqrt(b)
if ab < math.sqrt(c):
    print("YES")
else: print("NO")

Submission status: Wrong Answer

Solution code:

a, b, c = map(int, input().split())
tmp1 = pow(a, 0.5)
tmp2 = pow(b, 0.5)
tmp3 = tmp1 * tmp2 * 2

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

Submission status: Wrong Answer

Solution code:
import math as m


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

ab = m.sqrt(a*b)
# c2 = m.sqrt(c)

if ((c - a - b) / 2) - ab > 0.000000001:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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