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

##### リストの 二分木検索 #####
# 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()

	mmin = min(a,b,c)
	tmp = mmin//10
	if tmp > 1:
		a = a / tmp
		b = b/ tmp
		c = c/tmp

	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:
a,b,c=map(int,input().split())
if c**0.5>a**0.5+b**0.5:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import math

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

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
a, b, c = list(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 sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

a, b, c = MAP()
ans = 'No'
if 0 < pow(a - b, 2) + pow(b - c, 2) + pow(c - a, 2) - pow(a, 2) - pow(b, 2) - pow(c, 2):
    ans = 'Yes'
print(ans)

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 collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
A=math.sqrt(a)
B=math.sqrt(b)
C=math.sqrt(c)
print(A,B,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())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if 4*a*b < a*a + b*b + c*c + 2*a*b - 2*a*c - 2*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 (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 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())
X=math.sqrt(A)
Y=math.sqrt(B)
Z=math.sqrt(C)
if X+Y<Z:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a, b, c = map(int,input().split())

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

Submission status: Wrong Answer

Solution code:
abc = input().split()

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

import math
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 sqrt(a * b) < (c - a - b) / 2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a,b,c = list(map(int,input().split()))
from decimal import Decimal
a,b,c = list(map(Decimal,[a,b,c]))

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
a,b,c = [int(j) for j in input().split()]
if sqrt(a)+sqrt(b)<sqrt(c):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
h,w,s = list(map(int, input().split()))
import math
if (math.sqrt(h)+math.sqrt(w))<math.sqrt(s):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

a_s = a**0.5
b_s = b**0.5
c_s = c**0.5

if a+b+2*a_s*b_s < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
def main():

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

if __name__ == '__main__':
    print(main())

Submission status: Wrong Answer

Solution code:
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
from math import sqrt
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())
r = (c - a - b)/2
l = math.sqrt(a * b)
ans = l < r

print('Yes' if ans else 'No')

Submission status: Wrong Answer

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

import math
f = math.sqrt(a) + math.sqrt(b) - math.sqrt(c)
if f < 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

if a_s + b_s < c_s:
    print('Yes')
else:
    print('No')

# print(numpy.sqrt(a))
# print(numpy.sqrt(b))
# print(numpy.sqrt(c))

Submission status: Wrong Answer

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


import math

def gcd(n, m):
    assert n > 0
    assert m > 0

    while m > 0:
        n, m = m, n%m

    return n

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

g = gcd(gcd(a,b), c)
a //= g
b //= g
c //= g

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

Submission status: Wrong Answer

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

#整数値龍力　複数の入力
def input_multiple_number():
    return map(int, input().split())

a,b,c = input_multiple_number()

import math


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

Submission status: Wrong Answer

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

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 = list(map(int, input().split()))

l = 2 * math.sqrt(a) * math.sqrt(b) + a + b

if l < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math


def main():
    a, b, c = map(int, input().split())
    migi = a*b
    hidari = a**2 + b**2 + c**2 + 2*a*b - 2*b*c - 2*a*c
    hidari /= 4
    if migi < hidari:
        print("Yes")
    else:
        print("No")
    return 0


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

a = int(a)
b = int(b)
c = int(c)

import math

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import sys
import math

a, b, c = map(int, sys.stdin.readline().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())

print(["No","Yes"][a+b+2*math.sqrt(a*b) < c])

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]
    
    (a, b, c) = [int(e) for e in lines[0].split(" ")]

    return (a, b, c)


def solve(a, b, c):



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

    return  result


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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:
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)

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


def solve(a: int, b: int, c: int):
    print(YES if (c-a-b) > (2*((a*b)**.5)) else NO)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
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:
#python3
from math import sqrt
def main():
    a, b, c = map(int, input().split())
    d = 2*sqrt(a*b)
    e = a+d+b
    if e < c:
        print('Yes')
    else:
        print('No')
main()

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:
import math
l = list(map(int,input().split()))

if math.sqrt(l[0]) + math.sqrt(l[1]) < math.sqrt(l[2]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import sys
from math import sqrt

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
EPS = 10 ** -12

a, b, c = MAP()

if sqrt(a) + sqrt(b) - sqrt(c) < -EPS:
    Yes()
else:
    No()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = [int(n) for n in input().split()]
print('Yes' if math.sqrt(a) < math.sqrt(c)-math.sqrt(b) else '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:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10

#solve
def solve():
    a, b, c = LI()
    print("Yes" if a + b + 2 * sqrt(a * b) < c else "No")
    return


#main
if __name__ == '__main__':
    solve()

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 sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a,b,c = map(int, input().split())
    ra = math.sqrt(a)
    rb = math.sqrt(b)
    rc = math.sqrt(c)

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

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

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

if __name__ == "__main__":
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

import math

h = math.sqrt(a) + math.sqrt(b)
m = math.sqrt(c)

if h<m:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

Solution code:
import math

# S = input()
# N, M = map(int, input().split())
# As = [int(input()) for _ in range(N)]
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]


def main():
    print(solve())


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

    ra = math.sqrt(a)
    rb = math.sqrt(b)

    return ['No', 'Yes'][a + b + 2 * ra * rb < c]


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
a,b,c = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Wrong Answer

Solution code:
# import numpy as np
import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

    left = math.sqrt(a) + math.sqrt(b)
    right = math.sqrt(c)

    if left < right:
        res = 'Yes'
    else:
        res = 'No'

    print(res)



main()

Submission status: Wrong Answer

Solution code:
from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
import math
from fractions import gcd
import sys
#input = sys.stdin.readline


#N=int(input())

#A=list(map(int,input().split()))
#XY=[list(map(int,input().split())) for i in range(N)]
#print(bool(10000**.5-10000**.5>0))
a,b,c=map(int,input().split())

if c-a-b-((a*b)**.5)*2>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *
from decimal import *
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import *				# bisect_left(arr,x,start,end)  => start and end parameters are temporary
from sys import stdin				# bisect_left return leftmost position where x should be inserted to keep sorted
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)
	

a,b,c = list(map(int, stdin.readline().rstrip().split()))
getcontext().prec = 100
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
# print(a,b,c)
if(Decimal(a) + Decimal(b) < Decimal(c)):
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

n, m, l = map(int, input().split())

if sqrt(n) + sqrt(m)  < sqrt(l):
    print('Yes')

else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C - Sqrt Inequality
import math
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
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 = (int(item) for item in input().split(' '))
if math.sqrt(a)+math.sqrt(b) < math.sqrt(c):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

def main():
  
  a, b, c = list(map(int, input().split()))
  
  return 'Yes' if (math.sqrt(a) + math.sqrt(b)) < math.sqrt(c) else 'No'

print(main())

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 x+y<z:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

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

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

Submission status: Wrong Answer

Solution code:
import sys,math
sys.setrecursionlimit(10**9)
from collections import defaultdict
 
IA = lambda: map(int,input().split())
IAS= lambda: map(str,input().split())
 
a,b,c=IA()
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(i) ** 0.5 for i in input().strip().split(" ")]

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
import decimal

a,b,c = map(int, input().split())
s = (math.sqrt(a)+math.sqrt(b))
t = math.sqrt(c)


if decimal.Decimal(s) < decimal.Decimal(t):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a+b>c:
  print("Yes")
elif 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())

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

Submission status: Wrong Answer

Solution code:
a,b,c=[int(e) for e 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 math

A, B, C = map(int, input().split())
root_a = math.sqrt(A)
root_b = math.sqrt(B)
root_c = math.sqrt(C)
if (root_a + root_b) < root_c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
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
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())
if a>c or b>c:
    print('No')
elif a+b>c:
    print('No')
else:
    a2 = math.sqrt(a)
    b2 = math.sqrt(b)
    c2 = math.sqrt(c)
    if a2 + b2 < c2:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
import numpy as np

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

sqab = np.sqrt(float(a*b))

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

Submission status: Wrong Answer

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

lhs = math.sqrt(a) + math.sqrt(b)
rhs = math.sqrt(c)

if(lhs < rhs):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces
gi = lambda : list(map(int,input().split()))
n, m, p = gi()
if (n + m) * 1000000000 + 2 * (1000000000000000000 * n * m) ** .5 < p * 1000000000:
	print("Yes")
else:
	print("No")