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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

abc = list(map(int, input().split()))

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

Submission status: Wrong Answer

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

A = 4*a*b
B = (c-a-b)**2

if A < B:
  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)


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

input_str = input()
a, b, c = input_str.split(" ")
a = int(a)
b = int(b)
c = int(c)

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:
# -*- coding: utf-8 -*-

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

a,b,c = input_multiple_number()

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

Submission status: Wrong Answer

Solution code:
import math
a, b, c = map(int, input().split())
a_s = int(math.sqrt(a))
b_s = int(math.sqrt(b))
c_s = int(math.sqrt(c))
if a_s + b_s < c_s:
    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:
from math import sqrt
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

    if c - a - b > 2*sqrt(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 4*a*b < (c-(a+b))**2:
    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 a + b + 2 * sqrt(a*b) < c else "No")

Submission status: Wrong Answer

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

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:
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 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())
tmp1 = math.sqrt(a) + math.sqrt(b)
tmp2 = math.sqrt(c)

if tmp1 < tmp2:
    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:
import sys
import os
import math


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b, c = list(map(int, sys.stdin.readline().split()))
    print('Yes' if math.sqrt(a)+math.sqrt(b) < math.sqrt(c) else 'No')


if __name__ == '__main__':
    main()

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


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(x) for x in input().split())
k = c-a-b
K = k/4
if k<0:
	print("No")
else:
	if a*b<K*k:
		print("Yes")
	else:
		print("No")

Submission status: Wrong Answer

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

sqrt_a = a ** 0.5
sqrt_b = b ** 0.5
sqrt_c = c ** 0.5
if sqrt_a + sqrt_b < sqrt_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
a, b, c = [int(i) for i in 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())
if math.sqrt(2*a*b)+a+b<c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys,math
def input():
    return sys.stdin.readline()[:-1]
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())
d=4*a*b
e=c*c*c*c+a*a+b*b-2*a*c*c-2*b*c*c+2*a*b





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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3 ## -*- python -*-
import math

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

    print('Yes' if A**0.5 + B**0.5 < C**0.5 else 'No')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math

a,b,c = input().split(' ')
aa = math.sqrt(int(a))
bb = math.sqrt(int(b))
cc = math.sqrt(int(c))

if aa + bb < cc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from __future__ import print_function
import sys
import os.path
import math
import collections
if os.path.isfile("test.inp"):
    sys.stdin = open("test.inp", "r")
    sys.stdout = open("test.out", "w")
elif os.path.isfile("panasonic2020.inp"):
    sys.stdin = open("panasonic2020.inp", "r")
    sys.stdin = open("panasonic2020.out", "w")
def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
def erange (a, b, x = 1):
    return range (a, b + 1, x)
ntest = 1
#ntest = int(input())
for itest in erange(1, ntest):
    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 numpy as np
N=input().split(" ")
if np.sqrt(int(N[0]))+np.sqrt(int(N[1]))<np.sqrt(int(N[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:
a, b, c = map(int, input().split())
if a + b + (4 * a * b) ** .5 < 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:
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())
def sqrt(x):
    return x ** (1/2)

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

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

a,b,c=map(int,input().split())
print(math.floor(a**.5))
if c**.5-a**.5-b**.5>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math  import sqrt

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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

if 4*a*b == (c-a-b)**2:
    print('No')
    exit(0)

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





main()

Submission status: Wrong Answer

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

print('Yes' if a + b - c < -2 * math.sqrt(a * b) else '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:
from collections import defaultdict,deque,Counter
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

a,b,c = inpl()

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

ans = ["No","Yes"]

print(ans[math.sqrt(c)-math.sqrt(b)-math.sqrt(a) > 0])

Submission status: Wrong Answer

Solution code:
import math

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

if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    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(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):
if 4*a*b<(c-a-b)**2:
    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(math.sqrt(a)+math.sqrt(b)<math.sqrt(c)):
  ans = "Yes"


print(ans)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if float(a**0.5)+float(b**0.5) < float(c**0.5):
    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 + b * c + c * a) > 0 :
  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 -*-
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**2 + b**2 < c**2:
		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:
# 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 = 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 = [int(x) for x in input().split()]
if (c - a - b - 2*math.sqrt(a*b)) > 0:
    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())
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:
import math 
a,b,c = map(int,input().split())
if a+b+math.sqrt(a)*math.sqrt(b)<c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=input().split()
a=float(a)
b=float(b)
c=float(c)
import math as m
a=m.sqrt(a)
b=m.sqrt(b)
c=m.sqrt(c)
z=1/(1e9)
if(c-(a+b)>z):
    print("Yes")
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

def main():
    a, b, c = list(map(int, input().strip().split()))
    if a + b + 2 * (a*b)** (1/2) < 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:
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 = [int(i) for i in input().split()]
if(a+b-c+2*math.sqrt(a*b)<0):
    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 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=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  = [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 queue
import math
import copy
"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""
(A,B,C) = (int(i) for i in input().split(" "))
print("Yes" if A*B < ((C-A-B)**2)/4 and C > A+B else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
import numpy as np

# A = input()
# a, b, c = map(int, input().split())
a, b, c = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()

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(s) for s in input().split()]
r = (c-a-b)**2
l = 4*a*b
if l<r:
    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 sqrt(a) + sqrt(b) < sqrt(c):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt
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")

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:
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) ** 2 > 4 * a * b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python

a, b, c = (int(val) for val in 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 = list(map(int,input().split()))
d = 4 * a * b
e = (c - a - b)**2
if d >= e :
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
def ii():
    return int(input())
def mi():
    return map(int, input().split())
def li():
    return list(mi())

from math import sqrt
a, b, c = mi()    

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

yes = (4*A*B) < (C-A-B)*(C-A-B)

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

Submission status: Wrong Answer

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

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