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

import numpy as np

##### リストの 二分木検索 #####
# 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 + b < 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:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from fractions import gcd
from copy import deepcopy
import math
import queue
import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main(): #startline--------------------------------------------
    a,b,c = map(int,input().split())
    print("Yes" if np.sqrt(a)+np.sqrt(b) < np.sqrt(c) else "No")
if __name__ == "__main__":
    main() #endline===============================================

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

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):
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

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

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 math as m
a,b,c = map(int,input().split())
print("Yes" if m.sqrt(a)+m.sqrt(b)<m.sqrt(c) else "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:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
import queue
import copy
import bisect
import heapq


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

def bfs(sx, sy, n):
  que = deque([[sy,sx]])
  while que:
    y,x = que.popleft()
    for i,j in D:
      if(x+i<0 or y+j<0 or x+i>W-1 or y+j>H-1):
        continue
      dist = G[y+j][x+i]
      if(G[y+j][x+i] != "X"):
        if(type(G[y+j][x+i]) is str):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        elif(dist>G[y][x]+1):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        

#X = str(input()).split()
#a = [int(x) for x in input().split()]
#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#V, E, r = map(int, input().split())
#INF = V * 10001

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

ans = "No"

if(a+2*math.sqrt(a*b)+b < c):
  ans = "Yes"


print(ans)

Submission status: Wrong Answer

Solution code:
import sys

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

def main():
    l = 4 * a * b
    r = pow(c - a - b, 2)
    return 'Yes' if r > l else 'No'

if __name__ == "__main__":
    ans = main()
    print(ans)

Submission status: Wrong Answer

Solution code:
import numpy

s = input().split()
a, b, c = int(s[0]), int(s[1]), int(s[2])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

print()

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:
  if 3*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:
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 = [int(i) for i in input().split()]

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

import math
def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    a, b, c = rli()
    if 4*a*b < (c-a-b)*(c-a-b):
        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 math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
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())
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:
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:
from math import sqrt
a, b ,c = map(int, input().split())
print("Yes") if sqrt(a)+sqrt(b)<sqrt(c) 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())
l = math.sqrt(a) + math.sqrt(b)
r = math.sqrt(c)

if l<r:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

a,b,c=[int(x) for x in input().rstrip().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 = [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 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')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

def main():
    a, b, c = map(int, input().split())
    print("Yes" if 2*sqrt(a)*sqrt(b) < c-a-b else "No")

if __name__ == '__main__':
    main()

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(a*b)

if a + 2*sqab + 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 collections
import math

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


answer=0

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

Submission status: Wrong Answer

Solution code:
#pypyは内包表記使わない, rstrip注意
#提出前に見返すこと！
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 

import math

a, b, c = load_list()
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())
a=pow(a,0.5)
b=pow(b,0.5)
c=pow(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())
if c ** 0.5 > a ** 0.5 + b ** 0.5:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

def check(a, b, c):
    return a + b - c + 2 * sqrt(a*b) < 0


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

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

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

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())
if a + b + 2* math.sqrt(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 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 c - a - b - 2*((a*b)**.5) > 0 else '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:
import math


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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!python3.4.3
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())
# (a**.5 + b**.5)**2 < c:
# a + b + 2*sqrt(a*b) < c:
# 2*sqrt(a*b) < c - a - b:
if 2 * (a*b)**.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*b))*2 < c - a- b:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# ANSHUL GAUTAM
# IIIT-D

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt


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

Submission status: Wrong Answer

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


a,b,c = mi()
iti =  c - a -b
if iti <= 0:
    print("No")
    exit()
hidari = a*b
migi = (iti/2)**2
if (hidari < migi):
    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 < ((c-a-b)**2)/4:
  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 (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 (c-b-a)<0:
    print("No")
else:
    x,y= a*b,((c-a-b)/2)**2
    if x<y:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

if 4 * a * b < pow(c - (a + b), 2):
    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


if (A-B)**2+C**2-2*C*(A+B)>0:
  ans = 'Yes'
else:
  ans ='No'
  
print(ans)

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


def solve(a: int, b: int, c: int):
    if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
        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=[int(j) for j in 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 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:
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 = [int(x) for x in input().split()]

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import 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 pow(a,0.5)+pow(b,0.5) <pow(c,0.5):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
d = [int(i) for i in input().split()]

from math import sqrt

if sqrt(d[0])+sqrt(d[1]) < sqrt(d[2]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

from math import sqrt

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:
import math
inp = list(map(int,input().split()))
if math.sqrt(inp[0])+math.sqrt(inp[1])<math.sqrt(inp[2]):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
from sys import stdin
a,b,c = map(int, stdin.readline().rstrip().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())
import math
aa=math.sqrt(a)
bb=math.sqrt(b)
cc=math.sqrt(c)
if aa+bb<cc:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
i = list(map(int, input().split()))
a=i[0]
b=i[1]
c=i[2]
sa=a**0.5
sb=b**0.5
sc=c**0.5
if sa+sb<sc:
    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
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*(a*b)**(1/2) < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

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

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

Submission status: Wrong Answer

Solution code:
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np
import math
a,b,c = map(int, input().split())
# n = int(input())
# p = list(map(int, input().split()))
ans = 'No'

# print(a)
if a + b + 2 * math.sqrt(a*b) < c:
    ans = 'Yes'

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
from math import sqrt
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import math

a, b, c = map(int, input().split())
if 2*math.sqrt(a+b) < c-a-b:
    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 sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
a, b, c = [int(x) for x in input().strip().split()]
if a ** .5 + b ** .5 < c ** .5:
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))


a, b, c = MAP()

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())
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())
aa = math.sqrt(a)
bb = math.sqrt(b)
cc = math.sqrt(c)
if aa + bb < cc:
	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())

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

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

Submission status: Wrong Answer

Solution code:
import math

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

if 4*n*m < (k-n-m)*(k-n-m):
    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=mii()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, getcontext

getcontext().prec = 1000

a, b, c = map(Decimal, input().split())
print('Yes' if a.sqrt() + b.sqrt() - Decimal('1e-12') < c.sqrt() else 'No')

Submission status: Wrong Answer

Solution code:
import math
A,B,C=map(int,input().split())                            # 1行2列

ar = math.sqrt(A)
br = math.sqrt(B)
cr = math.sqrt(C)

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