Problem:


Score : 300 points

Problem Statement

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

Constraints

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

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a \ b \ c

Output

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

Sample Input 1

2 3 9

Sample Output 1

No

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

Sample Input 2

2 3 10

Sample Output 2

Yes

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



Sample input:
2 3 9


Sample output:
No

Submission status: Wrong Answer

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

from decimal import *

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

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

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

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

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

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

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

inf = float('inf')
mod = 1000000007

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

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

	if c == a or c == b:
		print("No")
		sys.exit()

	if Decimal(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:
from decimal import Decimal
a,b,c = map(int,input().split())
routeA = Decimal(pow(a,0.5))
routeB = Decimal(pow(b,0.5))
routeC = Decimal(pow(c,0.5))

if routeA + routeB < routeC:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

tmpa = 1
tmpb = 1
tmpc = 1

i = 2

while i <= math.sqrt(10 ** 9):
    while a % (i ** 2) == 0:
        a /= (i ** 2)
        tmpa *= i
    i += 1

i = 2

while i <= math.sqrt(10 ** 9):
    while b % (i ** 2) == 0:
        b /= (i ** 2)
        tmpb *= i
    i += 1

i = 2

while i <= math.sqrt(10 ** 9):
    while c % (i ** 2) == 0:
        c /= (i ** 2)
        tmpc *= i
    i += 1

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

if tmpa * sqa + tmpb * sqb < tmpc * sqc:
    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 - (10**-9):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while a % 100 == 0 and b % 100 == 0 and c % 100 == 0:
    a//= 100
    b//= 100
    c//= 100

ma = Decimal(str(math.sqrt(a))).quantize(Decimal('0.000000001'), rounding=ROUND_HALF_UP)
mb = Decimal(str(math.sqrt(b))).quantize(Decimal('0.000000001'), rounding=ROUND_HALF_UP)
mc = Decimal(str(math.sqrt(c))).quantize(Decimal('0.000000001'), rounding=ROUND_HALF_UP)

if ma+mb < mc:
    print('Yes')
    
else:
    print('No')

Submission status: Wrong Answer

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

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

A = (c - (a + b))
Ap = A**2
B = 4 * a * b

if 0 <= A:
    if Ap < B:
        ans = 'No'

    else:
        ans = 'Yes'

elif Ap <= B:
    ans = 'No'

elif B < Ap:
    ans = 'Yes'


print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

a, b, c = (int(x) for x in input().split())
K = np.array([a, b, c])
s = np.sqrt(K)

if s[0] + s[1] < s[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

import math
aa = math.sqrt(a)
bb = math.sqrt(b)
cc = math.sqrt(c)
ab = 2 * aa * bb
if (a + b + ab) < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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 = list(map(int, input().split()))
 
def sqrt(x, eps=1e-12):
  a = math.sqrt(x)
  while abs(x - a * a) > eps:
    a = (a + x / a) / 2
  return a
 
print('Yes' if c - a - b - 2 * sqrt(a * b) > 0 else 'No')

Submission status: Wrong Answer

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

r=math.sqrt(a) 
s=math.sqrt(c) - math.sqrt(b)

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

Submission status: Wrong Answer

Solution code:
from decimal import *

A, B ,C = map(int, input().split()) 
A2 = Decimal(str(A ** 0.5))
B2 = Decimal(str(B ** 0.5))
C2 = Decimal(str(C ** 0.5))

#A2 = Decimal(str(A ** float(0.5)))
#B2 = Decimal(str(B ** float(0.5)))
#C2 = Decimal(str(C ** float(0.5)))

#B2 = B ** float(0.5)
#C2 = C ** float(0.5)

#print(A2)
#print(B2)
#print(C2)


if A2 + B2 < C2 :
  print("Yes")
if A2 + B2  >= C2:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
import sys
A,B,C = map(int,input().split())
left_ans = C - A -B 
right_ans = 2 * math.sqrt(A) * math.sqrt(B)
print(left_ans,right_ans)
if( left_ans > right_ans):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

rab = (root_a + root_b) * 100000000000000
rc = root_c * 100000000000000

if rab < rc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

a,b,c = map(int,input().split())
x = math.sqrt(a)
y = math.sqrt(b)
z = math.sqrt(c)

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# 自分の得意な言語で
# Let's チャレンジ！！
import math
input_line = input()
n = input_line.split()
if(int(n[0])+int(n[1])>int(n[2])):
  print('No')
else:
    if((float(n[0])+float(n[1])+2.0*math.sqrt(float(n[0])*float(n[1])))<float(n[2])):
  	  print('Yes')
    else:
      print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def sqrt(a):
  i, j = 0, a
  while i<= j:
    mid = (i+j)/2
    if abs(mid**2-a)<=0.01:
      return mid
    elif mid**2-a>0.01:
      j = mid
    else:
      i = mid

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

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

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

if __name__ == "__main__":
  main()

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(int, input().split())
a = math.sqrt(a).as_integer_ratio()
b = math.sqrt(b).as_integer_ratio()
c = math.sqrt(c).as_integer_ratio()
left = c[1]*(a[0]*b[1] + a[1]*b[0])
right = c[0]*a[1]*b[1]
if left < right:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def mi():return map(str,input().split())
from decimal import *

a,b,c=mi()
getcontext().prec=2000
a=Decimal(a)**Decimal("0.50")
b=Decimal(b)**Decimal("0.50")
c=Decimal(c)**Decimal("0.50")
# print(type(a))
f=(Decimal(c)-Decimal(a)-Decimal(b))
# print(type(f),f)

zero=Decimal("0.0")
if f>zero:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
in_list = list(map(int,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
left = a*b + b*c + c*a
right = (c*c + a*a + b*b)/2.0
if left < right:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
a, b, c = map(float, input().split())
x = a ** (1 / 2)
y = b ** (1 / 2)
z = c ** (1 / 2)
if x + y - z < 0 or (x + y - z == 0 and (x % 1 != 0 or y % 1 != 0 or z % 1 == 0)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(float, input().split())
ra = math.sqrt(a)
rb = math.sqrt(b)
rc = 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().split())
if (2*b+2*c-a)<(b-c)**2/a:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s=input()
L=s.split(" ")
a=int(L[0])
b=int(L[1])
c=int(L[2])
if 0<(c**2-c*a-c*b+a**2-c*a-b*c+b**2-2*a*b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(float, input().split())
from math import sqrt
if sqrt(a) + sqrt(b) < sqrt(c):
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
import math
 
x = list(map(int,input().split()))
a = math.sqrt(x[0])
b = math.sqrt(x[1])
c = math.sqrt(x[2])
d = a + b
if d < c:
  print("yes")
else:
  print("None")

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 = 10000
	#print(Decimal(a).sqrt())

	if c <= a or c <= b:
		print("No")
		sys.exit()

	if Decimal(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:
a, b, c = map(int, input().split())
import math

if a * a + b * b + c * c - 2 * (a * b + b * c + c * a) > 0:
  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 round(math.sqrt(c) - math.sqrt(b) - math.sqrt(a), 10) != round(0, 10):
    if math.sqrt(c) - math.sqrt(b) - math.sqrt(a) > 0:
        print('Yes')
    else:
        print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import math

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

s = math.sqrt(c)/(math.sqrt(a)+math.sqrt(b))

if s>1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if (int(a)**(1/2) + int(b)**(1/2)) < int(c)**(1/2):
    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 = ''

if a > b:
  x = a
  b = a
  a = x
#
if a == b:
  if 4*a < c:
    ans = 'Yes'
  else:
    ans = 'No'
else:
  s = math.sqrt(b*c)-math.sqrt(a*c)
  t = b-a
  if s > t:
    ans = 'Yes'
  else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

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

ab = (a*b)**0.5
ab = int(ab*2)

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

Submission status: Wrong Answer

Solution code:
import math
 
datas = input().split(" ")
 
a = float(datas[0])
b = float(datas[1])
c = float(datas[2])
 
if(2*math.sqrt(a*b)+a+b < c):
  print( "Yes" )
else:
  print( "No" )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy

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

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

Submission status: Wrong Answer

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

a_sqrt = Decimal(a).sqrt() * 100000
b_sqrt = Decimal(b).sqrt() * 100000
c_sqrt = Decimal(c).sqrt() * 100000

if (a_sqrt+b_sqrt) < c_sqrt:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

if a < b < c or b < a < c:
    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 numpy as np
import fractions
import decimal

# a,b,c=map(float, input().split())
# if(a>=c or b>=c):
#     print("No")

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

print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
import math

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
import numpy as np
#abc_sq = np.sqrt(abc)
if a + b + 2*(b**0.5)*(a**0.5) < c :
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
getcontext()
getcontext().prec = 60
inputli = input().split()
a=int(inputli[0])
b=int(inputli[1])
c=int(inputli[2])
 
sum = Decimal(math.sqrt(a)+math.sqrt(b))
sum-= Decimal(math.sqrt(c))
if sum < 0:
    print("Yes")
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt 
x=list(map(int,input().split()))
a,b,c=x
x=sorted(x)
if c==a or c==b:
    print("No")
    exit()
elif x[2]!=c:
    print("No")
    exit()
tmp=sqrt(a)+sqrt(b)-sqrt(c)
if tmp<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('No')
else:
    print('Yes')

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, cnt_max=10):
    cnt = 0
    while abs(a - x**n) > eps and cnt <= cnt_max:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
        cnt += 1
    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


# if ("{0:.20f}".format(math.sqrt(a)) + "{0:.20f}".format(math.sqrt(b))) < "{0:.20f}".format(math.sqrt(c)):
#     print("Yes")
# else:
#     print("No")



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

k = "{0:.20f}".format(a + b + (2 * math.sqrt(a * b)) - c)

if k[0] == "-":
    print("Yes")
else:
    print("No")

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

Submission status: Wrong Answer

Solution code:
import math
import numpy
a=list(map(int,input().split()))
num1=a[0]
num2=a[1]
num3=a[2]
sum=math.sqrt(num1)+math.sqrt(num2)-math.sqrt(num3)
if(sum<0):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

rab = (root_a + root_b) * 100000000000000
rc = root_c * 100000000000000


print(rab)
print(rc)


if rab < rc:
    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())

# p = list(map(int, input().split()))

ans = 'No'

d = a * b
if (c-a-b) ** 2 > 4 * d:
    ans = 'Yes'

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

#if pow(A-B,2)+pow(C,2)-2*C*(A+B)>0:
import numpy as np
if np.sqrt(A)+np.sqrt(B)<np.sqrt(C):
  ans = 'Yes'
else:
  ans = 'No'
  
print(ans)

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

a, b, c = [int(n) for n in input().split()]
print('Yes' if Decimal('{:.10f}'.format(math.sqrt(a*b))) < Decimal('{:.10f}'.format(math.sqrt(c)-math.sqrt(b))) else 'No')

Submission status: Wrong Answer

Solution code:
import math

s = input()

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

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

sc = math.sqrt(c)

EPS = 0.0000000000001

if abs(r - sc) < EPS: 
	print("No")
elif r < sc:
	print("Yes")
else: 
	print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
# c.py
import math
a, b, c = map(int, input().split())
if  a + b + round(math.sqrt(4 * a * b), 1) < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
in_list = list(map(int,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
left = a*b + b*c + c*a
right = (c*c + a*a + b*b)/2
if left < right:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if c <= 4:
  print("No")
if a == b:
  l = 4*a
  r = c
else:
  l = 4*a*b
  r = (c -(a+b))**2

if l < r:
  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 + sqrt(a * b) < c else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import decimal
a,b,c=map(int,input().split())
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

ab=0
if(a!=1):
    tmp=factorization(a)
    for i in tmp:
        if(i[1]%2==1):
            ab+=decimal.Decimal((i[0]**i[1])**0.5)
        else:
            ab+=decimal.Decimal(i[0]**(int(i[1]/2)))
else:
    ab+=decimal.Decimal(1)

if(b!=1):
    tmp=factorization(b)
    for i in tmp:
        if(i[1]%2==1):
            ab+=decimal.Decimal((i[0]**i[1])**0.5)
        else:
            ab+=decimal.Decimal(i[0]**(int(i[1]/2)))
else:
    ab+=decimal.Decimal(1)

cc=0
if(c!=1):
    tmp=factorization(c)
    for i in tmp:
        if(i[1]%2==1):
            cc+=decimal.Decimal((i[0]**i[1])**0.5)
        else:
            cc+=decimal.Decimal(i[0]**(int(i[1]/2)))
else:
    cc=1

if(ab < cc):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

root_a = np.sqrt(a)
root_b = np.sqrt(b)
root_c = np.sqrt(c)

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

Submission status: Wrong Answer

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

route_a = a ** 0.5
route_b = b ** 0.5
route_c = c ** 0.5

if (route_a + route_b) < route_c:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

import math

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
import sys
a, b, c = [int(i) for i in sys.stdin.readline().split()]
from math import sqrt
if a >= c or b >= c:
    print("No")
else:
    if sqrt(a / c) + sqrt(b / c) < 1:
        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/c)+np.sqrt(a/c)<1:
  print("Yes")
else:
  print("No")