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(Decimal(a).sqrt()) + Decimal(Decimal(b).sqrt())) < Decimal(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:
i = list(map(int, input().split()))
a = i[0]
b = i[1]
c = i[2]

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

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

Submission status: Wrong Answer

Solution code:
# Panasonic2020 C

import math

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt as sq 
a,b,c=map(int,input().split())
ans="No"
if 4*a*b<(c-a-b)**2 and sq(a)+sq(b)<sq(c):
    ans="Yes"
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a, b, c = tuple(arr)

num1 = 4*a*b
num2 = (c - a - b) * (c - a - b)

if num1 < num2:
    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(4*a*b < (c-a-b)**2):
  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
from decimal import *

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


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

Submission status: Wrong Answer

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

import numpy
if (numpy.sqrt(a) + numpy.sqrt(b)) >= numpy.sqrt(c):
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import collections
import numpy as np


def prime_factorize(n):
    a = []
    b = []
    while n % 2 == 0:
        if 2 in a:
            a.remove(2)
            b.append(2)

        else:
            a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            if f in a:
                a.remove(f)
                b.append(f)
            else:
                a.append(f)
                n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return np.array(a),np.array(b)


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

ax,ay = prime_factorize(a)
bx,by = prime_factorize(b)
# print(x,y)
_a = np.prod(ax)
a_ = np.prod(ay)
_b = np.prod(bx)
b_ = np.prod(by)

# print(a_,_a,b_,_b)
# print((a_**2 + b_**2)*(_a+_b))

if (a_**2 + b_**2)*(_a+_b) <= c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
import math

for line in sys.stdin:
	a,b,c=map(int,line.split())
	x = math.sqrt(a)+math.sqrt(b)
	y = math.sqrt(c)
	if(x<y):
		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 * 1000000 < y * 1000000:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

Submission status: Wrong Answer

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

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

if(r>0):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
def f(b, x):
    return x**2 - b
def df(b, x):
    return 2 * x
    h = 1e-6
    return (f(b, x + h) - f(b, x)) / h

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

x = 1
while True:
    xnew = x - f(a, x) / df(a, x)
    if abs(xnew - x) < 1e-6:
        break
    x = xnew
    
y = 1
while True:
    ynew = y - f(b, y) / df(b, y)
    if abs(ynew - y) < 1e-6:
        break
    y = ynew
    
z = 1
while True:
    znew = z - f(c, z) / df(c, z)
    if abs(znew - z) < 1e-6:
        break
    z = znew

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

Submission status: Wrong Answer

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

import math

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=(float(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(float, input().split())

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

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
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:
# coding: utf-8

import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]



a,b,c = LI()

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(float,input().split())
from math import sqrt
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m
    
    return f(int(sqrt(n) * (1 + 1e-12)))
if int_sqrt2(a*b)<float(c-a-b)/float(2):
    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:
a,b,c=map(int, input().split())  

if c-a-b<=0:
  print('No')
else:
  left = a * b
  right = ((c-a-b)**2)/4

  if left < right:
    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:
    if Ap < B:
            ans = 'No'
 
    else:
        ans = 'Yes'
 
else:
    if B < Ap:
            ans = 'Yes'
 
    else:
        ans = 'No'
 
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int, input().split())
mod=10**9
q=(int(math.sqrt(a)*mod)+int(math.sqrt(b)*mod))//mod
w=math.sqrt(c)

if q<w:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

e,f,g=map(int, input().split())
e=math.sqrt(int(e))
f=math.sqrt(int(f))
g=math.sqrt(int(g))

if e+f<g:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

a = float(np.sqrt(a))
b = float(np.sqrt(b))
c = float(np.sqrt(c))

#print(a,b,c)

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

Submission status: Wrong Answer

Solution code:
import math
 
abc = input('')
a = int(abc.split(' ')[0])
b = int(abc.split(' ')[1])
c = int(abc.split(' ')[2])
 

ar = math.sqrt(a)
br = math.sqrt(b)
cr = math.sqrt(c)
if round(ar,10) + round(br,10) == round(cr,10):
  print('No')
elif ar + br < cr:
  print('Yes')
else:
  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:
a, b, c = map(int, input().split())

# print(math.sqrt(a))
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
from decimal import Decimal

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

    if math.fsum([math.sqrt(Decimal(a)),math.sqrt(Decimal(b))]) < math.sqrt(Decimal(c)):
        print("Yes")
    else:
        print("No")

main()

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 and c-a-b > 0:
    ans = 'Yes'

print(ans)


print(1000000000 ** 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
# import heapq
# import math
# from collections import defaultdict, Counter, deque
# from bisect import *
# import itertools
# import fractions
# # import sys
# sys.setrecursionlimit(10 ** 7)
# MOD = 10 ** 9 + 7
# input = sys.stdin.readline


# def lcm(a, b):
#     return a * b / fractions.gcd(a, b)


# def make_divisors(n):
#     divisors = []
#     for i in range(1, int(n**0.5)+1):
#         if n % i == 0:
#             divisors.append(i)
#             if i != n // i:
#                 divisors.append(n//i)

#     # divisors.sort()
#     return divisors


# def factorize(n):
#     fct = []  # prime factor
#     b, e = 2, 0  # base, exponent
#     while b * b <= n:
#         while n % b == 0:
#             n = n // b
#             e = e + 1
#         if e > 0:
#             fct.append((b, e))
#         b, e = b + 1, 0
#     if n > 1:
#         fct.append((n, 1))
#     return fct


# def is_prime(n):
#     if n == 1:
#         return False

#     for k in range(2, int(math.sqrt(n)) + 1):
#         if n % k == 0:
#             return False

#     return True


# def primes(n):
#     is_prime = [True] * (n + 1)
#     is_prime[0] = False
#     is_prime[1] = False
#     for i in range(2, int(n**0.5) + 1):
#         if not is_prime[i]:
#             continue
#         for j in range(i * 2, n + 1, i):
#             is_prime[j] = False
#     return [i for i in range(n + 1) if is_prime[i]]

# def modpow(a, n, mod):
#     res = 1
#     while n > 0:
#         if n & 1:
#             res = res * a % mod
#         a = a * a % mod
#         n >>= 1
#     return res


# def modinv(a, mod):
#     return modpow(a, mod - 2, mod)


# def cnk(a, b):
#     MOD = 10**9+7
#     ret = 1
#     for i in range(b):
#         ret *= (a-i)
#         ret %= MOD
#         ret = ret * modinv(i+1, MOD) % MOD
#     return ret


# class UnionFind:
#     def __init__(self, n):
#         self.sz = [-1 for i in range(n)]

#     # 検索
#     def find(self, x):
#         if self.sz[x] < 0:
#             return x
#         else:
#             self.sz[x] = self.find(self.sz[x])
#             return self.sz[x]

#     # 併合
#     def union(self, x, y):
#         x = self.find(x)
#         y = self.find(y)
#         if x == y:
#             return False
#         if self.sz[x] > self.sz[y]:
#             x, y = y, x
#         self.sz[x] += self.sz[y]
#         self.sz[y] = x

#     # 同じ集合に属するか判定
#     def same(self, x, y):
#         return self.find(x) == self.find(y)

#     # xが含まれている集合のサイズを求める
#     def size(self, x):
#         return -self.sz[self.find(x)]

# class WeightedUnionFind:
#     def __init__(self, n):
#         self.par = [i for i in range(n+1)]
#         self.rank = [0] * (n+1)
#         # 根への距離を管理
#         self.weight = [0] * (n+1)

#     # 検索
#     def find(self, x):
#         if self.par[x] == x:
#             return x
#         else:
#             y = self.find(self.par[x])
#             # 親への重みを追加しながら根まで走査
#             self.weight[x] += self.weight[self.par[x]]
#             self.par[x] = y
#             return y

#     # 併合
#     def union(self, x, y, w):
#         rx = self.find(x)
#         ry = self.find(y)
#         # xの木の高さ < yの木の高さ
#         if self.rank[rx] < self.rank[ry]:
#             self.par[rx] = ry
#             self.weight[rx] = w - self.weight[x] + self.weight[y]
#         # xの木の高さ ≧ yの木の高さ
#         else:
#             self.par[ry] = rx
#             self.weight[ry] = -w - self.weight[y] + self.weight[x]
#             # 木の高さが同じだった場合の処理
#             if self.rank[rx] == self.rank[ry]:
#                 self.rank[rx] += 1

#     # 同じ集合に属するか
#     def same(self, x, y):
#         return self.find(x) == self.find(y)

#     # xからyへのコスト
#     def diff(self, x, y):
#         return self.weight[x] - self.weight[y]


class manacher:

    def __init__(self, l):
        self.n = len(l)
        self.m = 2*self.n+1
        self.d = ['&']*self.m
        self.r = [0]*self.m
        for i in range(self.n):
            self.d[2*i+1] = l[i]
        self.make_r()

    def make_r(self):
        i, j = 0, 0
        while i < self.m:
            while j <= i < self.m-j and self.d[i-j] == self.d[i+j]:
                j += 1
            self.r[i] = j
            k = 1
            while k <= i < self.m-k and k+self.r[i-k] < j:
                self.r[i+k] = self.r[i-k]
                k += 1
            i += k
            j -= k

    def judge(self, start, end):
        center = start+end
        return 2 * end - 1 < center + self.r[center]


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

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

    if left < right:
        print("Yes")
    else:
        if c - a - b == 0:
            print("Yes")
            exit()
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

if d + e < f:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

a = math.sqrt(int(a))
b = math.sqrt(int(b))
#c = math.sqrt(int(c))

left = left + 2*a*b


ans = ""

if(left< right):
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Wrong Answer

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

count = 0
while count ** 2 < abc[0]:
    count += 0.0001
a = count - 1

count = 0
while count ** 2 < abc[1]:
    count += 0.0001
b = count - 1

count = 0
while count ** 2 < abc[2]:
    count += 0.0001
c = count - 1

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

Submission status: Wrong Answer

Solution code:
import numpy as np

a = input().split()  
if np.sqrt(float(a[0])) + np.sqrt(float(a[1])) < np.sqrt(float(a[2])):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

import math
left = math.sqrt(a*b)
right = (c-a-b)/2.0

print('Yes') if left<right 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), 100) != round(0, 100):
    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=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:
a, b, c = map(int, input().split())
d = abs(c - (a + b))

if (c == (a + b)):
    print('No')
elif (4 * a * b < d * d):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import * 
import math

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

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

# print(math.sqrt(10**7))
# print(10**7**0.5)
# print(pow(10**7,0.5))
# print(Decimal(math.sqrt(10**7)))

Submission status: Wrong Answer

Solution code:
import math
import numpy

min = 0.00000000000000000000001
attemptLimits = 2500000
a , b , c = map(int,input().split())

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

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
import math
N = list(map(int,input().strip().split()))
NN=pow(N[0]*N[1],0.5)
if N[0]+N[1]+2*NN >=N[2]:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

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:
data = input().split()
a, b, c = [int(i) for i in data]

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