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(" "))
ab = (a*b)**0.5
cab = (c-(a+b))
if 2*ab<cab:
    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('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
def nroot(a, n, x=1.0, eps=1e-7):
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x
if nroot(a,2)+nroot(b,2)<nroot(c,2):
    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:
#!python3

iim = lambda: map(int, input().rstrip().split())

import math
from math import sqrt

def resolve():
    a, b, c = iim()
    ab2 = a+b+2*sqrt(a*b)
    print("Yes" if ab2 < c else "No")

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
def mi():return map(str,input().split())
from decimal import *
from math import *

a,b,c=mi()
getcontext().prec=2000
a=Decimal(a)**Decimal("0.5")
b=Decimal(b)**Decimal("0.5")
c=Decimal(c)**Decimal("0.5")
# print(type(a))
f=(Decimal(c)-Decimal(a)-Decimal(b))
# print(type(f),f)

if f>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c = map(int, input().split())
l = np.sqrt([a,b,c])
if l[0]+l[1] < l[2]:
    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:
a,b,c = map(int,input().split())
x = a * b * c
if c * (a + b) < a * b:
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

k = max(float(a), float(b))
if float(a) + float(b) - float(c) + 2.0 * math.sqrt(a*k * b*k) / k < 0.0:
    if a < 100000000 and b < 100000000:
        print("Yes")
        # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))
    else:
        print("No")
else:
    if a < 100000000 and b < 100000000:
        print("No")
        # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
def bisearch(f, n):
    l = 0
    r = n
    fl = f(l)
    fr = f(r)
    while l <= r:
        m = (l + r) // 2
        fm = f(m)
        #print l,m,r,fl,fm,fr,n
        if fm == n:
            return m
        elif fm > n:
            r = m - 1
            fr = f(r)
        else:
            l = m + 1
            fl = f(l)

def try_square_root(n2):
    return bisearch(lambda n:n*n, n2)

a, b, c = map(int, input().split())
k = try_square_root(a*b)
if k == None:
  aa = a+b+np.around((math.sqrt(4*a*b)), 20)
  if c>aa:
    print("Yes")
  else:
    print("No") 
else:
  ww = a+b+2*k
  if c>ww:
    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:
a,b,c = map(int, input().split())
if (4*a*b) < (c*c - 2*c*(a+b) + (a+b)*(a+b)):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

r=math.sqrt(a) + math.sqrt(b)
s=math.sqrt(c)

if(round(r,1000000000)<round(s,1000000000)):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

s = Decimal(a**0.5+b**0.5)
t = Decimal(c**0.5)

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

Submission status: Wrong Answer

Solution code:
from decimal import *

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

Submission status: Wrong Answer

Solution code:
import math
import numpy
from decimal import *

getcontext().prec = 100
a,b,c =map(int,input().split())
d=math.sqrt(a)
e=math.sqrt(b)
f=math.sqrt(c)
h= d+e
if h<f:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import math

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

compare_num = math.pow(a,0.5) + math.pow(b,0.5)

if compare_num < math.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=a**0.5
B=b**0.5
C=c**0.5
if A+B<C:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
de = (c - a - b)/2
dob = a * b

if dob < de*de:
    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()
	getcontext().prec = 40

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math 
a=input().split(' ')
a=[int(x) for x in a]
if math.sqrt(a[0])+math.sqrt(a[1])<math.sqrt(a[2]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

if (a + b) == c:
    print("No")
elif (a + b) < 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 4*a*b<(c-a-b)**2 else'No')

Submission status: Wrong Answer

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

import math
from decimal import Decimal

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

     # √a + √b < √c
     # (√a + √b)^2 < c
     # a + 2√ab + b < c
     # 2√ab < c - (a + b)
     if math.sqrt(a * b) * 2 < (c - (a + b)):
          print('Yes')
     else:
          print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
a,b,c=map(int,input().split())
A=Decimal(str(a**0.5))+Decimal(str(b**0.5))
C=Decimal(str(c**0.5))
if Decimal(str(C-A))>0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b, c = MAP()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if result < sqrt(c):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    a,b,c = list(map(int,input().split(' ')))
    #a,b,c = list(map(lambda x:abs(int(x)),input().split(' ')))
    # if (a**0.5 + b**0.5) < (c**0.5):
    #     print('Yes')
    # else:
    #     print('No')

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin
import numpy as m
input = stdin.readline

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,raw_input().split())
a = a**0.5
b = b**0.5
c = c**0.5
x = "Yes" if (a + b) < c else "No"
print x

Submission status: Wrong Answer

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

cond = (a + b + 2 * math.sqrt(a * b) - c) < 0
# cond = (math.sqrt(a) + math.sqrt(b) - math.sqrt(c)) < 0

if cond:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import numpy

min = 0.0000000000001
attemptLimits = 1000   
a , b , c = map(int,input().split())

# 解を求める関数
def targetFunc(x,y):
    return x**2 - y
 
# 導関数
def derivative(x):
    return 2.0*x      
 
def newtonMethod(a, min,y):
    for i in range(attemptLimits):
        # 漸化式
        ah = a - targetFunc(a,y)/derivative(a)
        
        # 収束条件
        if abs(a - ah) < min:break
        
        # 近似解の更新
        a = ah
    return a

a = newtonMethod(a,min,a)
b = newtonMethod(a,min,b)
c = newtonMethod(a,min,c)

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l = a+b-c
r = -2*((a*b)**0.5)

print("YNeos"[l >= r::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 1000000000000
a, b, c = map(int, input().split())
ab = a * b
rab = 2 * Decimal(math.sqrt(ab))
rab1 = math.floor(rab)

#print(rab)
#print(rab1)

ans = a + b - c

#print(ans)

if ans >= 0:
    print('No')
elif ans < 0:
    ans1 = abs(ans)
    if ans1 <= rab1:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

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

if a + math.sqrt(a*b)*2 + b  < c:
    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:
# coding: utf-8

import math

# 標準入力 <int><int>
a, b, c = map(float, input().split())

ans = "No"

if math.sqrt(a) + math.sqrt(b) - math.sqrt(c) < 0:
    ans = "Yes"

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy
a, b, c = list(map(int,input().split()))
a_s = numpy.sqrt(a)
b_s = numpy.sqrt(b)
c_s = numpy.sqrt(c)

if a_s + b_s < c_s:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import decimal

decimal.getcontext().prec = 20000

a, b, c = map(decimal.Decimal, input().split())

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

Submission status: Wrong Answer

Solution code:
# from math import sqrt
from decimal import *

a, b, c = map(int, input().split())
# ra, rb, rc = sqrt(a), sqrt(b), sqrt(c)
ra, rb, rc = Decimal(a).sqrt(), Decimal(b).sqrt(), Decimal(c).sqrt()

print(ra, rb, ra+rb, rc)
if ra + rb < rc:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c = map(np.float128, input().split())
l = np.sqrt([a,b,c])
if l[0]+l[1] < l[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
a,b,c=list(map(lambda i:int(i),input().split()))
if(math.sqrt(c) -(math.sqrt(a)+math.sqrt(b))) >0 :
    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()
	getcontext().prec = 35

	#print(Decimal(a).sqrt())

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

	if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
		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 math
in_list = list(map(float,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
left = math.sqrt(2*a*b + 2*c*b + 2*c*a)
right = math.sqrt(c*c + a*a + b*b)
if left < right:
    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:
from decimal import *

getcontext().prec = 20
a,b,c = map(int,input().split())
a = int(Decimal(a))
b = int(Decimal(b))
c = int(Decimal(c))
if a*b < 1/4 * (c-a-b)**2 and c > (a+b):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math

a,b,c = [int(x) for x in stdin.readline().rstrip().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())
print("Yes")

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

a,b,c=map(float,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 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())

    # if a + b == c:
    print("No")
    exit()
 

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

getcontext().prec = 1024
print('Yes' if Decimal(a).sqrt() + Decimal(b).sqrt()
      < Decimal(c).sqrt() else 'No')