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:
#C - Sqrt Inequality
import math
a,b,c= map(int, input().split())

if a-b>=0:
#if float(math.sqrt(a))+ float(math.sqrt(b)) < float(math.sqrt(c)):
    if 4*a*b < (c-a-b)**2:
        print("Yes")
    else:
        print("No")
else:
    if 4 * a * b < (c - b - a) ** 2:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

sqrt_ab = (math.sqrt(a) + math.sqrt(b))**2

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
a,b,c = map(int,input().split())
import math
ans = a + b - 2*(math.sqrt(a*b))
print(ans)
if ans<c and -c<ans:
    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:
a,b,c=map(int,input().split())
 
if round(a+b-c+2*(a*b)**(1/2),4) < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# import sys
import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
# import collections # queue
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def main():
    a,b,c = map(int,input().split())
    if math.sqrt(c)-math.sqrt(a)<math.sqrt(b):
        print("No")
    else:
        print("Yes")
    return

if __name__=='__main__':
    main()

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:
h, v, k = input().split(' ')
h = int(h)
v = int(v)
k = int(k)
if h**.5 + v**.5 < k **0.5:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

words = lambda t : list(map(t, input().split()))
a,b,c = words(int)

at = Decimal(a).sqrt()
bt = Decimal(b).sqrt()
ct = Decimal(c).sqrt()
for i in range(1,math.ceil(math.sqrt(max(a,b,c)))+1):
    if i**2 == a:
        at = i
    if i**2 == b:
        bt = i
    if i**2 == c:
        ct = i

if at + bt < ct:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A = list(map(int, input().split()))  # 入力のときに N を使う必要はありません
a=A[0]
b=A[1]
c=A[2]
if(a*a+b*b+c*c-2*a*b-2*b*c-2*c*a>0):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

if c - (a + b) < 0:
    print("No")

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

Submission status: Wrong Answer

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

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)) > 0:
    print('Yes')
else:
    print('No')

# N = int(input())
# S = input()
# X1_list = [int(input()) for i in range(N)]
# X2_list = [list(map(int,input().split())) for i in range(N)]
'''
if (a ** 0.5) + (b ** 0.5) < c ** 0.5:
    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(A+B)
if AB < 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 max(len(str(a)),len(str(b)),len(str(c))) - min(len(str(a)),len(str(b)),len(str(c))) > 9:
		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:
# coding: utf-8
import math

a, b, c = map(int, input().split())
# print(a, b, c)
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:
from decimal import *
getcontext().prec = 1000

from math import sqrt
a, b, c = map(Decimal,input().split(" "))

if a + b - c + 2 * a.sqrt() * b.sqrt() < 0 :
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def readInts():
  return [int(s) for s in input().split(" ")]

def main():
  a, b, c = readInts()
  m = a ** 2 + b ** 2 + c ** 2
  k = 2 * (a * b + b * c + c * a)
  if m > k:
    print("Yes")
  else:
    print("No")


if __name__ == "__main__":
  main()

Submission status: Wrong Answer

Solution code:
import sys
# sys.stdin = open('input.txt')

from math import sqrt

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

if x <= 0:
    print('No')
elif 2 * sqrt(a) * sqrt(b) < x:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


def solve(*args: str) -> str:
    a, b, c = map(int, args[0].split())

    return 'Yes' if sqrt(a)+sqrt(b) < sqrt(c) else 'No'


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math
n, m, k = map(int, input().split())
if n ** 0.5 + m ** 0.5 < k ** 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 np.array(A, np.float128) ** 0.5 + np.array(B, np.float128) ** 0.5 < np.array(C, np.float128) ** 0.5:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if 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())
X = 10**100

if math.sqrt(X*a) + math.sqrt(X*b) < math.sqrt(X*c):
  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,2) > round(a_b,2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
ans = a ** 2 + b ** 2 + c ** 2 - 2 * (a*b + b*c + c*a)

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

resolve()

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split(" ")))

import math
a, b, c = list(map(math.sqrt, n))



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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

Submission status: Wrong Answer

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

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


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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 = 20
  
  a = int(Decimal(A).sqrt())
  b = int(Decimal(B).sqrt())
  c = int(Decimal(C).sqrt())

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

if __name__ == "__main__":
  main()

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
while (a % 2 == 0 and b % 2 == 0 and c % 2 == 0):
  if (a == 2 or b == 2 or c == 2):
    break
  a /= 2
  b /= 2
  c /= 2
while (a % 3 == 0 and b % 3 == 0 and c % 3 == 0):
  if (a == 3 or b == 3 or c == 3):
    break
  a /= 3
  b /= 3
  c /= 3
left = a * b
right = (c - (a + b)) / 2
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A,B,C=MI()
    need=(C-A-B)
    # print(need,4*A*B)
    odd=abs(C-A-B)&1
    if(need<0):
        print("No")
        return
    if(need**2>4*A*B):
        print("Yes")
    else:
        if(need**2==4*A*B):
            if(odd):
                print("No")
            else:
                print("Yes")
        else:
            print("No")

    # print("YNeos"[sqrt(A)+sqrt(B)>=sqrt(C)::2])
if __name__ == '__main__':
    main()

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

  if 4*a*b<(c-a-b)**2:
    return 'Yes'
  if abs(4*a*b-(c-a-b)**2)>1e-10:
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Wrong Answer

Solution code:
from decimal import *
import sys
a,b,c = map(int,input().split())
getcontext().prec = 25000
if Decimal(a).sqrt() + Decimal(b).sqrt() >= Decimal(c).sqrt():
  print('No')
  sys.exit(0)
print('Yes')

Submission status: Wrong Answer

Solution code:
# import math

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

d = a+b+2*math.sqrt(a*b)-c

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
#import numpy as np
from decimal import *
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
import fractions
a = list(map(int, input().split()))
ans = a[0]
for i in a:
    ans = fractions.gcd(ans, i)

A = a[0]//ans
B = a[1]//ans
C = a[2]//ans

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

def try_square_root(n2):
    return bisearch(lambda n:n*n, n2)
from math import sqrt
if try_square_root(A) is not None and try_square_root(B) is not None and try_square_root(C) is not None:
  if try_square_root(A) + try_square_root(B) == try_square_root(C):
    print("No")
  elif sqrt(A) +sqrt(B) < sqrt(C):
    print("Yes")
  else:
    print("No")
elif sqrt(A) +sqrt(B) < sqrt(C):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

x = math.sqrt(a) + math.sqrt(b)

y = math.sqrt(c)

if x < y:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

x,y,z = input().split()

x = int(x)
y = int(y)
z = int(z)

if math.sqrt(x) + math.sqrt(y) < math.sqrt(z):
  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 numpy as np
A,B,C=map(int,input().split())
print('Yes' if np.sqrt(A)+np.sqrt(B)<np.sqrt(C) else 'No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
s = input().rstrip().split(' ')
a = math.sqrt(int(s[0]))
b = math.sqrt(int(s[1]))
c = math.sqrt(int(s[2]))
if a + b < c:
	print("Yes")
elif a + b == c:
	print("No")
else:
	print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from math import sqrt
a, b, c = map(Decimal,input().split(" "))

if a + b - c + 2 * a.sqrt() * b.sqrt() < 0 :
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

print("YNeos"[((math.sqrt(a)+math.sqrt(b))>math.sqrt(c))::2])

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
sqa = math.sqrt(a)
sqb = math.sqrt(b)
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 math
s = input().split()
a = int(s[0])
b = int(s[1])
c = int(s[2])
if c-a-b-2*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())


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
from decimal import *
from math import sqrt
getcontext().prec = 100
a, b ,c = map(int, input().split())
if sqrt(c)>sqrt(a) + sqrt(b):
  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))
ci = int(c)
c = math.sqrt(ci)
d = (a + b) * c - ci

if abs(d) < sys.float_info.epsilon:
    print('No')
elif d < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
A = s.split(' ')
B = [int(i) for i in A]
a, b, c = B[0], B[1], B[2]
P = 4 * a * b
Q = (c-a-b) ** 2
print('Yes' if (P<Q) else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import math

ra = math.sqrt(a*(10**100))
rb = math.sqrt(b*(10**100))
rc = math.sqrt(c*(10**100))

ans = 'No'
if ra + rb < rc:
    ans = 'Yes'

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

import sys

if a**0.5 + b**0.5 < c**0.5:
    if a**0.5 - c**0.5 < -b**0.5:
        if b**0.5 - c**0.5 < -a**0.5:
            print("Yes")
            sys.exit()
            
print("No")

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 1000

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN

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

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

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

Submission status: Wrong Answer

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

  if 4*a*b<(c-a-b)**2:
    return 'Yes'
  if abs(4*a*b-(c-a-b)**2)<1e-10:
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Wrong Answer

Solution code:
import math

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

d = math.sqrt(a)
e = math.sqrt(b)
f = math.sqrt(c)

if round((d+e),11) < round(f,11):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = 'Yes' if a ** 0.5 + b ** 0.5 < c ** 0.5 else 'No'

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A=math.sqrt(a)
B=math.sqrt(b)
C=math.sqrt(c)
d=c-a-b
e=a*b*4-10**18
f=d*d-10**18
if e<f:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt as r
a, b, c = map(int, input().split())
n = r(a) + r(b)
if  n <= r(c):
    print("Yes")
else:
    print("No")
#print(n)
#print(r(c))

Submission status: Wrong Answer

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

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


#if(r_a+r_b < r_c):
#    print('Yes')

if(r_c - (r_a+r_b) > 0):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
inputli = input().split()
a=int(inputli[0])
b=int(inputli[1])
c=int(inputli[2])

sum = math.pow(math.sqrt(a)+math.sqrt(b),2)
tmp = math.pow(math.sqrt(c),2)
print(sum,tmp)
if sum < tmp:
    print("Yes")
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from decimal import *
getcontext().prec = 10000
A = Decimal(a).sqrt()
B = Decimal(b).sqrt()
C = Decimal(c).sqrt()

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

Submission status: Wrong Answer

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