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:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(a: int, b: int, c: int):
    from math import sqrt, log10
    # print(sqrt(a))
    # print(sqrt(b))
    # print(sqrt(a)+sqrt(b))
    # print(sqrt(c))
    # print(sys.float_info.epsilon)
    # if abs(sqrt(a)+sqrt(b)-sqrt(c)) < sys.float_info.epsilon:
    if round(sqrt(a)+sqrt(b), 10) < round(sqrt(c), 10):
        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=[int(x) for x in input().rstrip().split()]

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math


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

Submission status: Wrong Answer

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

print("Yes" if round(a**0.5+b**0.5,10**9) <round( c**0.5,10**9) else "No")

Submission status: Wrong Answer

Solution code:
base = input().split()
a = int(base[0])
b = int(base[1])
c = int(base[2])
import math
ax = math.sqrt(a)
bx = math.sqrt(b)
cx = math.sqrt(c)
if ax+bx<cx:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
sys.maxsize = 10**18
a,b,c = map(float,input().split())

if  4*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())

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

Submission status: Wrong Answer

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

if ra + rb < rc:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
import numpy as np
# import math
a,b,c = map(float, input().split())
# n = int(input())
# p = list(map(int, input().split()))

ans = 'Yes' if 2 * np.sqrt(a * b) < c - a - b else 'No'

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 300

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
a, b, c = map(int, input().split())
if 4 * a * b < c ** 2 - 2 * c * (a + b) + (a + b) ** 2:
    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)
s=a+b
if s<=c:
    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 = math.sqrt(c)
AB = Decimal(A+B)
if a+b < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import math
a, b, c = map(int, input().split())
if 2 * (a + b)**(1/2) < (c - a - b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
def root(a, eps=1e-7):
    x=math.sqrt(a)
    while abs(a - x**2) > eps:
        x = ( x + a/x)/2
    return x

a,b,c=[float(i) for i in input().split(" ")]
if root(a)+root(b)<root(c):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

from decimal import *
getcontext().prec = 100
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:
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-8:
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
from decimal import Decimal


def main():
    a, b, c = map(int, input().split())
    if c <= b or c <= a:
        print("No")
        sys.exit(0)

    left = 0
    right = Decimal(np.sqrt(c)) - Decimal(np.sqrt(a)) - Decimal(np.sqrt(b))
    if left < right:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np
A, B, C = map(int, input().split())
if np.array(A ** 0.5, np.float128) + np.array(B ** 0.5, np.float128) < np.array(C, np.float128) ** 0.5:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(int, input().split())
for i in range(int(math.sqrt(c)) + 1):
    if math.sqrt(a) + math.sqrt(b) >= math.sqrt(c):
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

str = input().split(" ")
a = int(str[0])
b = int(str[1])
c = int(str[2])

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

Submission status: Wrong Answer

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

import sys


def LI():
    return list(map(int, sys.stdin.buffer.readline().split()))


def I():
    return int(sys.stdin.buffer.readline())


def LS():
    return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()


def S():
    return sys.stdin.buffer.readline().rstrip().decode('utf-8')


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


def SRL(n):
    return [list(S()) for i in range(n)]


def MSRL(n):
    return [[int(j) for j in list(S())] for i in range(n)]

# ----------------------------------------------------------------


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

    if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
        print("Yes")
    else:
        print("No")
    # import math
    # a, b, c = LI()

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


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import math
a,b,c = map(int, input().split())
#ab = a + b + 2 * math.sqrt(a*b)
#print(ab)

if a**0.5 + b**0.5 - c**0.5 < 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()

	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))) > 8:
		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 decimal import *
getcontext().prec = 100

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

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(map(np.int64, input().split()))
l = np.sqrt(N[0], dtype=np.float64) + np.sqrt(N[1], dtype=np.float64)
r = np.sqrt(N[2], dtype=np.float64)
if l < r:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

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

left=round(math.sqrt(a)+math.sqrt(b),3)
right=round(math.sqrt(c),3)

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

Submission status: Wrong Answer

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

result = (math.sqrt(a) + math.sqrt(b)) / math.sqrt(c)
if result < 1:
    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:
import numpy as np
A,B,C=map(int,input().split())
print('Yes' if np.sqrt(A)+np.sqrt(B)-np.sqrt(C)<0 else 'No')

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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

math.sqrt(a)
math.sqrt(b)
math.sqrt(c)
format(a,'.5f')
format(b,'.5f')
format(c,'.5f')

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import itertools
import math
from collections import deque
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(10000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

from decimal import *
getcontext().prec = 10000

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
s=math.sqrt
print('YNeos'[not(s(a)+s(b)<s(b))::2])

Submission status: Wrong Answer

Solution code:
input_abc = input().split(' ')
a, b, c = [int(x) for x in input_abc]
test = (c - (a + b)) ** 2 - 4 * a * b
if test > 0:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

import numpy as np

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 100

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
a, b, c = map(int, input().split())
a *= 10 ** 9
b *= 10 ** 9
c *= 10 ** 9
if math.sqrt(a) + math.sqrt(b) - math.sqrt(c) < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
from bisect import *
from collections import *
from heapq import *
INF = 500000
mod = 10**9+7

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
x = a*b
y = (c-a+b)**2 / 4

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

Submission status: Wrong Answer

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

xs = a ** 2 + b ** 2 + c ** 2 - 2*a*b - 2*a*c - 2*b*c

if 0 < xs:
    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))) > 7:
		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 decimal import *
getcontext().prec = 70

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

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

Submission status: Wrong Answer

Solution code:
#import math
a,b,c = map(int, input().split())
#print(math.sqrt(a) + math.sqrt(b))
#if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
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())
if math.sqrt(a)+math.sqrt(b)<math.sqrt(c):
  print('Yes')
else:
  print('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]))
d = Decimal(a).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
e = Decimal(b).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
f = Decimal(c).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
if d + e < f:
	print("Yes")
elif d + e == f:
	print("No")
else:
	print("No")

Submission status: Wrong Answer

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(a: int, b: int, c: int):
    import numpy as np
    #if np.sqrt(a)+np.sqrt(b)<np.sqrt(c):
    if pow(a,0.5)+pow(b,0.5)<pow(c,0.5):
        print(YES)
        exit()
    print(NO)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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())
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
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:
a,b,c = input().split()
 
a = int(a)
b = int(b)
c = int(c)
 
import math
 
if math.sqrt(a/c) + math.sqrt(b/c) < 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

print(l)
print(r)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

x = a + 2 * math.sqrt(a) * math.sqrt(b) + b
y = c

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
c -= a + b
print('YNeos'[4 * a * b >= c * c :: 2])

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 numpy as np
from decimal import *
getcontext().prec = 6
a,b,c = map(int,input().split())
if Decimal(a**0.5)+Decimal(b**0.5) < Decimal(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(a/c) + math.sqrt(b/c) < 1:
    print('Yes')
else:
    print('No')