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())
ans = "No"

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

print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

#print(decimal.Decimal(decimal.Decimal(math.sqrt(a)) + decimal.Decimal(math.sqrt(b))))
print('Yes' if decimal.Decimal(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 = [int(i) for i in input().split()]

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, getcontext

getcontext().prec = 1000

a, b, c = map(Decimal, input().split())
if a.sqrt() + b.sqrt() < c.sqrt():
    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 math
a,b,c = map(int,input().split())
d = math.sqrt(a/c)+math.sqrt(b/c)

if d < 1:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import math

l = input()
a,b,c = [math.sqrt(int(x)) for x in l.split()]
if (a + b) < (c):
    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 a+b+2*round(sqrt(a*b))<c else print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

if round(math.sqrt(a)+math.sqrt(b)-math.sqrt(c),50) < 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:

a, b ,c=map(int,input().split())
#4ab<(c-a-b)^2

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

if (c-a-b)==0:
  import sys
  print("No")
  sys.exit()
if 4*a*b < (c-a-b)*(c-a-b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
input = input().split(" ")
import numpy
an = 0
sql = list()
for a in input:
  tn = float(input[an])
  r = numpy.sqrt(tn)
  sql.append(r)
  an+=1
print(input)
print(sql)
a = float(sql[0])
b = float(sql[1])
c = float(sql[2])
apb = a+b
if apb < c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

l = [int(i)*10**40 for i in input().split()]
ls = [int(i**0.5)-2000 for i in l]
for i in range(3):
    for _ in range(4000):
        if ls[i]**2 < l[i]:
            ls[i] += 1
        else:
            break
print(ls)
print(ls[1]**2)
print(ls[2]**2)
if ls[0]+ls[1]<ls[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

root_a = a ** 0.5
root_b = b ** 0.5
root_c = c ** 0.5

rab = root_a + root_b

if rab < root_c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

if(A[0] + A[1] + 2*math.sqrt(A[0]*A[1]) < A[2]):
	print('Yes')
else:
  	print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

k = math.floor((a + b + 2 * math.sqrt(a * b)) / c)

if k == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
enu = enumerate
from math import sqrt

sys.setrecursionlimit(10**7)
a, b, c = map(int, input().split())

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

val = (left**2 - right**2) / (left + right)

if val>0:
    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)

sum = a +b
if sum < c:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = list(map(int, input().split()))
a = i[0]
b = i[1]
c = i[2]

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

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

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
sosu = [2, 3, 5, 7, 11]
for i in range(5):
  while (a % sosu[i] == 0 and b % sosu[i] == 0 and c % sosu[i] == 0):
    if (a == sosu[i] or b == sosu[i] or c == sosu[i]):
      break
    a /= sosu[i]
    b /= sosu[i]
    c /= sosu[i]
left = a * b
right = (c - (a + b)) / 2
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a,b,c=map(int,input().split())
# left=math.sqrt(a) + math.sqrt(b)
# right=math.sqrt(c)
result = a + 2*math.sqrt(a*b)-2*math.sqrt(a*c) + b - 2* math.sqrt(b*c) - 2*math.sqrt(b*c) + c

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

Submission status: Wrong Answer

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

a,b,c = get_nums_l()

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

print("Yes" if x > y else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
a,b,c = (int(x) for x  in 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())

ma, mb, mc = math.sqrt(a), math.sqrt(b), math.sqrt(c)
if round(ma + mb, 10) < round(mc,10):
    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=map(int,input().split())
k=int(c-a-b)
if 0 < k**2-(4*a*b):
    print('Yes')
elif 10**(-3)< k**2-(4*a*b)<0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if nroot(a,2) + nroot(b,2) < nroot(c,2) :
    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()



if (A+B) < C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

a, b, c = [int(n) for n in input().split()]
print('Yes' if '{:.10f}'.format(math.sqrt(a*b)) < '{:.10f}'.format(math.sqrt(c)-math.sqrt(b)) else 'No')

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

a,b,c=map(int,input().split())
A=Decimal(str(a**0.5))
B=Decimal(str(b**0.5))
C=Decimal(str(c**0.5))

print("Yes" if A+B<C else "No")

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, getcontext

getcontext().prec = 100

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

if m <= 0:
  print('No')

else:
  X = ((c - a - b)^2) - (4 * a * b)
  if X > 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)**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


SMALL = 1e-8

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

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt
ABC= input().split(' ')
A=int(ABC[0])
B=int(ABC[1])
C=int(ABC[2])
if sqrt(A)+sqrt(B)<sqrt(C):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
a,b,c = list(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 a*a - 2*a*b + b*b - 2*b*c + c*c - 2*c*a > 0:
    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) and math.sqrt(a) < math.sqrt(c) - math.sqrt(b) and math.sqrt(b) < math.sqrt(c) - math.sqrt(a):
    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 - 2*a*b + b*b - 2*a*c + c*c - 2*b*c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
import itertools

def calc(a, b, c):
    left = math.sqrt(a) + math.sqrt(b)
    right = math.sqrt(c)

    return left < right


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

a = int(a)
b = int(b)
c = int(c)


if calc(a, b, c):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

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:
import math
a,b,c = map(float,input().split())
if a>=1 and b >= 1 and c>= 1 and a <=1000000000 and b <= 1000000000 and c<= 1000000000:
    a = math.sqrt(a)
    b = math.sqrt(b)
    c = math.sqrt(c)
    print(a)
    print(b)
    print(c)
    d = a + b
    print(d)
    if d < c:
        print('Yes')
    else:
        print('No')
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:
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 a ** 0.5 + b ** 0.5 < c ** 0.5:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
import math
import sys
input = sys.stdin.readline
#文字列のときはうまく行かないのでコメントアウトすること
sys.setrecursionlimit(2147483647)

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

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
import numpy
i = input().split()
f1 = float(numpy.sqrt(int(i[0]))) ** 2 + float(numpy.sqrt(int(i[1]))) ** 2
f2 = float(numpy.sqrt(int(i[2]))) ** 2

if f1 < f2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy

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

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s=Decimal(sqrt(a))
t=Decimal(sqrt(b))

v=s*t

if a+b+2*v<c:
  print("Yes")
else:
  print("No")  
#if Decimal(s+t)<u:
#  print("Yes")
#else:
#  print("No")
#if Decimal(sqrt(a))+Decimal(sqrt(b))<Decimal(sqrt(c)):
#  print("Yes")
#else:
#  print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

r_a = math.sqrt(a) 
r_b = math.sqrt(b)
r_c = math.sqrt(c)

s = a+b+2*r_a*r_b
t = r_a + r_b

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    a,b,c=map(int,input().split())
    if math.sqrt(a)+math.sqrt(b)-math.sqrt(c)<0:
        if not abs(math.sqrt(a)+math.sqrt(b)-math.sqrt(c))<1e-10:

            print('Yes')
    else:
        print('No')

resolve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
ABC=input().rstrip('\n').split()
 
a=int(ABC[0])
b=int(ABC[1])
c=int(ABC[2])
 
if a*a+b*b+c*c+a*b-2*a*c-2*b*c>0  :
    print ("Yes")
else :
    print ("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
a = list(map(int, input().split()))
a = a / np.min(a)
sqrt_a = np.sqrt(a)
sqrt_a[2] = sqrt_a[2]*-1

if np.sum(sqrt_a)<0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

if l - r < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import *
from math import sqrt
getcontext().prec = 200
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:
import math
a,b,c,=map(int,input().split())
A=math.sqrt(a)
B=math.sqrt(b)
C=math.sqrt(c)
if C-A+B>0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
import math
N = list(map(int,input().strip().split()))
sqrtA = math.sqrt(N[0])
sqrtB = math.sqrt(N[1])

if N[0]+N[1]+2*sqrtA*sqrtB <N[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

ans = "No"

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
k=int(c-a-b)
if 0 < k**2-(4*a*b):
    print('Yes')
elif 10**(-6)< k**2-(4*a*b)<0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import decimal

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 C - A - B > 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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


SMALL = 1e-4

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

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

    if right > left:
        if right - left < SMALL:
            print("No")
        else:
            print("Yes")
    else:
        if left - right < SMALL:
            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)==0:
  print("No")
if 4*a*b < (c-a-b)*(c-a-b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

if __name__ == "__main__":
    A, B, C = map(int, input().split())
    if Decimal(math.sqrt(A)) + Decimal(math.sqrt(B)) < Decimal(math.sqrt(C)):
        ret = "Yes"
    else:
        ret  = "No"
    print(ret)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

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

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

main()

Submission status: Wrong Answer

Solution code:
import math
#import numpy as np
a,b,c=map(int,input().split(" "))
d=c-a-b
r=2*math.sqrt(a*b)

if float(d)>r:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

def main():
    a,b,c = list(map(int, input().split(' ')))
    if((math.sqrt(a)+math.sqrt(b))**2 < c):
        print('Yes')
    else:
        print('No')
main()

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

a2= a ** 2
b2= b ** 2
c2= c ** 2
ab= a*b
ac= a*c
bc= b*c

#print(a2,b2,c2,ab,bc,ac, (-2 * (ab + ac + bc)))
#print(a2 + b2 + c2 + (-2 * (ab + ac + bc)))
if (a2 + b2 + c2) / 2 > ab + ac + bc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy

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

if numpy.sqrt(a) + numpy.sqrt(b) - numpy.sqrt(c) < 0:
    print("Yes")
    # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))
else:
    print("No")
    # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))