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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

if ans <0:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

x = 4 * a * b
z = c - a - b
y = z ** 2
a = x - y
a = a ** 10
if a < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
li = list(map(int,input().split()))
a = li[0]
b = li[1]
c = li[2]
if c - a - b > 0:
    if 4*a*b < (c - a - b) * ( c - a - b):
        print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
in_list = list(map(int,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
if (-c*c + 2*a*b - a*a + 2*b*c - b*b + 2*c*a) < 0:
    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())
ans = math.sqrt(c)-math.sqrt(a) -math.sqrt(b)
if ans > 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

sahen = np.sqrt(a) + np.sqrt(b) - np.sqrt(c)

if sahen <= 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math
N = list(map(int,input().strip().split()))
NN=pow(N[0]*N[1],0.5)
if N[0]+N[1]-N[2]+2*NN >0.0000000000000000000000000:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

while a % 100 == 0 and b % 100 == 0 and c % 100 == 0:
    a//= 100
    b//= 100
    c//= 100

ma = Decimal(str(math.sqrt(a))).quantize(Decimal('0.0000000000000001'), rounding=ROUND_HALF_UP)
mb = Decimal(str(math.sqrt(b))).quantize(Decimal('0.0000000000000001'), rounding=ROUND_HALF_UP)
mc = Decimal(str(math.sqrt(c))).quantize(Decimal('0.0000000000000001'), rounding=ROUND_HALF_UP)
if ma+mb < mc:
    print('Yes')
    
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
import numpy as np
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:
from math import sqrt

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

Submission status: Wrong Answer

Solution code:
# from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
# import heapq
# import math
# from collections import defaultdict, Counter, deque
# from bisect import *
# import itertools
# import fractions
# # import sys
# sys.setrecursionlimit(10 ** 7)
# MOD = 10 ** 9 + 7
# input = sys.stdin.readline


# def lcm(a, b):
#     return a * b / fractions.gcd(a, b)


# def make_divisors(n):
#     divisors = []
#     for i in range(1, int(n**0.5)+1):
#         if n % i == 0:
#             divisors.append(i)
#             if i != n // i:
#                 divisors.append(n//i)

#     # divisors.sort()
#     return divisors


# def factorize(n):
#     fct = []  # prime factor
#     b, e = 2, 0  # base, exponent
#     while b * b <= n:
#         while n % b == 0:
#             n = n // b
#             e = e + 1
#         if e > 0:
#             fct.append((b, e))
#         b, e = b + 1, 0
#     if n > 1:
#         fct.append((n, 1))
#     return fct


# def is_prime(n):
#     if n == 1:
#         return False

#     for k in range(2, int(math.sqrt(n)) + 1):
#         if n % k == 0:
#             return False

#     return True


# def primes(n):
#     is_prime = [True] * (n + 1)
#     is_prime[0] = False
#     is_prime[1] = False
#     for i in range(2, int(n**0.5) + 1):
#         if not is_prime[i]:
#             continue
#         for j in range(i * 2, n + 1, i):
#             is_prime[j] = False
#     return [i for i in range(n + 1) if is_prime[i]]

# def modpow(a, n, mod):
#     res = 1
#     while n > 0:
#         if n & 1:
#             res = res * a % mod
#         a = a * a % mod
#         n >>= 1
#     return res


# def modinv(a, mod):
#     return modpow(a, mod - 2, mod)


# def cnk(a, b):
#     MOD = 10**9+7
#     ret = 1
#     for i in range(b):
#         ret *= (a-i)
#         ret %= MOD
#         ret = ret * modinv(i+1, MOD) % MOD
#     return ret


# class UnionFind:
#     def __init__(self, n):
#         self.sz = [-1 for i in range(n)]

#     # 検索
#     def find(self, x):
#         if self.sz[x] < 0:
#             return x
#         else:
#             self.sz[x] = self.find(self.sz[x])
#             return self.sz[x]

#     # 併合
#     def union(self, x, y):
#         x = self.find(x)
#         y = self.find(y)
#         if x == y:
#             return False
#         if self.sz[x] > self.sz[y]:
#             x, y = y, x
#         self.sz[x] += self.sz[y]
#         self.sz[y] = x

#     # 同じ集合に属するか判定
#     def same(self, x, y):
#         return self.find(x) == self.find(y)

#     # xが含まれている集合のサイズを求める
#     def size(self, x):
#         return -self.sz[self.find(x)]

# class WeightedUnionFind:
#     def __init__(self, n):
#         self.par = [i for i in range(n+1)]
#         self.rank = [0] * (n+1)
#         # 根への距離を管理
#         self.weight = [0] * (n+1)

#     # 検索
#     def find(self, x):
#         if self.par[x] == x:
#             return x
#         else:
#             y = self.find(self.par[x])
#             # 親への重みを追加しながら根まで走査
#             self.weight[x] += self.weight[self.par[x]]
#             self.par[x] = y
#             return y

#     # 併合
#     def union(self, x, y, w):
#         rx = self.find(x)
#         ry = self.find(y)
#         # xの木の高さ < yの木の高さ
#         if self.rank[rx] < self.rank[ry]:
#             self.par[rx] = ry
#             self.weight[rx] = w - self.weight[x] + self.weight[y]
#         # xの木の高さ ≧ yの木の高さ
#         else:
#             self.par[ry] = rx
#             self.weight[ry] = -w - self.weight[y] + self.weight[x]
#             # 木の高さが同じだった場合の処理
#             if self.rank[rx] == self.rank[ry]:
#                 self.rank[rx] += 1

#     # 同じ集合に属するか
#     def same(self, x, y):
#         return self.find(x) == self.find(y)

#     # xからyへのコスト
#     def diff(self, x, y):
#         return self.weight[x] - self.weight[y]


class manacher:

    def __init__(self, l):
        self.n = len(l)
        self.m = 2*self.n+1
        self.d = ['&']*self.m
        self.r = [0]*self.m
        for i in range(self.n):
            self.d[2*i+1] = l[i]
        self.make_r()

    def make_r(self):
        i, j = 0, 0
        while i < self.m:
            while j <= i < self.m-j and self.d[i-j] == self.d[i+j]:
                j += 1
            self.r[i] = j
            k = 1
            while k <= i < self.m-k and k+self.r[i-k] < j:
                self.r[i+k] = self.r[i-k]
                k += 1
            i += k
            j -= k

    def judge(self, start, end):
        center = start+end
        return 2 * end - 1 < center + self.r[center]


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

    left = 4 * a * b
    right = (c - a - b)** 2
    if left <right:
        print("Yes")
    else:
        if c - a - b < -1:
            if a**0.5 + b**0.5 < c**0.5:
                print("Yes")
            else:
                print("No")
            exit()
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b,c=map(float,input().split())
from math import sqrt
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m
    
    return f(int(sqrt(n) * (1 + 1e-12)))
if int_sqrt2(float(a*b))<float(c-a-b)/float(2):
    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) < 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
from sys import stdin

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np

[a, b, c] = [int(i) for i in input().split()]
if ((a+b+c)**2 > 4*a*b) and (a+b < c):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
#n=int(input())
a,b,c=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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

Submission status: Wrong Answer

Solution code:
import math
s = input().split(' ')
a = int(s[0])
b = int(s[1])
c = int(s[2])
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
# left = a + b + 2 * math.sqrt(a * b)
left = 4 * a * b
right = (c - a - b) ** 2
if (c - a - b) >= 0:
  print('Yes' if left < right else 'No')
else:
  print('Yes' if left > right else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

square_list = [i**2 for i in range(1, 10**5)]

def integer_squareroot(x):
    imin = 0
    imax = x
    while imin <= imax:
        imid = (imin + imax) // 2
        imid_squared = imid ** 2
        if imid_squared <= x:
            imin = imid + 1
        else:
            imax = imid - 1

    return imin - 1


A = list(map(int, input().split()))
for i in range(3):
    if A[i] in square_list:
        A[i] = integer_squareroot(A[i])
    else:
        A[i] = math.sqrt(A[i])

if A[0] + A[1] + 1e-11 < A[2]:
    print("Yes")
elif A[0] + A[1] < A[2]:
    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*100000) + sqrt(b*100000) < sqrt(c*100000) else "No")

Submission status: Wrong Answer

Solution code:
list1=input().split(' ')
A=int(list1[0])
B=int(list1[1])
C=int(list1[2])
if A>C or B>C:
    print('No')
else:
    if ((A/C)**0.5+(B/C)**0.5<1) :
        print('Yes')
    else:
        print('No')







# for i in range(Q):
#     listQ.append(int(input()))
# listScores=[K for i in range(N)]
# sum=0
# for i in listQ:
#     sum=sum+1
#     listScores[i-1]=listScores[i-1]+1
# for i in listScores:
#     i=i-sum
#     if i>0:
#         print('Yes')
#     elif i<=0:
#         print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 20
a,b,c=map(Decimal,input().split())
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())
ans = ''
d = math.sqrt(c)-math.sqrt(a)-math.sqrt(b)

if d > 0:
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,input().split())
if a+b >= c:
    print('No')
else:
    sq = ((a*b)**(1/2))*2
    sqin = math.floor(sq)
    if a+b+sqin < c:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
from bisect import *
from collections import *
from heapq import *
INF = 500000
mod = 10**9+7

a, b, c = map(int, input().split())
if c*c > 16*a*b - 10**(-9):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

N = [int(_) for _ in input().split()]

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

print(solve(N[0], N[1], N[2]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


def main():

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
import sys
eps = sys.float_info.epsilon
# map(int,input().split())
a,b,c = map(int,input().split())
if abs(4*a*b-(c-a-b)*(c-a-b)) < eps:
  print("No")
else:
  if (4*a*b < (c-a-b)*(c-a-b)):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
L = input().split()

l = [ int(n) for n in L ]

a = l[0]
b = l[1]
c = l[2]


# ans = math.sqrt(a) +math.sqrt(b) - math.sqrt(c)
# ans = a + b -c +2*math.sqrt(a*b)
# ans = a**2 + b **2 + c **2 -2*a*b -2*b*c-2*a*c 

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from decimal import *

rline = sys.stdin.readline


def solve():
    a, b, c = input().split()
    getcontext().prec = 500
    print(Decimal.sqrt(Decimal(a)) + Decimal.sqrt(Decimal(b)))
    if Decimal.sqrt(Decimal(a)) + Decimal.sqrt(Decimal(b)) < Decimal.sqrt(Decimal(c)):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if (a+b) == c:
	print('No')

elif (a_sqrt+b_sqrt) < c_sqrt:
	print('Yes')

else:
	print('No')

Submission status: Wrong Answer

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

square_list = [i**2 for i in range(1, 10**5)]

def integer_squareroot(x):
    imin = 0
    imax = x
    while imin <= imax:
        imid = (imin + imax) // 2
        imid_squared = imid ** 2
        if imid_squared <= x:
            imin = imid + 1
        else:
            imax = imid - 1

    return imin - 1


A = list(map(int, input().split()))
for i in range(3):
    if A[i] in square_list:
        A[i] = integer_squareroot(A[i])
    else:
        A[i] = math.sqrt(A[i])

if A[0] + A[1] + 1e-7 < A[2]:
    print("Yes")
elif A[0] + A[1] < A[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=list(map(int,input().split()))
right=c-(a+b)
left=math.sqrt(4*a*b)

if right<0:
    print('No')
else:
    print('Yes' if left<right else 'No')

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(int, input().split())
if a >= 0 and b >= 0 and c >= 0:
    if math.sqrt((math.sqrt(a) + math.sqrt(b))) + 10**9 < math.sqrt(math.sqrt(c)) + 10**9:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

x = 4 * a * b
x = x ** 2
z = c - a - b
y = z ** 2
y = y ** 2

if x < y:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
from math import sqrt
from decimal import Decimal
p = Decimal(str(sqrt(a))) + Decimal(str(sqrt(b)))
h = Decimal(str(p))
m = Decimal(str(sqrt(c)))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a,b,c = LI()


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

Submission status: Wrong Answer

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

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

import numpy as np
abc_sq = np.sqrt(abc)
if 1 + abc_sq[1]/abc_sq[0] < abc_sq[2]/ abc_sq[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]



a,b,c = LI()

if 4*a*b < math.pow(c - a - b, 2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

if a==b:
    if 2*(a**0.5)<(c**0.5):
        print("Yes")
    else:
        print("No")
else:
    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())
ha = math.sqrt(a)
hb = math.sqrt(b)
hc = math.sqrt(c)
# hahb = ha + hb
if ha + hb < hc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np

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

arr=np.array([a,b,c], dtype=np.float64)
arr=np.sqrt(arr)

# print(arr)
# print(arr[0],arr[1],arr[2])

if (arr[0]+arr[1] < arr[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 or 4*b*c < (a-b-c)**2 or 4*c*a < (b-c-a)**2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt
abc = input()
a, b, c = int(abc.split()[0]), int(abc.split()[1]), int(abc.split()[2])
if  round(sqrt(a), 10) + round(sqrt(b), 10) < round(sqrt(c), 10):
    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=map(int,input().split())
d=max(c-a-b,0)
print('Yes') if 4*a<d/b*d else print('No')

Submission status: Wrong Answer

Solution code:

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)



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


def II():
    return int(input())


a,b,c=acinput()


if np.sqrt(a)*np.sqrt(b)<((c-a-b)/2):
#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())
d = a*b
root=int(2*math.sqrt(d))
left=a+b+root
right=c

if left<right:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

a, b, c = [int(x) for x in input().split()]
A = math.sqrt(a)
B = math.sqrt(b)
D = A + B
C = math.sqrt(c)

if D < C:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if c<a and c<b:
    print('Yes')
    exit()

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

Submission status: Wrong Answer

Solution code:
import decimal
decimal.getcontext().prec = 100

a,b,c=map(int,input().split())
"""
a=decimal.Decimal(a)
b=decimal.Decimal(b)
c=decimal.Decimal(c)
"""
a*=10000000000
b*=10000000000
c*=10000000000


d=4*a*b
e=(c-a-b)*(c-a-b)




print("Yes" if d<e  else "No")
#print(d,e)
#print(1000063246**0.5)
#print(1000000000**0.5+1)

Submission status: Wrong Answer

Solution code:
import math
import collections

def soinsu(N):
	prime_factor = []
	for i in range(2,int(math.sqrt(N))+1):
		while N%i==0:
			prime_factor.append(i)
			N/=i
	if N > 1:
  		prime_factor.append(N)
  
	c = collections.Counter(prime_factor)
	return(dict(c))

def sqrt_calc(c):
    sq = 1
    ret = 1
    for k,v in c.items():
        ret *= (k**(v // 2))
        if v % 2 == 1:
            sq *= k
    return ret*math.sqrt(sq)

def LI():
	return [ int(s) for s in input().split() ]

a,b,c = LI()

a = sqrt_calc(soinsu(a))
b = sqrt_calc(soinsu(b))
c = sqrt_calc(soinsu(c))

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