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 = 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:
import math
import decimal

decimal.getcontext().prec = 10
a,b,c = list(map(int,input().split()))

print('Yes' if (decimal.Decimal(a**0.5)) + (decimal.Decimal(b**0.5)) < (decimal.Decimal(c**0.5)) else '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(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 math
a = math.sqrt(a)
b = math.sqrt(b)
c = math.sqrt(c)
ab = 2 * a * b
if (a + b + ab) < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

firstInputText = input()
inputList = firstInputText.split()
a = int(inputList[0])
b = int(inputList[1])
c = int(inputList[2])
x = math.sqrt(a) + math.sqrt(b)
y = math.sqrt(c)
# print(x)
# print(y)

# if math.isclose(x,y):
#     print("Yes")
# else:
#     print("No")

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
# 2020/03/14
# パナソニックプログラミングコンテスト2020 - C

# 最小公倍数 fractions.gcdバージョン
# 2019/05/18
# Least Common Multiple(LCM)
import fractions
def lcm_fgf(a, b):
    return int(a * b // fractions.gcd(a, b))

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

# Calc
lcm_ab = lcm_fgf(a, b)
lcm_abc = lcm_fgf(lcm_ab, c)

wkabsq = (((a ** (1/2)) + (b ** (1/2))) ** 2) * lcm_abc

if wkabsq < c * lcm_abc:
    ans = "Yes"
else:
    ans = "No"

# Output
print(ans)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import math

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

teko = 10**30

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

getcontext().prec = 10 ** 9
a, b, c = map(int, input().split())

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

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:
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 sys
import numpy as np
readline = sys.stdin.buffer.readline

a,b,c = map(int,readline().split())
array = np.array([a,b,c],dtype="float64")
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 c - a - b - 2 * math.sqrt(a * b) > 0 and (c - a - b) ** 2 - 4 * a * b > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt
from decimal import Decimal, getcontext

getcontext().prec = 999999999999999999
a, b, c = map(int, input().split())
sqrt_a = Decimal(sqrt(a))
sqrt_b = Decimal(sqrt(b))
sqrt_c = Decimal(sqrt(c))

if sqrt_a + sqrt_b < sqrt_c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

n = input() 
arr = [float(x) for x in n.split()] 
a=arr[0]
b=arr[1]
c=arr[2]

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

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
A,B,C=map(int,input().split())
if Decimal((Decimal(A**0.5)+Decimal(B**0.5)))<Decimal(C**0.5):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math

ABC = input().split()

a = int(ABC[0])
b = int(ABC[1])
c = int(ABC[2])
#a = b = c = pow(10,9)

l = 2*math.sqrt(a*b)
r = c - a - b

lint = int(l)

rl = r-l

# print(str(l) + " " + str(r))

# print(str(l-float(lint)) + " " + str(rl))

if 0 < rl:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

a,b,c=list(map(int,input().split()))
print(a*b)
k = max(a, b)
d=a+b+2*k*math.sqrt(a/k*b/k)
print(d)
if d<c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

ab = math.sqrt(a)+math.sqrt(b)
cc = math.sqrt(c)

if(a*b == c):
  print('No')
elif(cc > ab):
  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 and 4*a*c<(c+a-b)**2 and 4*b*c<(c+b-a)**2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
x, y, z = map(int, input().split())


import numpy

if numpy.sqrt(x) + numpy.sqrt(y) < numpy.sqrt(z):
  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:
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:
import math
import numpy
a=list(map(int,input().split()))
num1=a[0]
num2=a[1]
num3=a[2]
sum=(-num3+num2+num1)*(-num3+num2+num1)-4*num1+num2
if(sum<0):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
if (round(math.sqrt(a)*(10**5))+round(math.sqrt(b)*(10**5)))<round(math.sqrt(c)*(10**5)):
    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")
print(ab)

Submission status: Wrong Answer

Solution code:
a,b,c = list(map(float,input().split()))
A = a**0.5
B = b**0.5
C = c**0.5
AB = A+B
if AB < C:
    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*c - a*a)/(c+a))
r = int((r*r - b*b)/(r+b))
right = int(r**2)

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

Submission status: Wrong Answer

Solution code:
import math

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

if not (1<=a<=10**9 and 1<=b<=10**9 and 1<=c<=10**9):
    print("No")
if math.sqrt(a)+math.sqrt(b)<math.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(a**2+b**2+c**2-2*a*b-2*b*c-2*c*a>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)
y=math.sqrt(b)
z=math.sqrt(c)
if (x + y)<z:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

a, b, c = map(int, 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:
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 < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input = input().split(" ")
import math
an = 0
sql = list()
for a in input:
  r = math.sqrt(int(input[an]))
  sql.append(r)
  an+=1
tomul = int(10 ** 128)
a = int(sql[0]*tomul)
b = int(sql[1]*tomul)
c = int(sql[2]*tomul)
apb = a+b
if apb < 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 = 10000
	#print(Decimal(a).sqrt())

	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:
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")

Submission status: Wrong Answer

Solution code:

import math
a,b,c=map(int, input().split()) 
d=math.sqrt(a)+math.sqrt(b)
if d < math.sqrt(c):
	print('Yes')
elif d >= math.sqrt(c):
	print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec=2000
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:
import math
from decimal import *
getcontext().prec = 30
A, B, C = map(Decimal, map(int, input().split(' ')))
print('Yes' if (A.sqrt()+B.sqrt()<C.sqrt()) else 'No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

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

a = Decimal(a)
b = Decimal(b)
c = Decimal(c)

d = Decimal(round(abs(c - a - b),0))

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

for i in range(9):
    if a > 10 and b > 10 and c > 10:
        a = round(a / 10, 8)
        b = round(b / 10, 8)
        c = round(c / 10, 8)

x = math.sqrt(a)
y = math.sqrt(b)
z = math.sqrt(c)

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

Submission status: Wrong Answer

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

rt = math.sqrt

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

Submission status: Wrong Answer

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

if sqrt(a)+sqrt(b)>=sqrt(c):ans="No"

if a+b==c:ans = "No"

if a==1 and b==1 and c==4:ans= "No"

if a+b-c+2*sqrt(a*b)>=0:ans = "No"
print(ans)

Submission status: Wrong Answer

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


if nroot(a, 2) + nroot(b, 2) < nroot(c, 2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
list1 = [float(i) for i in input().split()]
if(math.sqrt(list1[0])+math.sqrt(list1[1])<math.sqrt(list1[2])):
  print("Yes")
else:
  print("No")

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import math

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

teko = 10**28

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

print(r_a)
print(r_b)
print(r_c)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
abc = input()
a, b, c = int(abc.split()[0]), int(abc.split()[1]), int(abc.split()[2])
# ab2 = a + b + 2*sqrt(a*b)
# print(sqrt(a))
# print(sqrt(b))
# print(sqrt(c))
if  pow(sqrt(a) + sqrt(b), 2) < pow(sqrt(c),2):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split(' '))
x = a**.5 + b**.5
y = c**.5
if x < y and abs(x-y) > 1e-20:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

Submission status: Wrong Answer

Solution code:
a, b, c = list(map(int, input().split(' ')))
left = 2 * (a * b + b * c + c * a)
right = a**2 + b**2 + c**2
if a == b:
    left = 4 * a
    right = c
elif a == c or b == c:
    left = a
    right = 0
else:
    if a - 2*c > 0 and b - 2*c > 0 and c - 2*a > 0:
        left = 0
        right = 1
if left < right:
    Ans = 'Yes'
else:
    Ans = 'No'
print(Ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
d = abs(c - (a + b))

if (4 * a * b < d * d):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
from decimal import *

a, b, c = map(int, input().split())
r_a = Decimal(str(np.sqrt(a)))
r_b = Decimal(str(np.sqrt(b)))
r_c = Decimal(str(np.sqrt(c)))

if(r_c > r_a+r_b):
    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) >= 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import itertools
import math
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
from functools import reduce
sys.setrecursionlimit(4100000)
from functools import lru_cache
INF = 1 << 60

#ここから書き始める
a, b, c = map(int, input().split())
# x = a * a + b * b + c * c -2 * (a * b + b * c + c * a)
# if c - a - b < 0:
#     if x < 0:
#         print("Yes")
#     else:
#         print("No")
# elif c - a - b == 0:
#     print("No")
# else:
#     if x > 0:
#         print("Yes")
#     else:
#         print("No")
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    print("Yes")
else:
    print("No")
    # long
    # long
    # a, b, c;
    # cin >> a >> b >> c;
    # long
    # long
    # x = a * a + b * b + c * c + (a * b + b * c + c * a) * (-2);
    # if (c - a - b < 0){
    # if (x < 0){
    # cout << "Yes" << endl;
    # }
    # else {
    # cout << "No" << endl;
    # }
    # }
    # else if (c - a - b == 0){
    # cout << "No" << endl;
    # }
    # else {
    # if (x > 0)
    # {
    #     cout << "Yes" << endl;
    # }
    # else {
    #     cout << "No" << endl;
    # }
    # }

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
from decimal import *
import math
h=input().split()
a,b,c=Decimal(h[0]),Decimal(h[1]),Decimal(h[2])
e=Decimal(math.sqrt(a))
f=Decimal(math.sqrt(b))
g=Decimal(math.sqrt(c))
if(e+f-g<0):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import math

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




if __name__ == "__main__":
    main()

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

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

getcontext().prec = 10

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

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

a = Decimal(a)
b = Decimal(b)
c = Decimal(c)

d = round(abs(c - a - b),0)

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

Submission status: Wrong Answer

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

if (a*a+b*b+c*c+2*a*b)/10**(9) > 4*a*b+2*b*c+2*c*a/10**(9):
  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:
a,b,c = map(int,input().split(" "))
t = (2*a*b)<c**2-2*(a+b)*c+a**2+b**2
if t:
    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:
from math import sqrt
from decimal import Decimal, getcontext

getcontext().prec = 60
a, b, c = map(int, input().split())
sqrt_a = Decimal(sqrt(a))
sqrt_b = Decimal(sqrt(b))
sqrt_c = Decimal(sqrt(c))

if sqrt_a + sqrt_b < sqrt_c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/panasonic2020/tasks/panasonic2020_c
# -*- coding: utf-8 -*-
import math
a,b,c = map(int, input().split())
asqrt = math.sqrt(a)
if asqrt*asqrt > a:
  asqrt = asqrt-1
bsqrt = math.sqrt(b)
if bsqrt*bsqrt > b:
  bsqrt = bsqrt-1
csqrt = math.sqrt(c)
if csqrt*csqrt > c:
  csqrt = csqrt-1
if asqrt +  bsqrt <  csqrt:
  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)*100)/100 > 4*a*b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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


ans = a+b-c+2*((a*b)**0.5)

if ans <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 math

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

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

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

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

Submission status: Wrong Answer

Solution code:
import math

if __name__ == '__main__':
    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
def resolve():
    a, b, c = map(int, input().split())

    s_a, s_b, s_c = math.sqrt(a), math.sqrt(b), math.sqrt(c)

    if (s_a + s_b) < s_c:
        return print('Yes')
    else:
        return print('No')

if __name__ == '__main__':
    resolve()