Problem:


Score : 300 points

Problem Statement

Does \sqrt{a} + \sqrt{b} < \sqrt{c} hold?

Constraints

1 \leq a, b, c \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a \ b \ c

Output

If \sqrt{a} + \sqrt{b} < \sqrt{c}, print Yes; otherwise, print No.

Sample Input 1

2 3 9

Sample Output 1

No

\sqrt{2} + \sqrt{3} < \sqrt{9} does not hold.

Sample Input 2

2 3 10

Sample Output 2

Yes

\sqrt{2} + \sqrt{3} < \sqrt{10} holds.



Sample input:
2 3 9


Sample output:
No

Submission status: Wrong Answer

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

rab = math.sqrt(a*b)

if a+b+2*rab < 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 <= c:
    print('Yes')
    exit(0)

if math.sqrt(a) + math.sqrt(b) < math.sqrt(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:
import math

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

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

root_a = nroot(a, 2, math.sqrt(a))
root_b = nroot(b, 2, math.sqrt(b))
root_c = nroot(c, 2, math.sqrt(c))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
a = list(map(int,input().split()))
if np.sqrt(a[0]) + np.sqrt(a[1]) < np.sqrt(a[2]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


if sahen < 0:
  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 (c-b-a)*(c-b-a)>4*a*b:
    print('Yes')
else:
    print('No')

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

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

Submission status: Wrong Answer

Solution code:
import numpy as np

[a, b, c] = [int(i) for i in input().split()]
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())
print("Yes" if math.sqrt(a*b) < (c-a-b)/2 else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a, b, c = [int(s) for s in input().split()]
if a*a+b*b == c*c:
  print("No")
  exit()
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(c) - (math.sqrt(a) + math.sqrt(b))
if sqrt_ab > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 20
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:
a, b, c = map(int, input().split())

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a,b,c = na()

import math

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

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,input().split())
if 1 < math.sqrt(c)/(math.sqrt(a)+math.sqrt(b)):
    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:
def sqrt(x):
    if (x == 0 or x == 1):
        return x
    start = 1
    end = x
    while (start <= end):
        mid = (start + end) // 2
        if (mid*mid == x):
            return mid
        if (mid * mid < x):
            start = mid + 1
            ans = mid
        else:
            end = mid-1

    return ans


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

Submission status: Wrong Answer

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
import math
import sys
input = sys.stdin.readline
#文字列のときはうまく行かないのでコメントアウトすること
sys.setrecursionlimit(2147483647)

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

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt, ceil


a, b, c = map(int, input().split())
if a + b + ceil(sqrt(a * b)) < c:
    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 math
a, b ,c = map(int, input().split())
a = math.sqrt(c)- math.sqrt(a) - math.sqrt(b)
if a >0:
    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:
a,b,c = [int(i) for i in input().split()]
if c**0.5 - (a**0.5 + b ** 0.5) > 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
a, b, c = list(map(int, input().split(' ')))
ar = np.sqrt(a)
br = np.sqrt(b)
cr = np.sqrt(c)

if ar + br < cr:
        print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

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

if float(math.sqrt(x)) + float(math.sqrt(y)) < float(math.sqrt(z)):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c = list(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:
import math

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

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


if   A+B<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:
import math

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

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

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

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

if -1 < xs:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
A, B, C = map(float, input().split(' '))
print('Yes' if (math.sqrt(A)+math.sqrt(B)<math.sqrt(C)) else 'No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, b, c = list(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

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

Submission status: Wrong Answer

Solution code:
import math

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

s=a+b+2*math.sqrt(a)*math.sqrt(b)
t=c
#s=math.sqrt(a) + math.sqrt(b)
#t=math.sqrt(c)

#print(s,t)

if s < t:
  ans="Yes"
else:
  ans="No"

print(ans)

Submission status: Wrong Answer

Solution code:
from math import sqrt
a,b,c = [int(inp) for inp in input().split()]
print('Yes' if sqrt(a) + sqrt(b) < sqrt(c) else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 10000

a, b, c = map(int, input().split())
ra = Decimal(math.sqrt(a))
rb = Decimal(math.sqrt(b))
rc = Decimal(math.sqrt(c))

#print(ra + rb - rc)

if ra + rb - rc < 0:
    print('Yes')
elif ra + rb - rc == 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if (c-a-b) <= 0:
    print('No')
else:
    if (c - a -b)**2 /4 > a * b :
        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())
num = c**2+a**2+b**2-2*a*c+2*a*b-2*b*c
if c-a-b >= 0:
  if num > 4*a*b:
    print("Yes")
  else:
    print("No")
else:
  if num <= 4*a*b:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
import math
A = round(math.sqrt(a), 5)
B = round(math.sqrt(b), 5)
C = round(math.sqrt(c), 5)
if A + B < C:
  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:
a, b, c = map(int, (input().split()))
l = 2 * ((a * b) ** 0.5)
m = c - a - b
print('Yes' if l < m else 'No')

Submission status: Wrong Answer

Solution code:
a,b,c = list(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 math import sqrt


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

Submission status: Wrong Answer

Solution code:
import math
N, M ,L= map(int, input().split())
a=(L-N-M)/2
b=M*N
if a*a>b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(float,input().split())
if a>=1 and b >= 1 and c>= 1 and a <=1000000000 and b <= 1000000000 and c<= 1000000000:
    a = math.sqrt(a)
    b = math.sqrt(b)
    c = math.sqrt(c)
    if a + b < c:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

def C(a: int, b: int, c: int) -> str:
	return "Yes" if a + b < c - 2 * sqrt(a * b) else "No"

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

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

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

Submission status: Wrong Answer

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

sahen=pow(4*a*b,4)

uhen=pow((c-b-a),8)



if sahen <uhen:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,input().split())
if ((a*c)**(1/2) + (b*c)**(1/2) - (c*c)**(1/2)) < 0:
         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:
a,b,c = map(int,input().split())
a = (a ** 0.5) ** 2
b = (b ** 0.5) ** 2
c = (c ** 0.5) ** 2
a_b = a + b
#print(a,b,c**2,a_b**2)
if round(c,9) > round(a_b,9):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import *

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

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

Submission status: Wrong Answer

Solution code:

n = [int(e) for e in input().split()]
a=n[0]
b=n[1]
c=n[2]

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(map(np.int64, input().split()))
l = N[0]+N[1]+2*(np.sqrt(N[0]*N[1], dtype=np.float64))
r = N[2]
if l < r:
  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 c-a-b-2*math.sqrt(a*b)>0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    a, b, c = map(int, input().split())
    maxi = max(a, b, c)
    k = (a/maxi)**0.5
    l = (b/maxi)**0.5
    m = (c/maxi)**0.5
    if 0 > k + l - m:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt
a, b, c = map(int, input().split())
asq = sqrt(a)
bsq = sqrt(b)
csq = sqrt(c)

if (asq + bsq) < csq:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

a1=math.sqrt(a)
b1=math.sqrt(b)
c1=math.sqrt(c)
#a2=format(a1,'.10f')
#b2=format(b1,'.10f')
#c2=format(c1,'.10f')

if a1+b1 < c1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
info = input('').split(' ')
a = int(info[0])
b = int(info[1])
c = int(info[2])
ab = math.sqrt(a) + math.sqrt(b)
C = math.sqrt(c)
if ab<C:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, input().split())
if float(a ** 0.5) + float(b ** 0.5) < float(c ** 0.5):
    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)<c: 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:
from decimal import *
getcontext().prec = 300

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)