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:
# -*- 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:
from math import sqrt
from decimal import Decimal, getcontext

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

  getcontext().prec = 30
  if A > 10**5:
    a = int(Decimal(A).sqrt())
  else:
    a = sqrt(A)
  if B > 10**5:
    b = int(Decimal(B).sqrt())
  else:
    b = sqrt(B)
  if C > 10**5:
    c = int(Decimal(C).sqrt())
  else:
    c = sqrt(C)

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
import math

YES = "Yes" 
NO = "No"  

def solve(a: int, b: int, c: int):
    if a + b + (2 * math.sqrt(a * b)) - c < 0:
        print(YES)
    else:
        print(NO)
    return

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

l = sqrt(a) + sqrt(b)
r = sqrt(c)

if l < r:
    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())
 
sa = nroot(a, 2)
sb = nroot(b, 2)
sc = nroot(c, 2)
 
if sa + sb < sc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a,b,c=map(int,input().split())
aa=a**0.5
bb=a**0.5
cc=c**0.5
if aa+bb<cc:
    print("Yes")
elif aa+bb>=cc:
    print("No")
else:
    pass

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import numpy as np

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if((decimal.Decimal(a**0.5)+decimal.Decimal(b**0.5)) > decimal.Decimal(c**0.5)):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
from numpy import sqrt

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

if (a + b + 2 * sqrt(a * b)) < c:
    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,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:
import math
s = input().split()
a = float(s[0])
b = float(s[1])
c = float(s[2])
if -2*math.sqrt(a)*math.sqrt(b)+c-a-b>0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = list(map(int, input().split()))
l = 2*(N[0]**0.5)*(N[1]**0.5)
r = N[2]-N[0]-N[1]
if l < r:
  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())

A = math.sqrt(a)
B = math.sqrt(b)
C = math.sqrt(c)

ans = "No"

if A + B <= C:
    ans = "Yes"

print(ans)

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:
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")
if N[0]+N[1]+2*sqrtA*sqrtB >=N[2]:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#スペース区切りの整数の入力
A, B, C = map(int, input().split())

#A_sq = A**0.5
#B_sq = B**0.5
#C_sq = C**0.5

# √8の計算
#a = pow(8, 0.5)

A_sq = pow(A, 0.5)
B_sq = pow(B, 0.5)
C_sq = pow(C, 0.5)

if(A_sq+B_sq < C_sq):
  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 (4*a*b)< k**2:
    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 sys
import numpy as np


def input():
    return sys.stdin.readline()[:-1]


def solve():
    a,b,c = map(int, input().split())
    if np.sqrt(a*b) < (c-a-b)/2:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    import math
    import decimal
    a,b,c = map(int,input().split())
    decimal.getcontext().prec = 200
    cr = decimal.Decimal(math.sqrt(c))
    ar = decimal.Decimal(math.sqrt(a))
    br = decimal.Decimal(math.sqrt(b))
    if round(cr**2,180) - round((ar+br)**2,180) > 0 :
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

a,b,c=mi()

from decimal import *
from math import *

getcontext().prec=10**5
a=Decimal(sqrt(Decimal(a)))
b=Decimal(sqrt(Decimal(b)))
c=Decimal(sqrt(Decimal(c)))
f=Decimal(c-a-b)

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
import math
a,b,c = list(map(int,input().split()))
A = Decimal(math.sqrt(a))
B = Decimal(math.sqrt(b))
C = Decimal(math.sqrt(c))
AB = Decimal(Decimal(A)+Decimal(B))
if AB < C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math 

# print the error when x<0 
inp = list(map(int,input().split()))
a=inp[0]
b=inp[1]
c=inp[2]
if(math.sqrt(a)+math.sqrt(b)<math.sqrt(c)):
	print("YES")
else:
	print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

a = []
for i in input().split(" "):
    a.append(int(i))

b = Decimal(str(a[0] + a[1] - a[2]))
c = Decimal(str(2*math.sqrt(a[0]) * math.sqrt(a[1]) ) )
d = b + c
if d < Decimal(str(0)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import time
start_time = time.time()
from sys import stdin, stdout 
from bisect import bisect_left, bisect_right
from collections import defaultdict
import math
from fractions import Fraction as frac
from random import random
cin = stdin.readline
def cout(x):    stdout.write(str(x)+'\n')
def var(type = int):    return type(stdin.readline())                      #   take input
def readline(type = int):   return map(type,stdin.readline().split())      #   read line into multiple variables
def readlist(type = int):   return list(map(type,stdin.readline().split()))
def sorted_indexes(arr):    return sorted(range(len(arr)),key=arr.__getitem__)
def printr(arr):    [stdout.write(str(x)+' ')   for x in arr];    cout('')
def find_lt(a, x):#'Find rightmost value less than x'
    i = bisect_left(a, x)
    if i:
        return a[i-1]
    raise ValueError
def find_gt(a, x):#'Find leftmost value greater than x'
    i = bisect_right(a, x)
    if i != len(a):
        return a[i]
    raise ValueError
def f_primes(n) :
    pmx = [] ; f = 1
    for k in range(2, n):
        f = f * (k - 1)
        if ((f + 1) % k == 0):  pmx.append(k)
    return pmx
def hypo(x,y):  return math.sqrt(x*x + y*y)
def binary_search(arr, x):
    i = bisect_left(arr, x)
    if i == len(arr) or arr[i] != x:
        return -1
    return i
    
def binary_string(x):   return '{:032b}'.format(x)
MOD1 = 1000000007; MOD2 = 998244353

#----------------Funcs

a,b,c = readline(float)
y = (c - a - b)
x = ( 4*a*b < y*y )
print("Yes" if x else "No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
abc = input().split()
root_a = math.sqrt(int(abc[0]))
root_b = math.sqrt(int(abc[1]))
root_c = math.sqrt(int(abc[2]))
if (root_a + root_b) < root_c:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
x = list(map(int,input().split(" ")))
a = x[0]
b = x[1]
c = x[2]
import math
import decimal

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

a_sqrt_dec = decimal.Decimal(a_sqrt)
b_sqrt_dec = decimal.Decimal(b_sqrt)
c_sqrt_dec = decimal.Decimal(c_sqrt)
# left = a_sqrt + b_sqrt
# right = c_sqrt
# left_p = print('{:.20g}'.format(left))
# right_p = print('{:.20g}'.format(right))

if a_sqrt_dec + b_sqrt_dec < c_sqrt_dec:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

ans = "No"

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
from math import sqrt, ceil, floor


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

a, b, c = map(float, input().split())
root = np.sqrt(a * b * 10000000000000000)

if a * 100000000 + b * 100000000 + 2 * root < c * 100000000:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

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 = 30      # デフォルト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 = map(int, input().split())
#sqa = math.floor(math.sqrt(a)*100000000000000000000000000000000000000000000)/100000000000000000000000000000000000000000000
#sqb = math.floor(math.sqrt(b)*100000000000000000000000000000000000000000000)/100000000000000000000000000000000000000000000
#sqc = math.floor(math.sqrt(c)*100000000000000000000000000000000000000000000)/100000000000000000000000000000000000000000000

sqa = math.sqrt(a)
sqb = math.sqrt(b)
sqc = math.sqrt(c)

#s = c - (a + b)
#t = 2 * sqa * sqb
#if t < s:
#  print("Yes")
#else:
#  print("No")
#sqc = math.sqrt(c)
if sqa + sqb < sqc:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

a_ = np.sqrt(a)
b_ = np.sqrt(b)
c_ = np.sqrt(c)

if a + b > c:
  print("No")

elif a_ + b_ < c_:
  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())
d = c - a - b
if a*b < d**2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
x,y,z=map(int,input().split())
if x*y<pow(((z-(x+y))/2),2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = list(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,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

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

  if 4*a*b<y**2:
    return 'Yes'

  return 'No'

# main()
print(main())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def nroot(a, n, x=1.0, eps=1e-15):
    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 sys

a, b, c = map(int, sys.stdin.readline().split())
if a**2 + b**2 + c**2 - 2*a*c - 2*b*c - 2*a*b > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
l = a + 2* math.sqrt(a) * math.sqrt(b) + b
r = c

if l<r:
    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 +2*round(np.sqrt(a*b), 10) < 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 math
s = input().split()
a = float(s[0])
b = float(s[1])
c = float(s[2])
if -2*math.sqrt(a*b)+c-a-b>0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
in_num = input('')

all_num = in_num.split()
a = all_num[0]
b = all_num[1]
c = all_num[2]

if(4 * int(a) * int(b) - (int(c) - int(a) - int(b))**2 >0):
    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:
from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
import math
from fractions import gcd
import sys
#input = sys.stdin.readline


#N=int(input())

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

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

if float(a.sqrt())+float(b.sqrt()) < float(c.sqrt()):
    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):
# if c - a - b < 0:
if pow(a,0.5) + pow(b,0.5) < pow(c,0.5):
#if math.sqrt(a * b) < (c - a - b) / 2:
    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 (4*a*b)/100000 < k**2/100000:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

decimal.getcontext().prec = 1000
if decimal.Decimal(math.sqrt(a)) + decimal.Decimal(math.sqrt(b)) < decimal.Decimal(math.sqrt(c)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

import math
if c - a - b > 2*round(math.sqrt(a*b), 2):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math
def yes():
    print("Yes")
def no():
    print("No")

x = list(map(int, input().split()))
a = math.sqrt(x[0])
b = math.sqrt(x[1])
c = math.sqrt(x[2])

if a+b < c:
    yes()
else:
    no()

Submission status: Wrong Answer

Solution code:
import math

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

x = a + b

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

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

Submission status: Wrong Answer

Solution code:
import math
import decimal
a,b,c=map(int,input().split())
print(decimal.Decimal(a**0.5)+decimal.Decimal(b**0.5))
print(decimal.Decimal(c**0.5))

if((decimal.Decimal(a**0.5)+decimal.Decimal(b**0.5)) > decimal.Decimal(c**0.5)):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
import math

def main():
    
    a, b, c = [int(i) for i in input().split()]
    
    result = "No"
    if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
        result = "Yes"
    print(result)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a = list(map(float, input().split()))
import math
k = math.sqrt(a[0]) +math.sqrt(a[1]) - math.sqrt(a[2]) 
if k < 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b, c = map(int, input().split())
# 計算
#a = a**0.5
#b = b**0.5
#c = c**0.5
# 出力
if (a + b + 2 * a**0.5 * b**0.5) < c :
  print('Yes')
else :
  print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
a = list(map(int, input().split()))
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:
#!/usr/bin/env python

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

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

if __name__ == '__main__':
    main()