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:
def main():
    a,b,c = map(int,input().split())
    if (a ** (1/2)+b **(1/2) - c **(1/2)) > 1e-12:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

if (4 * (ABC[0] * ABC[1]) < (ABC[2] - ABC[0] - ABC[1]) ** 2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
getcontext().prec = 28      # デフォルト28桁のところを20桁にする

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
from decimal import *

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

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

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

if ans < 0:
    print("Yes")

else:
    print("No")

Submission status: Wrong Answer

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

siki = (a - b) * (a - b) + (c - a) * (c - b) - c * (a + b) - a * b

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

Submission status: Wrong Answer

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

if (sqrt(a) + sqrt(b) - sqrt(c) < 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 = 20005
	#print(Decimal(a).sqrt())

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

	if Decimal(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
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))

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

A = math.sqrt(a)
B = math.sqrt(b)
C = math.sqrt(c)
# print(A+B,C)

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

Submission status: Wrong Answer

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



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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


import math


def main():
    a, b, c = map(int, input().split())
    # ans = math.sqrt(a) + math.sqrt(b) < math.sqrt(c)
    # ans = (c - a - b) > 2 * math.sqrt(a * b)
    ans = (c - a - b) * (c - a - b) > 4 * a * b
    print("Yes" if ans else "No")


if __name__ == '__main__':
    main()

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
C = a + b

if C < c:
    if A <= B:
        ans = 'No'
    else:
        ans = 'Yes'

elif A<B:
    ans = 'No'

elif B<A:
    ans = 'Yes'

else:
    ans = 'No'


print(ans)

Submission status: Wrong Answer

Solution code:
import numpy

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

a_sqrt = numpy.sqrt(a)
b_sqrt = numpy.sqrt(b)
c_sqrt = numpy.sqrt(c)

if a_sqrt < c_sqrt - b_sqrt:
    print("Yes")
    
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
a, b, c = map(int, input().split())
if a + b >= c:
    print("No")
    exit()

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

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:
import math
import numpy

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()


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

if c <= 2*(a+b) and c-a-b > 2*(a**0.5+b**0.5):
    print("Yes")
    exit()

if c - a - b > a+b:
    print("Yes")
elif c - a - b == a+b:
    if a==b:
        print("No")
    else:
        print("Yes")    
else:
    print("No")

Submission status: Wrong Answer

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

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


sqa=pow(a,0.5)
sqb=pow(b,0.5)
sqc=pow(c,0.5)

if sqa+sqb<sqc:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

a,b,c = inpl()
x = 4 * a * b - pow(a,2) - pow(b,2) - pow(c,2) + (a*c-a*b+b*c)*2
if x < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import time
from decimal import *
s = time.time()

def int_sqrt(n):
    tmp = n**(1/2)
    if tmp**2 > n:
        tmpmax = Decimal(tmp)
        tmpmin = Decimal(tmp-0.000001)
    else:
        tmpmin = Decimal(tmp)
        tmpmax = Decimal(tmp+0.000001)
    while tmpmin < tmpmax:
        tmp = (tmpmin + tmpmax) / 2
        if tmp**2 > n:
            tmpmax = tmp
        else:
            tmpmin = tmp

        if time.time() - s > 1.9:
            break
    return (tmpmax + tmpmin) / 2

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

tmp = (c-(a+b))**2
tmp1 = 4*a*b

if(tmp > tmp1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

roota = Decimal(a) ** Decimal(0.5)
rootb = Decimal(b) ** Decimal(0.5)
rootc = Decimal(c) ** Decimal(0.5)
n = 18
root_a = Decimal(str(roota)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)
root_b = Decimal(str(rootb)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)
root_c = Decimal(str(rootc)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)

if root_a + root_b < root_c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from math import *

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:
from math import sqrt
from decimal import *

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *

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

    a = pow(a,0.5)
    b = pow(b,0.5)
    c = pow(c,0.5)

    ad = Decimal(str(a))
    bd = Decimal(str(b))
    cd = Decimal(str(c))

    if ad + bd < cd:
        is_big = True
    else:
        is_big = False

    print('Yes' if is_big else 'No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

a, b, c = list(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 math
a, b, c = map(int,input().split(' '))
hidari = math.sqrt(a) + math.sqrt(b)
if hidari < math.sqrt(c):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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:
#coding:utf-8
import sys,os
from collections import defaultdict, deque
from fractions import gcd
from math import ceil, floor
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    a,b,c = LMIIS()
    # YN( ((a**0.5)+(b**0.5)) < (c**0.5))
    YN((a**2+b**2+c**2+2*a*b-2*b*c-2*c*a ) > (4*a*b))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

e=max(a,b)
f=min(a,b)
g=c

if Decimal(e-f) < Decimal(sqrt(g)*(sqrt(e)-sqrt(f))):
  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) - math.sqrt(c) < 0):
        print('Yes')
    else:
        print('No')
main()

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal
a,b,c = [float(x) for x in input().split()]

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

Submission status: Wrong Answer

Solution code:
import decimal

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

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

Submission status: Wrong Answer

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

siki = (a - b) * (a - b) + (c - a) * (c - b) - c * (a + b) + a * b

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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 or c==0 else "No")

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter

# import numpy as np
# import scipy as scp

# 入力の受け取り
a,b,c = map(int,input().split())

def check():
    if a == b:
        return 4*a < c
    elif 2*(a+b) <= c:
        return True
    # elif a + b + 2*sqrt(a*b) < c:
    #     return True
    else:
        return False

if check():
    ans = "Yes"
else:
    ans = "No"
print(ans)
# print("{:.10f}".format(ans))

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

Submission status: Wrong Answer

Solution code:
import math

a,b,c=map(int,input().split())
if float.fromhex(float.hex(math.sqrt(a)))+float.fromhex(float.hex(math.sqrt(b)))<float.fromhex(float.hex(math.sqrt(c))):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
a *= 10**20
b *= 10**20
c *= 10**20
if 2*((a*b)**.5) < 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 < 1:
    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)
d = a + b
if str(d) < str(c):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import sys,os
from collections import defaultdict, deque
from fractions import gcd
from math import ceil, floor
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    a,b,c = LMIIS()
    YN( ((a**0.5)+(b**0.5)) < (c**0.5))
    YN((a**2+b**2+c**2+2*a*b-2*b*c-2*c*a ) > (4*a*b))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import sqrt
a, b, c = map(int, input().split())
mod = 10**9 + 7
# if c**2 - 2*(a+b)*c + (a-b)**2 > 0:
# if a**2 + b**2 + c**2 >= 2 * (a*b + b*c + c*a):
if (a+b+c) ** 2 / 4 > (a*b + b*c + c*a):
# T = sqrt(a*b + b*c + c*a) * 2
# if -T <= a+b+c <= T:
    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())
print(a,b,c)
left=4*a*b
right=a^2+b^2+c^2+2*(a*b-c*a-c*b)
if left<right:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

x = 4 * a * b
z = c - a - b
y = z ** 2


if x < y:
    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
C = a + b

if C < c:
    if A <= B:
        ans = 'No'
    else:
        ans = 'Yes'

elif A<B:
    ans = 'Yes'

elif B<A:
    ans = 'No'

else:
    ans = 'Yes'


print(ans)

Submission status: Wrong Answer

Solution code:
from math import sqrt
from decimal import *

getcontext().prec = 20  

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import sqrt

a, b, c = [float(e) for e in input().split()]

print("{}".format("Yes" if sqrt(a) + sqrt(b) < sqrt(c) else "No"))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

N = [int(_) for _ in input().split()]

def solve(a, b, c):
    
    if c < a or c < b:
        return "No"

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

print(solve(N[0], N[1], N[2]))

Submission status: Wrong Answer

Solution code:
import decimal

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


decimal.getcontext().prec = 1000
a=decimal.Decimal(a)
b=decimal.Decimal(b)
c=decimal.Decimal(c)

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

from decimal import Decimal

if Decimal(sqrt(float(a))) + Decimal(sqrt(float(b))) < Decimal(sqrt(float(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*c)+math.sqrt(b*c)<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())

e=max(a,b)
f=min(a,b)
g=c

if e-f < sqrt(g)*(sqrt(e)-sqrt(f)):
  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 = 20004
	#print(Decimal(a).sqrt())

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

	if Decimal(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
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))

# 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 = [math.sqrt(float(i)) for i in input().split(' ')]
ans = 'Yes' if a + b < c else 'No'
print(ans)

Submission status: Wrong Answer

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

while a % 100 == 0 and b % 100 == 0 and c % 100 == 0:
    a//= 100
    b//= 100
    c//= 100

ma, mb, mc = math.sqrt(a), math.sqrt(b), math.sqrt(c)
if abs(ma+mb - mc) < 1**(-10):
    print('Yes')
    
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

ab = 2 * math.sqrt(a*b)

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

Submission status: Wrong Answer

Solution code:
import math
 
A,B,C=map(int, input().split())

D=A+B-C+2*math.sqrt(A*B)
if D<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):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(float, input().split())
x = a**0.5 + b**0.5
y = c**0.5
if x - y < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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:
from sys import stdin
a,b,c = [int(x) for x in stdin.readline().rstrip().split()]
A = 0
B = 0
C = 0

for i in range(1,10**5):
    if i**2 > a:
        A = i
        break
for i in range(1,10**5):
    if i**2 > b:
        B = i
        break
for i in range(1,10**5):
    if i**2 > c:
        C = i
        break

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

Submission status: Wrong Answer

Solution code:
import math

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

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