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 sys
input = sys.stdin.readline
import math
sqrt = math.sqrt

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

# from decimal import *

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

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

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

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


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

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

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

    # rtAB = int(Decimal(A*B).sqrt())
    rtAB = int_sqrt2(A*B)
    LH = A + B + 2 * rtAB
    RH = C

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

    print(res)

main()

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
if a<b:
  a,b=b,a
D=(math.sqrt(a)-math.sqrt(b))*math.sqrt(c)
if a-b<D:
  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 abs(Decimal(c).sqrt()-Decimal(a).sqrt() - Decimal(b).sqrt()) > (1e-30):
  print('Yes')
  sys.exit(0)
print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import copy
import math
import fractions

import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
import numpy as np

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

if __name__ == '__main__':
    a,b,c = map(int, input().split())
    np.set_printoptions(precision=100)

    while(1):
        com = gcd(a,b,c)

        if com ==1:
            break
        else:
            a = a // com
            b = b // com
            c = c // com
    ra = np.sqrt(a)
    rb = np.sqrt(b)
    rc = np.sqrt(c)
    rab = np.sqrt(a*b)
    if  2*rab< c-a-b:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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

if  a + b - c + math.sqrt(a*b) < 0:
    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 = int(r_a + r_b)

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

Submission status: Wrong Answer

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

if c - (a + b) > 2*(a*b)**(1/2):
  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()

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

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

    print(res)



main()

Submission status: Wrong Answer

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

import math

a,b,c = mi()

if ((a+b-c)/2 >= (a*b)**0.5):
# if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

from decimal import *
getcontext().prec = 10000

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())
print("Yes")

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

	#print(pow(a, 0.5))

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

	if len(str(max(a,b,c))) > 8 and 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 round(math.sqrt(a) + math.sqrt(b)) < round(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

datas = input().split(" ")

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

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

Submission status: Wrong Answer

Solution code:
print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import numpy as np

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

ruto_a = np.around(np.sqrt(a), decimals = 100)
ruto_b = np.around(np.sqrt(b), decimals = 100)
ruto_c = np.around(np.sqrt(c), decimals = 100)

if ruto_a + ruto_b < ruto_c:
    print("Yes")

else:
    print("No")

Submission status: Wrong Answer

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

if Decimal(routeA) + Decimal(routeB) < Decimal(routeC):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
N = list(map(int,input().strip().split()))
NN=pow(N[0]*N[1],0.5)
if N[0]+N[1]+2*NN<N[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input().split()
a = float(s[0])
b = float(s[1])
c = float(s[2])
if 4*a*b<(c-a-b)**2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

from numpy import sqrt

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

A = max(A, 0)
B = max(B, 0)
C = max(C, 0)

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

Submission status: Wrong Answer

Solution code:
import numpy as np

a, b, c = map(int, input().split())
r_a = np.sqrt(a)
r_b = np.sqrt(b)
r_c = np.sqrt(c)

if(r_c > r_a+r_b):
    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)
a = sqrt(a)*1000
b = sqrt(b)*1000
c = sqrt(c)*1000

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

A = (c - (a + b))**2
B = 4 * a * b

if A < B:
    ans = 'No'

else:
    ans = 'Yes'

print(ans)

Submission status: Wrong Answer

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

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

print(flg)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a,b,c = list(map(int,input().split()))
from decimal import Decimal
a,b,c = list(map(Decimal,[a,b,c]))

from math import sqrt
ret = "No"
if c-a-b-Decimal(2*sqrt(a*b))>0:
    ret="Yes"
print(ret)

Submission status: Wrong Answer

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

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

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
from decimal import Decimal
import math
getcontext().prec=50
a,b,c=map(int,input().split())
a=a*100
b=b*100
c=c*100
print("Yes" if math.sqrt(a)+math.sqrt(b)<math.sqrt(c) else "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:
a,b,c = map(int, input().split())
if a ** 0.5 + b ** 0.5 < c ** 0.5:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
t = map(int, input().split())
t = list(t)

a = math.sqrt(t[0])
b = math.sqrt(t[1])
c = math.sqrt(t[2])


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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import math
a, b, c = map(int, input().split())
flag = 0
if a**(1 / 2) + b**(1 / 2) < c**(1 / 2):
    if 2 * (a + b)**(1/2) < (c - a - b):
        if 0 < (c - a - b) and 4 * (a + b) < (c - a - b)**2:
            flag = 1
if 4 * (a + b) == (c - a - b)**2:
    flag = 0
        

if flag == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import sys

a, b, c = input().split()
a = math.sqrt(int(a))
b = math.sqrt(int(b))
c = math.sqrt(int(c))
d = round(a + b - c, 64)

if abs(d) < sys.float_info.epsilon:
    print('No')
elif d < 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()

	print(pow(a, 0.5))

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

	if len(str(max(a,b,c))) > 8 and 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 round(math.sqrt(a) + math.sqrt(b)) < round(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:
# coding: utf-8

import math

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

ans = "Yes"

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if (c - a - b) ** 2 - 4 * a * b <= 0:
    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) > 1e-10:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

x = c - b - a
if a * b * 4 < x * x:
	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 * n_2)
s_2 = (n_3 - n_1 -n_2)/2
if s_1 < s_2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]
 
if math.sqrt(Line[0]) + math.sqrt(Line[1]) < math.sqrt(Line[2]):
    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*b < ((c-a-b)/2)**2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy

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 * numpy.sqrt(a*k * b*k) / k < 0.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)))

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

Submission status: Wrong Answer

Solution code:
from sys import exit, setrecursionlimit
setrecursionlimit(10**6)

def array2D(row, col ,val=0):
    return [[val]*col for i in range(row)]

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

Submission status: Wrong Answer

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

arg = input().split(' ')
a = int(arg[0])
b = int(arg[1])
c = int(arg[2])

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

Submission status: Wrong Answer

Solution code:
import sys
import os
import math
from decimal import Decimal

Q = 10 * 9


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b, c = list(map(int, sys.stdin.readline().split()))
    # print(math.sqrt(a * Q), math.sqrt(b * Q), math.sqrt(c * Q))
    # print(Decimal(math.sqrt(a*Q)), Decimal(math.sqrt(b*Q)), Decimal(math.sqrt(c*Q)))

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
import decimal

decimal.getcontext().prec = 112

a, b, c = 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)):
    ans = 'Yes'
else:
    ans = 'No'

'''
print(decimal.Decimal(math.sqrt(a)))
print(math.sqrt(b))
print(math.sqrt(c))
print(math.sqrt(a) + math.sqrt(b))
'''
'''
left_cal = a + b + 2 * math.sqrt(a * b)

if left_cal < c:
    ans = 'Yes'
else:
    ans = 'No'
'''
print(ans)

Submission status: Wrong Answer

Solution code:
import math



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




if math.sqrt(A)+math.sqrt(B)<math.sqrt(C):
    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)+Decimal(b**0.5)
C=Decimal(c**0.5)
D=Decimal(C-A)
if D>0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

num1 = int(value[0])
num2 = int(value[1])
num3 = int(value[2])

res1 = math.sqrt(num1)
res2 = math.sqrt(num2)
res3 = math.sqrt(num3)

if res1 + res2 < res3:
  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('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:
def main():
    import math
    import decimal
    a,b,c = map(int,input().split())
    a = a*10**20
    b = b*10**20
    c = c*10**20
    cr = math.sqrt(c)
    ar = math.sqrt(a)
    br = math.sqrt(b)
    if cr - (ar+br) > 0 :
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

import math

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

ans = "No"

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c = list(map(int,input().split()))
A = np.sqrt(a)
B = np.sqrt(b)
C = np.sqrt(c)
AB = A+B
if AB < 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)
ans = ((c - a - b) / 2) - ab

if ans > -0.000000000000001:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
abc = list(map(int,input().split()))

if abc[0] <= 10**9 and abc[1] <= 10**9 and abc[2] <= 10**9 and \
1 <= abc[0] and 1 <= abc[1] and 1 <= abc[2]:
  chick = math.sqrt(abc[0]) + math.sqrt(abc[1])
  if chick < math.sqrt(abc[2]):
    print('Yes')
  else:
    print('No')

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])
sA= sqrt(A)
sB=sqrt(B)
sC=sqrt(C)
sAB=sA+sB
if sAB<sC:
    print('Yes')
else:
    print('No')

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)
 
if a2 + b2 + c2 -2 * (ab + ac + bc) > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

flg = 'No'
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    flg = 'Yes'
elif math.sqrt(a) + math.sqrt(b) >= math.sqrt(c):
    flg = 'No'

print(flg)

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)

ans = a + b - c

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = [int(_) for _ 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
abc = input().split()
root_a = math.sqrt(abs(int(abc[0])))
root_b = math.sqrt(abs(int(abc[1])))
root_c = math.sqrt(abs(int(abc[2])))
if (root_a + root_b) < root_c:
  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 a * b * 4 < (c - a - b) * (c - a - b):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

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

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_c
# -*- coding: utf-8 -*-
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
def LI():
	return [ math.sqrt(float(s)) for s in input().split() ]
 
a,b,c = LI()
 
print('Yes') if math.sqrt((a+b))<math.sqrt(c) else print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

val = input().split(' ')
a = int(val[0])
b = int(val[1])
c = int(val[2])

# TODO このままだと、丸め桁数分間違いが発生する可能性がある
#result = 'Yes' if sqrt(a) + sqrt(b) < sqrt(c) else 'No'
result = 'Yes' if a + b - c < -2 * sqrt(a) * sqrt(b) else 'No'
print(result)

Submission status: Wrong Answer

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

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

    target = math.sqrt(a) + math.sqrt(b) - math.sqrt(c)
    if target > 0:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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