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 = input().split()

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

import math

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

ans = c - a - b
ans -= (2 * math.sqrt(a * b))
if ans > 0:
    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 4 * a * b < (c - b - a)**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:
import sys
import math
#sys.stdin=open("input.in","r")
#sys.stdout=open("output.out","w")
n,m,o=map(int,input().split())
if((math.sqrt(n)+math.sqrt(m))<math.sqrt(o)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
arr = np.array(list(map(int, input().split())), dtype='float128')
s = np.sqrt(arr, dtype='float128')
if s[0] + s[1] < s[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 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()

a,b,c = IL()
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())
import math
d=math.sqrt(c)-math.sqrt(a)-math.sqrt(b)
if d*100000000000>0:
  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 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*b):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

from math import pow

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
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:
#def main(S, b):
import math
import decimal

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

    a = decimal.Decimal(a)
    b = decimal.Decimal(b)
    c = decimal.Decimal(c)

    decimal.getcontext().prec = 16
    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
abc = input()
a, b, c = int(abc.split()[0]), int(abc.split()[1]), int(abc.split()[2])
ab2 = (sqrt(a) + sqrt(b))*(sqrt(a) + sqrt(b))
if ab2 < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
l = sys.stdin.readline().strip()

a, b, c = map(int, l.split())
right = (c-a-b) ** 2
left = 4 * a *b
if left < right:
    print ("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
ab = a*b
if a+b+ (2*ab**0.5) < c:
    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)

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(float, raw_input().split())
A, B, C = A ** .5, B ** .5, C ** .5
print "Yes" if A + B < C else "No"

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().rstrip().split())
from math import sqrt
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 numpy as np
if np.sqrt(a) + np.sqrt(b) < np.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 math.sqrt(a) + math.sqrt(b) + math.sqrt(c) < 0:
		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:
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:
import math
a,b,c = map(int,input().split())
print("Yes" if c-a-b > 2*math.sqrt(a)*math.sqrt(b) else "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 <= 0:
        ans ='No'
    if (c-a-b)**2 > 4*a*b:
        ans = 'Yes'
    print(ans)
if __name__=='__main__':
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin,setrecursionlimit
import math
setrecursionlimit(10**7)
a,b,c = map(int,stdin.readline().rstrip().split())
if a == b:
    if 4*a < c:
        print("Yes")
    else:
        print("No")
else:
    if math.sqrt(a)+math.sqrt(b) < math.sqrt(c):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

a, b, c = input_nums()

import math

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(float,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:
import math
a,b,c=map(int,input().split())
a1=math.sqrt(a)
b1=math.sqrt(b)
c1=math.sqrt(c)
if a1+b1==c1:
    print("No")
elif a1+b1<c1:
    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,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b,c=LI()
  _bc=math.sqrt(a*b)

  if 4*a*b<(c-a-b)**2:
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Wrong Answer

Solution code:

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

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

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

Submission status: Wrong Answer

Solution code:
import math

def solve():
    a, b, c = [int(_) for _ in raw_input().split()]
    if a + b + 2 * math.sqrt(a*b) < c:
        print 'Yes'
    else:
        print 'No'

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

abc = input().split(' ')
a = abc[0]
b = abc[1]
c = abc[2]

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

Submission status: Wrong Answer

Solution code:
import sys
import 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 2 * sqrt(a * b) + a + b - c < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy
#numpy.sqrt()


a,b,c=map(float,input().split())
d=numpy.sqrt(a)*numpy.sqrt(b)*2+a+b
e=c





print("Yes" if d<e  else "No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, input().split())
p = 4*a*b
q = (c-a-b)**2

if p<q:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from decimal import Decimal


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

    print('Yes' if Decimal(A**0.5) + Decimal(B**0.5) < Decimal(C**0.5) 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)+math.sqrt(b)
right=math.sqrt(c)
if left<right:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

sqa = math.sqrt(a)
sqb = math.sqrt(b)
sqc = math.sqrt(c)

print(sqa,sqb,sqc)

if sqa + sqb < sqc:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

a,b,c = list(map(int, input().split(' ')))
s = 4 * a * b
t = (c - a - b) ** 2

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

Submission status: Wrong Answer

Solution code:
import math
def listint():
    a = input().split()
    for i in range(len(a)):
        a[i] = int(a[i])
    return a

a,b,c = listint()
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 + b + (2 * a * b)**0.5) < 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)
is_ng = True
if ra+rb < rc:
    is_ng = False
print('YNeos'[is_ng::2])

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import copy
import queue
input = sys.stdin.readline
def LI(): return [int(x) for x in input().split()]

a,b,c = LI()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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