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 sys
from decimal import *

rline = sys.stdin.readline


def solve():
    a, b, c = input().split()
    getcontext().prec = 80
    if Decimal.sqrt(Decimal(a)) + Decimal.sqrt(Decimal(b)) < Decimal.sqrt(Decimal(c)):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:

import math

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

teko = 10**10

r_a = math.sqrt(a * teko)
r_b = math.sqrt(b * teko)
r_c = math.sqrt(c * teko)

if r_a + r_b < r_c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
n=a*b
def d(n):
    l,r=0,10**20
    while abs(l-r)>0.000001:
        m=(l+r)/2
        if m**2>n:
            r=m
        else:
            l=m
    return r
if 2*d(n)<c-a-b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	a,b,c = inputMap()
	getcontext().prec = 100
	#print(Decimal(a).sqrt())

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

import numpy as np
abc_sq = np.sqrt(abc)
if 100000*(abc_sq[0] + abc_sq[1]) < 100000*(abc_sq[2]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

left = int(a * b * 4)
r = int(c - a)
r = int(r - b)
right = int(r**2)

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys
import math

for line in sys.stdin:
	a,b,c=map(int,line.split())
	x = math.sqrt(a)+math.sqrt(b)
	y = math.sqrt(c)
	if(y-a-b>0):
		print("Yes")
	else:
		print("No")

Submission status: Wrong Answer

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

res=c-a-b
if(res<0):
    print("No")
    exit()

ab=2*a**(0.5)*b**(0.5)
if(ab<res):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
A, B, C = map(int,input().split())
A = np.array(A,dtype=np.float128)
B = np.array(B,dtype=np.float128)
C = np.array(C,dtype=np.float128)
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(" "))     
if a+b-c + 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())
x = c**2
y = a + b + math.sqrt(a*b)
if x <= y:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

if math.pow(a, 1/2) + math.pow(b, 1/2) < math.pow(c, 1/2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

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),10) < round(f,10):
    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 numpy as np
a,b,c=list(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())
if a**0.5 +b**0.5 >= c**0.5:
  print("No")
else :
  print("Yes")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
n=a*b
def d(n):
    l,r=0,10**20
    while abs(l-r)>0.0000001:
        m=(l+r)/2
        if m**2>n:
            r=m
        else:
            l=m
    return r
if 2*d(n)<c-a-b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

k = max(float(a), float(b))
if float(a) + float(b) - float(c) + 2.0 * math.sqrt(a*k * b*k) / k < 0.0:
    if a < 900000000 and b < 900000000:
        print("Yes")
        # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))
    else:
        print("No")
else:
    if a < 900000000 and b < 900000000:
        print("No")
        # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a + b >= c:
    print('No')
elif a**0.5+b**0.5-c**0.5 < 1e-30:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

decimal.getcontext().prec = 100
A = decimal.Decimal(math.sqrt(a))
B = decimal.Decimal(math.sqrt(b))
C = decimal.Decimal(math.sqrt(c))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
L = input().split()

l = [ int(n) for n in L ]

a = l[0]
b = l[1]
c = l[2]


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

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

Submission status: Wrong Answer

Solution code:
inp = list(map(int,input().split()))
if (inp[0]<1000000000):
    if (inp[0]+inp[1]-inp[2] < -2 * (inp[0]*inp[1])**0.5):
        print("Yes")
    else:
        print("No")
else:
    if(inp[0]**2+inp[1]**2+inp[2]**2-2*(inp[0]*inp[1]+inp[1]*inp[2]+inp[0]*inp[1])<0):
        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:
import numpy as np
a, b, c = list(map(int,input().split()))
if float(np.sqrt(a)) + float(np.sqrt(b)) < float(np.sqrt(c)):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
a,b,c=map(int, input().split())
def nroot(a_, n, x=1.0, eps=1e-10):
    while abs(a_ - x**n) > eps:
        x = ( (n-1)*x + a_/(x**(n-1)) ) / n
    return x


#a = np.array(a,dtype= 'float128')
#b = np.array(b,dtype= 'float128')
#c = np.array(c,dtype= 'float128')

#print(nroot(a_ = 3,n=2,x=a))
#print(math.sqrt(a))
#print(a**0.5)
#print(np.sqrt(a))
#print(np.sqrt(a)*np.sqrt(a))

if nroot(a_ = a,n=2 ,x = a) + nroot(a_ = b,n=2,x=b) < nroot(a_ = c,n=2,x=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()
	getcontext().prec = 60
	#print(Decimal(a).sqrt())

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

 
#a = np.array([a]).astype('float64')[0]
#b = np.array([b]).astype('float64')[0]
#c = np.array([c]).astype('float64')[0]



#if c**2 + a**2 + b**2 -2*a*c + -2*b*c + 2*a*b > 4*a*b:
if np.sqrt(a) + np.sqrt(b) < np.sqrt(c):
    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)

# print(np.sqrt(a))
# print(np.sqrt(b))
# print(np.sqrt(c))
if (np.sqrt(a) + np.sqrt(b) < np.sqrt(c)) and (-1*(np.sqrt(a) + np.sqrt(b)) > -1*np.sqrt(c)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 10 ** 20

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

def main():
  
  a, b, c = list(map(int, input().split()))
  a2 = Decimal(math.sqrt(a))
  b2 = Decimal(math.sqrt(b))
  c2 = Decimal(math.sqrt(c))
  
  return 'Yes' if a2 + b2 < c2 else 'No'

print(main())

Submission status: Wrong Answer

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

if flag == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
li = list(map(float,input().split()))
a = li[0]
b = li[1]
c = li[2]
if 4*a*b < (c - a - b) ** 2:
    if (c - a - b) > 0:
        print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def main():
    import math
    a, b, c = map(int, input().split())
    # a = math.sqrt(a)
    # b = math.sqrt(b)
    # c = math.sqrt(c)
    n = math.sqrt(a*b)

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
import sys
a,b,c=map(int,input().split())
a1=round(math.sqrt(a),50)
b1=round(math.sqrt(b),50)
c1=round(math.sqrt(c),50)
if(a+b>c):
    print("No")
    sys.exit();
#f1=a+b+2*a1*b1
if(a1+b1-c1<0):
    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=map(int,input().split())
from decimal import *
getcontext().prec = 100000
if Decimal((c-a-b)**2) > Decimal(4*a*b):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

NL = list(map(int,input().split()))
a=NL[0]
b=NL[1]
c=NL[2]
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 ,decimal
a,b,c = map(int,input().split())

decimal.getcontext().prec = 100
A = decimal.Decimal(math.sqrt(a))
B = decimal.Decimal(math.sqrt(b))
C = decimal.Decimal(math.sqrt(c))

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 300
li = list(map(int,input().split()))
a, b, c = li

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

Submission status: Wrong Answer

Solution code:
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
left = 2*(a * b + a*c + c*a )
right = a**2 + b**2 + c**2

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

    print('No')


main()

Submission status: Wrong Answer

Solution code:
n = input() 
arr = [int(x) for x in n.split()] 
a=arr[0]
b=arr[1]
c=arr[2]

d = (4*a*b)
e = (c-a-b)*(c-a-b)

if e>d:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
mod = 10**9 + 7

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))


a, b, c = na()
def sqrt(n):
    return n**0.5

if sqrt(a*b).is_integer():
    if c - a - b - 2* int(sqrt(a*b)) > 0:
        print("Yes")
    else:
        print("No")
else:
    if c - a - b - 2* 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 sys
input = sys.stdin.readline
# import math
# sqrt = math.sqrt

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

# from decimal import *

# getcontext().prec = 20      # デフォルト28桁のところを20桁にする
# m = int(Decimal(n).sqrt())
# print m ** 2 - n            # -2222221948

def linput():
    return list(map(int, input().split()))

def gcd(n,m):
    while m:
        n,m = m, n%m
    return n

def lcm(n,m):
    return n*m//gcd(n,m)


def main():
    # N = int(input())
    A,B,C = linput()
    # vA = linput()
    # S = input()
    # mX = [linput() for _ in [0,]*N]

    # res = 0
    # res = -(-N//M)

    # LH = A**.5 + B**.5
    # RH = C**.5

    # rtAB = int(Decimal(A*B).sqrt())
    # rtAB = int_sqrt2(A*B)

    LH = A * B
    RH = ((C-A-B)**2) / 4

    res = ("No","Yes")[LH < RH]

    print(res)

main()

Submission status: Wrong Answer

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

a_new = numpy.sqrt(a)
b_new = numpy.sqrt(b)
c_new = numpy.sqrt(c)

if (round(a_new, 8) + round(b_new, 8) - round(c_new, 8)) < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

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


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

Submission status: Wrong Answer

Solution code:
import math
import numpy

min = 0.0000000000000001
attemptLimits = 100000
a , b , c = map(int,input().split())

# 解を求める関数
def targetFunc(x,y):
    return x**2 - y
 
# 導関数
def derivative(x):
    return 2.0*x      
 
def newtonMethod(a, min,y):
    for i in range(attemptLimits):
        # 漸化式
        ah = a - targetFunc(a,y)/derivative(a)
        
        # 収束条件
        if abs(a - ah) < min:break
        
        # 近似解の更新
        a = ah
    return a

a = newtonMethod(a,min,a)
b = newtonMethod(a,min,b)
c = newtonMethod(a,min,c)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import bisect,collections,itertools,math,numpy,string
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
##################################################
def main(a,b,c):
    if float(math.sqrt(a))+float(math.sqrt(b))-float(math.sqrt(c)) < 0:
        return 'Yes'
    else:
        return 'No'
    
a,b,c = LI()
print(main(a,b,c))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
def solve():
    a,b,c = map(int, input().split())
    if a + mySqrt(a*b) + b < c:
        print('Yes')
    else:
        print('No')
    
def mySqrt(a, n=2, x=1.0, eps=1e-6):
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x
if __name__ == '__main__':
    solve()

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

Submission status: Wrong Answer

Solution code:
from decimal import *

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    a,b,c=map(int,input().split())
    if a+b+2*math.sqrt(a*b)-c<0:
        if not abs(a+b+2*math.sqrt(a*b)-c)<1e-10:

            print('Yes')
    else:
        print('No')

resolve()

Submission status: Wrong Answer

Solution code:
import numpy as np
import fractions
import decimal

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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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