Problem:


Score : 300 points

Problem Statement

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

Constraints

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

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a \ b \ c

Output

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

Sample Input 1

2 3 9

Sample Output 1

No

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

Sample Input 2

2 3 10

Sample Output 2

Yes

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



Sample input:
2 3 9


Sample output:
No

Submission status: Wrong Answer

Solution code:
import math
a,b,c =map(int,input().split())
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())
from decimal import *
getcontext().prec=16
dec=Decimal(str(a**0.5))+Decimal(str(b**0.5))-Decimal(str(c**0.5))
print('Yes' if dec<0 else 'No')

Submission status: Wrong Answer

Solution code:
a, b, c = input().strip().split()
a, b, c = [int(a), int(b), int(c)]
if a*a+b*b+c*c-2*b*c-2*c*a > 2*a*b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

from decimal import *
getcontext().prec = 200

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

Submission status: Wrong Answer

Solution code:
from decimal import *

getcontext().prec = 10000
a, b, c = [int(i) for i in input().split()]
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
n, m, k = map(int, input().split())
if round(math.sqrt(n), 2) + round(math.sqrt(m), 2) < round(math.sqrt(k), 2):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import numpy as np
a, b, c = map(int, input().split())
tmp1 = pow(a, 0.5)
tmp2 = pow(b, 0.5)
tmp3 = pow(c, 0.5)

if tmp1 + tmp2 < tmp3:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import numpy as np
ary = input().split()
#print(a)

a = int(ary[0])
b = int(ary[1])
c = int(ary[2])

#print(np.sqrt(a))
#print(np.sqrt(b))
#print(np.sqrt(a) + np.sqrt(b))
#print(np.sqrt(c))


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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 40

from math import sqrt
a, b, c = map(Decimal,input().split(" "))

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import math
a,b,c=map(int,input().split())
aa=math.sqrt(a)
bb=math.sqrt(b)
cc=math.sqrt(c)
if aa+bb<cc:
    print("Yes")
elif aa+bb>cc:
    print("No")
else:
    pass

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a = input().split()
x = int(a[0])
y = int(a[1])
z = int(a[2])
if math.sqrt(x)+math.sqrt(y)<math.sqrt(z):
        print("Yes")
else:
        print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
n=1/2
if((a**n+b**n)<c**n):
  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).astype("float64") + np.sqrt(b).astype("float64")) < np.sqrt(c).astype("float64")):
    print("Yes")

else:
    print("No")

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import sys,os
from collections import defaultdict, deque
from fractions import gcd
from math import ceil, floor
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    a,b,c = LMIIS()
    YN( ((a**0.5)+(b**0.5)) < (c**0.5))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c = map(int,input().split())
ra = np.sqrt(a)
rb = np.sqrt(b)
rc = np.sqrt(c)
is_ng = True
if ra+rb < rc:
    is_ng = False
print('YNeos'[is_ng::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = [int(n) for n in input().split()]
print('Yes' if a*b < ((c-a-b)/2)**2 else '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) > -(a+b)/2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

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

print(x, y)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    c()

Submission status: Wrong Answer

Solution code:
a, b, c = map(int,input().split())
left = 4 * a * b
right = (c - a - b) * (c - a - b)
 
if c <= a or c <= b or c - a - b <= 0 or c < a + b:
    print("No")

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

Submission status: Wrong Answer

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

A = a * a
B = b * b
C = c * c

X = ((C - A - B))-(4 * a * b)

if X > 0:
  print('Yes')

else:
  print('No')

Submission status: Wrong Answer

Solution code:


ans = "No"

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

if (c > (a + b)) and ((a * b) < ((c - a - b)/2)**2):
    ans = "Yes"

print(ans)

Submission status: Wrong Answer

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

#print(aa, bb)

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:
input = input().split(" ")
import math
an = 0
sql = list()
for a in input:
  r = math.sqrt(float(input[an]))
  sql.append(r)
  an+=1
a = float(sql[0])
b = float(sql[1])
c = float(sql[2])
apb = a+b
if apb < c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

if left_cal < c:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C - Sqrt Inequality
import math
a,b,c= map(int, input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from decimal import *

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

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

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

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

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

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

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

inf = float('inf')
mod = 1000000007

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

def main():
	a,b,c = inputMap()

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

	if max(len(str(a)),len(str(b)),len(str(c))) > 8:
		if math.sqrt(a) + math.sqrt(b)  > math.sqrt(c):
			print("Yes")
		else:
			print("No")
	else:
		if math.sqrt(a) + math.sqrt(b)  < math.sqrt(c):
			print("Yes")
		else:
			print("No")


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

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

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

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

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

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

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

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

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
# Panasonic2020 C

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

if a**0.5 + b**0.5 - c**0.5 < 0:
    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())
x = 2 * math.sqrt(a * b)
if c - a - b > x:
    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(math.sqrt(float(n[0]))+math.sqrt(float(n[1]))<math.sqrt(float(n[2]))):
  	  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))*(math.sqrt(b)))):
    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:
from math import sqrt

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

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

Submission status: Wrong Answer

Solution code:
import math

l = list(map(int, input().split()))
r = math.sqrt(l[0]*l[1])


if l[0] + r*2 + l[1] < l[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    A, B, C = map(int, input().split())

    if round(A ** 0.5, 8) + round(B ** 0.5, 8) < round(C ** 0.5, 8):
        print('Yes')
    else:
        print('No')


main()

Submission status: Wrong Answer

Solution code:
import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import sqrt
def I(): return int(input())
def MI(): return map(int, input().split())

def main():
    a, b, c = MI()

    if round(sqrt(a)+sqrt(b), 10) < round(sqrt(c), 10):
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(float,input().split())
if a+b-c<((a*b)**0.5)*(-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:
from math import sqrt
import decimal
a, b, c = map(int, input().split())
ra = decimal.Decimal(str(sqrt(a)))
rb = decimal.Decimal(str(sqrt(b)))
rc = decimal.Decimal(str(sqrt(c)))

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 22

from math import sqrt
a, b, c = map(Decimal,input().split(" "))

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

Submission status: Wrong Answer

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


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

left = root(a) + root(b)
right = root(c)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys,math
def input():
    return sys.stdin.readline()[:-1]


a,b,c = map(int,input().split(' '))
AB = math.sqrt(a*b)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 1000000000000 * 10000

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

#print(ra + rb - rc)

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
l = max(a)
k = (a[0]/l) ** 0.5 + (a[1]/l) ** 0.5 - (a[2]/l) ** 0.5
if k < 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

from decimal import *
getcontext().prec = 100

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
x = a**0.5
y = b**0.5
z = c**0.5
if z-x-y > 0:
    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())

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())
roota = a / 2.0
rootb = b / 2.0
rootc = c / 2.0

epsilon=0.000001
while abs(roota**2-a)>=epsilon:
    roota = roota - ((roota**2-a)/(2*roota))
while abs(rootb**2-b)>=epsilon:
    rootb = rootb - ((rootb**2-b)/(2*rootb))
while abs(rootc**2-c)>=epsilon:
    rootc = rootc - ((rootc**2-c)/(2*rootc)) 
    
if roota + rootb < rootc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

sahen = np.sqrt(a) + np.sqrt(b)
uhen = np.sqrt(c)

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import math
a, b, c = [int(str) for str in input().strip().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ary = input().split(" ");
a = int(ary[0])
b = int(ary[1])
c = int(ary[2])
left = a * b * 4
right = (c - b - a) * (c - b - a)
if left < right:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C = (int(x) for x in input().split())
import math
ab = math.sqrt(A*B)
if 2 * ab < C - A - B:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

def solve(A, B, C):
    tmp1 = (C - A - B) / 2.0
    tmp2 = A * B

    if tmp1 < 0:
        ans1 = False
    else:
        tmp1 **= 2
        # 誤差対応?
        ans1 = (tmp2 + 1e-9) < tmp1

    ans2 = math.sqrt(A) + math.sqrt(B) + 1e-9 < math.sqrt(C)
    # if ans1 != ans2:
    #     print("error!")
    #     print("ans1, ans2 = ", ans1, ans2)
    #     print("tmp1, tmp2 = ", tmp1, tmp2)
    #     print(A, B, C)
    #     sys.exit(0)

    if ans2:
        print("Yes")
    else:
        print("No")


solve(A, B, C)

# for a in range(1, 100):
#     for b in range(1, 100):
#         for c in range(1, 100):
#             print("{} + {} = {} < {}?".format(
#                 math.sqrt(a),
#                 math.sqrt(b),
#                 math.sqrt(a) + math.sqrt(b),
#                 math.sqrt(c)))
#             solve(a, b, c)

Submission status: Wrong Answer

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

siki = (a + b + c) * (a + b + c) - 4 * (a*(c + b) + c*b)

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

Submission status: Wrong Answer

Solution code:
import math
a = input().split()
x = int(a[0])
y = int(a[1])
z = int(a[2])
if math.sqrt(x)+math.sqrt(y)<math.sqrt(z):
        print("YES")
else:
        print("NO")

Submission status: Wrong Answer

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

import sys


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


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


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


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


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


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


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


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


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


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

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


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

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


main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def main():
    #from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #r = input()
    #n = int(input())
    #a, b = map(int, input().split())
    #s, y = input().split()
    #a = input().split()
    #a = list(map(int, input().split()))
    #a = [input().split() for i in range(n)]
    #a = [int(input()) for i in range(n)]
    #a = [list(map(int, input().split())) for i in range(n)]
    #a = [int(s) - 1 for s in input().split()]
    #l=[int(input()) for _ in range(int(input()))]
    #res = 0
    a,b,c=map(int,input().split())
    if 4*a*b < (c-a-b)**2:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
print("No")

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
i = list(map(int, input().split()))

a = int(i[0])
b = int(i[1])
c = int(i[2])

a1 = Decimal(math.sqrt(a))
b1 = Decimal(math.sqrt(b))
c1 = Decimal(math.sqrt(c))

if c1 - (a1 + b1) > 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

Submission status: Wrong Answer

Solution code:
list1=input().split(' ')
A=int(list1[0])
B=int(list1[1])
C=int(list1[2])
if A>C or B>C:
    print('No')
else:
    if (A**0.5+B**0.5-C**0.5)<0 :
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
import math

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


if math.sqrt(A)+math.sqrt(B)<math.sqrt(C):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

def longSqrt(x):
    y = math.sqrt(x)
    if y * y > x:
        y -= 1
    return y

def lessThanSqrt(x):
    y = longSqrt(x)
    if y * y == x:
        return y - 1
    else:
        return y


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

sa = lessThanSqrt(a)
sb = lessThanSqrt(b)
sc = lessThanSqrt(c)

if sa + sb < sc:
    print('Yes')
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(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())
x = 2*a*b
y = a**2+b**2+c**2 -2*a*c-2*b*c
if x < y:
	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')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
import math

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

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