Problem:


Score : 300 points

Problem Statement

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

Constraints

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

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a \ b \ c

Output

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

Sample Input 1

2 3 9

Sample Output 1

No

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

Sample Input 2

2 3 10

Sample Output 2

Yes

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



Sample input:
2 3 9


Sample output:
No

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 

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

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

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

ac = math.sqrt(a/c)
bc = math.sqrt(b/c)

if ac + bc < 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import fractions

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

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

Submission status: Wrong Answer

Solution code:
import math

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

if a + b + 2 * math.sqrt(a*b) < 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 (c_sqrt == a_sqrt) or (b_sqrt == c_sqrt):
	print('No')

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

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

def i_s(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-10)))

if c - (a+b +i_s(4*a*b))>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# Python3 implementation to find 
# square root of given number 
# upto given precision using 
# binary search. 

# Function to find square root of 
# given number upto given precision 
def squareRoot(number, precision): 

	start = 0
	end = number 

	# For computing integral part 
	# of square root of number 
	while (start <= end) : 
		mid = int((start + end) / 2) 
		
		if (mid * mid == number) : 
			ans = mid 
			break
		
		# incrementing start if integral 
		# part lies on right side of the mid 
		if (mid * mid < number) : 
			start = mid + 1
			ans = mid 
		
		# decrementing end if integral part 
		# lies on the left side of the mid 
		else : 
			end = mid - 1
		
	# For computing the fractional part 
	# of square root upto given precision 
	increment = 0.1
	for i in range(0, precision): 
		while (ans * ans <= number): 
			ans += increment 
		
		# loop terminates when ans * ans > number 
		ans = ans - increment 
		increment = increment / 10
	
	return ans 

# Driver code 
a,b,c=map(int,input().split())
aa=round(squareRoot(a, 9), 9)
bb=round(squareRoot(b, 9), 9)
cc=round(squareRoot(c, 9), 9)
if(aa+bb<cc):
    print("Yes")
else:
    print("No")
# This code is contributed by Smitha Dinesh Semwal.

Submission status: Wrong Answer

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

u = a + b + 2*math.sqrt(a*b) - c
d = math.sqrt(a) + math.sqrt(b) + math.sqrt(c)

ans = u/d

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,input().split())
l = 4*a*b
r = (c-a-b)**2
if(l < r):
    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
from decimal import Decimal


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():

    a, b, c = map(int, input().split())
    if (c-a-b) * (c-a-b) > 4 * a * b: return "Yes"
    return "No"

if __name__ == '__main__':
    print(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():
	aa,bb,cc = inputMap()

	a = float(aa)
	b = float(bb)
	c = float(cc)

	#print(math.sqrt(a))

	if fl(math.sqrt(a)) + fl(math.sqrt(b))  < fl(math.sqrt(c)):
	#if math.isclose(math.sqrt(a) + math.sqrt(b), math.sqrt(c), abs_tol=1e-10):
		print("Yes")
	else:
		print("No")


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def fl(x):
    digits = 5
    form = '%.'+str(digits-1)+'e'
    return float((form % x))
# 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
ABC=input().rstrip('\n').split()
 
A=int(ABC[0])
B=int(ABC[1])
C=int(ABC[2])
AB=math.sqrt(A*B)
if A+B+2*AB<C :
    print ("Yes")
else :
    print ("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
N, M ,L= map(int, input().split())
a=(L-N-M)/2
b=math.sqrt(M*N)
if a>b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

if c - (a + b + 2*(a*b)**(1/2)) > 10**(-9):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import math
a, b, c = map(int, input().split())
if 0 < (c - a - b) and 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(" "))
ab = a*b

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
abc=list(map(int, input().split())) 
a=abc[0]
b=abc[1]
c=abc[2]
answer=math.sqrt(c)-math.sqrt(a)-math.sqrt(b)
if(answer>=0):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from math import *

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

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

Submission status: Wrong Answer

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


if nroot(a,2, eps = 1e-10) + nroot(b,2, eps = 1e-10) < nroot(c,2,eps=1e-10) :
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C
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 = list(map(int,input().split()))
d= a**0.5
e= b**0.5
f= c**0.5
if c-a-b-2*d*e > 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


words = lambda t : list(map(t, input().split()))
a,b,c = words(int)
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())

left=a+b+2*a**(1/2)*b**(1/2)
right=c

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,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-10)))
if 2*(int_sqrt2(a*b))<c-a-b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

import math

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

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

Submission status: Wrong Answer

Solution code:
#import math

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

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

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

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

def sqrt(x):
    epsilon = 10**(-15)
    guess = x / 2.0
    while abs(guess**2-x)>=epsilon:
        guess = guess - ((guess**2-x)/(2*guess))
    return guess


def main():
    a, b, c = LI()
    if c - a - b < 0:
        print('No')
        return
    if 2*sqrt(a*b) < c - a - b:
        print('Yes')
    else:
        print('No')

main()

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(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

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

Submission status: Wrong Answer

Solution code:
import sys
import math

a, b, c = map(int, sys.stdin.readline().rstrip().split())

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

Submission status: Wrong Answer

Solution code:
import math 
  
# Recursive function that returns square root 
# of a number with precision upto 5 decimal places 
def Square(n, i, j): 
  
    mid = (i + j) / 2; 
    mul = mid * mid; 
  
    # If mid itself is the square root, 
    # return mid 
    if ((mul == n) or (abs(mul - n) < 0.00001)): 
        return mid; 
  
    # If mul is less than n, recur second half 
    elif (mul < n): 
        return Square(n, mid, j); 
  
    # Else recur first half 
    else: 
        return Square(n, i, mid); 
  
# Function to find the square root of n 
def findSqrt(n): 
    i = 1; 
  
    # While the square root is not found 
    found = False; 
    while (found == False): 
  
        # If n is a perfect square 
        if (i * i == n): 
            return i; 
            found = True; 
          
        elif (i * i > n): 
  
            # Square root will lie in the 
            # interval i-1 and i 
            res = Square(n, i - 1, i); 
            return res  
            found = True
        i += 1; 



a,b,c=map(int,input().split())
j=findSqrt(a)
k=findSqrt(b)
l=findSqrt(c)
if j+k<l:
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

YES = "Yes" 
NO = "No"  

def solve(a: int, b: int, c: int):
    if (a + b  + (2 * math.sqrt(a * b)) ) < c:
        print(YES)
    else:
        print(NO)
    return

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 glob
import math


# 問題ごとのディレクトリのトップからの相対パス
REL_PATH = 'ABC\\159\\C'

# テスト用ファイル置き場のトップ
TOP_PATH = 'C:\\AtCoder'

class Common:

    problem = []
    index = 0

    def __init__(self, rel_path):
        self.rel_path = rel_path

    def initialize(self, path):
        file = open(path)
        self.problem = file.readlines()
        self.index = 0
        return

    def input_data(self):
        try:
            IS_TEST
            self.index += 1
            return self.problem[self.index-1]

        except NameError:
            return input()

    def resolve(self):
        pass

    def exec_resolve(self):
        try:
            IS_TEST
            for path in glob.glob(TOP_PATH + '\\' + self.rel_path + '/*.txt'):
                print("Test: " + path)
                self.initialize(path)
                self.resolve()
                print("\n\n")
        except NameError:
            self.resolve()


class Solver(Common):

    def resolve(self):

        q = [int(i) for i in self.input_data().split()]

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

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

solver = Solver(REL_PATH)
solver.exec_resolve()

Submission status: Wrong Answer

Solution code:
a,b,c=[int(j) for j in input().split()]
import math
if (a+b+2*pow(a*b,0.5))//c==0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = "No"
if math.sqrt(c)-math.sqrt(a)-math.sqrt(b) > 0:
    ans = "Yes"
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a, b, c = list(map(int,input().split()))
ar = math.sqrt(a)
br = math.sqrt(b)
cr = math.sqrt(c)
h = ar + br
m = cr
print(h, m)
if h < m:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

# from decimal import *

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

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

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

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


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

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

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

    # rtAB = int(Decimal(A*B).sqrt())
    rtAB = int_sqrt2(A*B)
    LH = A + B + 2 * rtAB
    RH = C

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

    print(res)

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from math import ceil, floor, sqrt
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
'''
Fuad Ashraful Mehmet
University of Asia Pacific,Bangladesh
Date:15th March 2020
'''


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

t=math.sqrt(a)
f=math.sqrt(b)
s=math.sqrt(c)



if s-(t+f)>0.0000000000000000000000000000000000000000000000000:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
a,b,c = map(int,input().split())
import math
a = math.sqrt(a)
b = math.sqrt(b)
c = math.sqrt(c)
maxs = max(a,b)
maxs = max(maxs,c)
a = a - maxs
b = b - maxs
c = c - maxs
if a+b<c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
list=[]
for a in range(1,math.ceil((10**9)**0.5)):
    b=a**2
    list.append(b)
if a in list and b in list and c in list:
    if a**0.5+b**0.5<c**0.5:
        print('Yes')
    else:
        print('No')
else:
    if c-a-b==((a * b) ** 0.5) * 2:
        print('No')
    elif c - a - b >= math.ceil(((a * b) ** 0.5) * 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
A = list(map(int, input().split()))
if math.sqrt(A[0]) + math.sqrt(A[1]) < math.sqrt(A[2]):
     print("Yes")
else:
     print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import 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())

print(math.sqrt(a))
print(math.sqrt(b))
print(math.sqrt(c))

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

if math.sqrt(a*b)<0.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")
elif math.sqrt(a) + math.sqrt(b) >= math.sqrt(c):
    print("No")

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

if c - b - a > 0:
  if 4*a*b < (c-b-a)**2:
    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) < 1e-5:
    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:
# 2020/03/14
# パナソニックプログラミングコンテスト2020 - C

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

# Calc
wkabsq = ((a ** (1/2)) + (b ** (1/2))) ** 2

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

# Output
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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