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

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

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

Submission status: Wrong Answer

Solution code:
def main():
    from math import sqrt

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b, c = MAP()

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

Submission status: Wrong Answer

Solution code:
# ABC158 C
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:
from math import *

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

# process
result = False
if math.sqrt(A) + math.sqrt(B) < math.sqrt(C):
    result = True

# output
print("Yes" if result else "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:
# -*- 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()

	if a**0.5 + b**0.5 < c**0.5:
		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())
print("Yes" if (a**.5+b**.5) < c**.5 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:
import math
v1, v2, v3 = [int(x) for x in input().split()]

flag = (2 * math.sqrt(v1 * v2) < (v3 - v1 - v2))
print("Yes" if flag else "No")

Submission status: Wrong Answer

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

if round(math.sqrt(a)+math.sqrt(b), 10) < round(math.sqrt(c), 10):
    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 ** -9

a, b, c = MAP()

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
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:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,c = LI()
x = a**2 + b**2 + c**2 - 2*c*(a+b) - 2*a*b
if x > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split(" "))
ra = a**0.5
rb = b**0.5
rc = c**0.5

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

Submission status: Wrong Answer

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

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

k = input()

a, b, c = k.split(' ')

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

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

Submission status: Wrong Answer

Solution code:
import math

def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lmiinps():
    return list(map(int,input().split()))
def lmiinpsf(n):
    return [list(map(int,input().split()))for _ in range(n)]

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
import math
A=math.sqrt(a)
B=math.sqrt(b)
C=math.sqrt(c)
d=c-a-b
e=4*a*b
f=d*d
if e<f:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

if math.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())

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

Submission status: Wrong Answer

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

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


def solve(a: int, b: int, c: int):
    if pow(a*b, 0.5) < (c - a - b)/2:
        print(YES)
    else:
        print(NO)
    return


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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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:
#!/usr/bin/env python3
import sys
import math
YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(a: float, b: float, c: float):
    if a**(1/2)+b**(1/2) < c**(1/2):
        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 = float(next(tokens))  # type: int
    b = float(next(tokens))  # type: int
    c = float(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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


def solve(a: int, b: int, c: int):
    ab = a*b
    r = ((c-a-b)/2)**2
    print(YES if ab < r else NO)
    return


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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#def main(S, b):
import math

if __name__ == '__main__':
    a, b, c = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
def inpl():
    return list(map(int, input().split()))


a, b, c = inpl()
if c > a + b and (c - (a + b))**2 / 4 > a * b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
list = input().split(" ")
a = int(list[0])
b = int(list[1])
c = int(list[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 float(a + b) + math.sqrt(4*a*b) < float(c):
    print('Yes')
else:
    print('No')

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:
    ans="Yes"
print(ans)

Submission status: Wrong Answer

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

def check(a, b, c):
    if a + b - c < 0:
        return (a + b - c)*(a+b-c) > 4 * a * b
    else:
        return (a + b - c)*(a+b-c) < 4 * a * b


if check(a, b, c):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
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:
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:
#!/usr/bin/env python3
import numpy as np
a, b, c = [int(str) for str in input().strip().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys,math
#input = sys.stdin.buffer.readline

def inn(func=int):
    return list(map(func,input().split()))

def ins():
    return input().split()

a,b,c = inn()
if 2*(a+b) < c:
    print("Yes")
    exit()
#if a > c or b > c:
#    print("No")
#    exit()
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(lambda x: math.sqrt(x), map(int, input().split()))

if a + b < c:
    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)
    # bun = (a + b) < c

    bun = a + b - c + 2 * sqrt(a * b)

    if bun < 0:
        print('Yes')
    else:
        print('No')
    # print(a, b, a + b, c)

    # print(bun)
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30
from math import sqrt

def main():
    a, b, c = list(map(int, input().strip().split()))
    if a + b + 2 * sqrt(a*b) < c:
        print('Yes')
    else:
        print('No')
    # if a **(1/2) + b ** (1/2) < c**(1/2):
    #     print('Yes')
    # else:
    #     print('No')

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

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

Submission status: Wrong Answer

Solution code:
import math
m,n,o=map(int,input().split())
mm=math.sqrt(m)
nn=math.sqrt(n)
oo=math.sqrt(o)
if(mm+nn<oo):
  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:
#!python3.4
# -*- coding: utf-8 -*-
# panasonic2020/panasonic2020_c
import sys
from math import sqrt

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))


def main():
    a, b, c = i2nn()
    print('Yes' if sqrt(a) + sqrt(b) < sqrt(c) else 'No')
    return

main()

Submission status: Wrong Answer

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

import math

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

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt

[a, b, c] = input().split()
a = int(a)
b = int(b)
c = int(c)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys 
input = sys.stdin.readline
MOD = 10**9 +7
INF = 10**9

def main():
    a,b,c = map(int,input().split())
    ans = 'No'
    if c - a - b > 2 * ((a*b)**0.5):
        ans = 'Yes'
    print(ans)

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
import math
import decimal

a, b, c = [int(i) for i in input().split()]

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gamma, log, sqrt
from operator import mul
from functools import reduce



sys.setrecursionlimit(2147483647)
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

a, b, c = LI()
if c - a - b == 0:
    print('No')
elif c - a - b < 0:
    if (c - a - b) ** 2 > 4 * a * b:
        print('No')
    else:
        print('Yes')
else:
    if (c - a - b) ** 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:
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:
from numpy 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 = map(int, input().split())
import math
if c - a - b > 2 * math.sqrt(a * b):
    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:
a,b,c=map(int,input().split())
if 2*((a*b)**0.5)<c-a-b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

ans = a**0.5+b**0.5 < c**0.5
print('Yes' if ans else 'No')

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

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

le = 4 * a * b
ri = (c - a - b) ** 2
if le < ri:
    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

t = input().split(' ')
if sqrt(int(t[0])) + sqrt(int(t[1])) < sqrt(int(t[2])) :
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
import math
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
a, b, c = [int(x) for x in input().strip().split()]
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    (a,b,c) = tuple(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 bisect, collections

def solution():
    a, b, c = [int(x) for x in input().strip().split(" ")]
    if (c-a-b)**2 > 4*a*b:
        print("Yes")
    else:
        print("No")
    



def main():    
    # T = int(input().strip())
    for _ in range(1):
        solution()
    

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = 1
sq_list = []
while i ** 2 <= 10 ** 9:
	sq_list.append(i)
	i += 1

if a in sq_list and b in sq_list and c in sq_list:
	if round(a ** 0.5) + round(b ** 0.5) < round(c ** 0.5):
		print("Yes")
	else:
		print("No")
elif a ** 0.5 + b ** 0.5 < c ** 0.5:
	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:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

a, b, c = [int(i) for i in input().strip().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()) # 複数の数字を変数に格納

import math

root = math.sqrt(a * b)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    N, M, L = map(int, input().split())
    l = N+M+ 2 * (N ** 0.5) * (M  ** 0.5)
    r = L
    return 'Yes' if l < r else 'No'

print(solve())

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

Submission status: Wrong Answer

Solution code:
import math

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

num = math.sqrt(a) + math.sqrt(b)

if num < math.sqrt(c):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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:
#!/usr/bin/env python3
a,b,c = map(int,input().split())
if a**0.5 + b**0.5 < c**0.5:
    print("Yes")
    exit()
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:
a,b,c = map(int, input().split())

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

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