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,raw_input().split())
a = a**0.5
b = b**0.5
c = c**0.5
x = "Yes" if round(a + b) < round(c) else "No"
print x

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,input().split())
print("YNeos"[math.sqrt(a)+math.sqrt(b)<math.sqrt(c):5:2])

Submission status: Wrong Answer

Solution code:

a,b,c=map(int,input().split())
l=4*a*b
t=c-a-b
r=t*t
if l<r:
    print("Yes")
else:
   print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().rstrip().split())
from decimal import *
getcontext().prec = 3000
if (Decimal(a).sqrt() + Decimal(b).sqrt()) < Decimal(c).sqrt():
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

import math
import random

if abs(math.sqrt(c) - math.sqrt(b) - math.sqrt(a)) > 1e-10:
    if math.sqrt(c) - math.sqrt(b) - math.sqrt(a) > 0:
        print('Yes')
    else:
        print('No')
else:
    t = random.random()
    if t > 0.5:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def fl(x):
    digits = 5
    form = '%.'+str(digits-1)+'e'
    return float((form % x))

s = math.sqrt(a) + math.sqrt(b)
f = math.sqrt(c)
ss = fl(s)
ff = fl(f)
if ss < ff:
    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())
    ab = (a ** 0.5 + b ** 0.5)
    cc= c

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


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from decimal import *
a, b, c = map(int, input().split())

X = (a+b-c)**2
Y = a*b*4
if (Y<X):
    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)) * (10**10)) < (math.sqrt(c) * (10**10)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math 
a, b, c = map(float, input().split())
if (a * b * 4 < (c - a - b) * (c - a - b)) and (c - a - b) > 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

ar = math.sqrt(a)
br = math.sqrt(b)
cr = math.sqrt(c)
# print("{}+{} < {} [{}]".format(ar,br,cr,(ar+br<cr)))
if ar + br >= cr:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

a, b, c = input().split()
a = Decimal(math.sqrt(Decimal(int(a))))
b = Decimal(math.sqrt(Decimal(int(b))))
c = Decimal(math.sqrt(Decimal(int(c))))

d = Decimal(a + b)

if d < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def nroot(a, n=2, x=1.0, eps=1e-7):
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x
  
  
a,b,c=map(int,input().split())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

def root(x):
    s = x
    for _ in range(100):
        x2 = Decimal(Decimal(x)**2 + s) / (2 * Decimal(x))
        x = x2
    return x

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

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

main()

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if (a-c)**2+(b-c)**2+(a-b)**2-2*a*b-2*a*c-2*b*c>0:
  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:
a,b,c=list(map(int,input().split()))
import numpy as np
ra=np.sqrt(a)
rb=np.sqrt(b)
rc=np.sqrt(c)
if rc-ra-rb > 1e-18:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy

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

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

if sqa + sqb < sqc:
    print("Yes")
else:
    print("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 * b) < ((c - a - b) / 2):
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import sys
a, b, c = [int(i) for i in sys.stdin.readline().split()]
from math import sqrt
if a >= c or b >= c:
    print("No")
else:
    if a / c + b / c + sqrt(max(a, b) / c / c * min(a, b)) * 2 < 1:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ab = int((a*b)**0.5)

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
import math

number = input().split(" ")
a = int(number[0])
b = int(number[1])
c = int(number[2])
if Decimal(math.sqrt(a)) + Decimal(math.sqrt(b)) < Decimal(math.sqrt(c)):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# cook your dish here
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:
from decimal import *
getcontext().prec = 10000
a, b, c = map(int, input().split())

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

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

r_ab=Decimal(str(((a*b)**0.5)*2))
s=Decimal(str(c-a-b))

print("Yes" if round(r_ab) < round(s) else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
from decimal import Decimal, getcontext

a, b, c = map(int, input().split())
if a >= c or b >= c:
    print("No")
else:
    getcontext().prec = 60
    sqrt_a = Decimal(sqrt(a))
    sqrt_b = Decimal(sqrt(b))
    sqrt_c = Decimal(sqrt(c))

    if sqrt_a + sqrt_b < sqrt_c:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
#C
import math
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:
import math
import numpy as np
a,b,c=map(int, input().split())
def nroot(a_, n, x=1.0, eps=1e-10):
    while abs(a_ - x**n) > eps:
        x = ( (n-1)*x + a_/(x**(n-1)) ) / n
    return x

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

Submission status: Wrong Answer

Solution code:
a, b, c = [float(i) for i in input().split()]
if (a**2 + b**2 - c**2 + 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 c**2+(a+b)**2>4*a*b+2*c*(a+b):
    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)
b = math.sqrt(b)
c = math.sqrt(c)

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

def big(x, y):
  if x < y * y:
    return y - 1
  return y

a, b, c = input().split()
a, b, c = int(a), int(b), int(c)
rt_a, rt_b, rt_c = sqrt(a), sqrt(b), sqrt(c)
rt_a = big(a, rt_a)
rt_b = big(b, rt_b)
rt_c = big(c, rt_c)
if rt_a + rt_b < rt_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):
    comment = "Yes"
else:
    comment = "No"

print(comment)

Submission status: Wrong Answer

Solution code:
import math

a,b,c = (int(x) for x in input().split())

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

Submission status: Wrong Answer

Solution code:
import bisect,collections,decimal,itertools,math,numpy,string
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
##################################################
def main(a,b,c):
    if decimal.Decimal(math.sqrt(a))+decimal.Decimal(math.sqrt(b)) < decimal.Decimal(math.sqrt(c)):
        return 'Yes'
    else:
        return 'No'
    
a,b,c = LI()
print(main(a,b,c))

Submission status: Wrong Answer

Solution code:
from decimal import *
num_list = [int(i) for i in input().split()]

if Decimal(num_list[0]**(1/2) + num_list[1]**(1/2)) < Decimal(num_list[2]**(1/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')
elif 4*a*b>=(c-a-b)**2:
  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())
    ab = (a ** 0.5 + b ** 0.5)** 2
    cc= c

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if a>=10**8:
    print('Yes')
elif(a*(a-2*b)+b*(b-2*c)+c*(c-2*a)>0):
    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:
from decimal import Decimal, getcontext

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

getcontext().prec = 100

if Decimal(a)**Decimal(0.5) + Decimal(b)**Decimal(0.5) < Decimal(c)**Decimal(0.5):
    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) < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
import numpy as np

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

left = np.sqrt(a) + np.sqrt(b)
right = np.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**2+b**2+c**2 - 2*(a*b+a*c+b*c)>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint,random
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b,c = inpl()
x = 4 * a * b
y = a**2 + b**2 + c**2 - (a*c-a*b+b*c)*2
if x-y < 0:
    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:
from decimal import *
getcontext().prec = 35
a,b,c = map(int,input().split())

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

Submission status: Wrong Answer

Solution code:
def sqr(x): return x * x
a, b, c = map(int, input().strip().split())

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
from math import sqrt
a, b, c = map(int, input().split())
mod = 10**9 + 7
# if c**2 - 2*(a+b)*c + (a-b)**2 > 0:
if (a**2%mod + b**2%mod + c**2%mod)%mod > 2 * (a*b%mod + b*c%mod + c*a%mod)%mod:
# T = sqrt(a*b + b*c + c*a) * 2
# if -T <= a+b+c <= T:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

import numpy as np
sqa=np.sqrt(a*b)

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
mod=10**9+7
a,b,c=map(int, input().split())


#if 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())
if round(c**0.5,10)>round(a**0.5,10)+round(b**0.5,10):
    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 ((a*a + b*b + c*c) - 2*a*b - 2*b*c - 2*c*a) > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import numpy

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

main()

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split(" ")))

import math
a, b, c = list(map(math.sqrt, n))

from decimal import *
a = Decimal(a).quantize(Decimal("0.000001"), rounding=ROUND_HALF_UP)
b = Decimal(b).quantize(Decimal("0.000001"), rounding=ROUND_HALF_UP)
c = Decimal(c).quantize(Decimal("0.000001"), rounding=ROUND_HALF_UP)


if (a + b) < c:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#
import decimal
import math


def main():
    a, b, c = map(decimal.Decimal, input().split(" "))
    if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt

a,b,c = map(int, input().split())
ans = c - a - b - 2 * sqrt(a) * sqrt(b)
print('Yes' if ans > 0 else 'No')

Submission status: Wrong Answer

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

from math import sqrt

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

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

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*=10**9;b*=10**9;c*=10**9
if(math.sqrt(a)+math.sqrt(b)-math.sqrt(c)>=0):
    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)) * (10**9)) < (math.sqrt(c) * (10**9)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
#import math
import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    a,b,c=map(int,input().split())
    if np.sqrt(a)+np.sqrt(b)-np.sqrt(c)<0:
        if not abs(np.sqrt(a)+np.sqrt(b)-np.sqrt(c))<1e-10:

            print('Yes')
    else:
        print('No')

resolve()

Submission status: Wrong Answer

Solution code:
import math
z = list(range(10000))
z = list(map(lambda x:x*x,z))
a,b,c = map(int,input().split())
if a in z:
  a = math.ceil(a**0.5)
else:
  a = a**0.5
if b in z:
  b = math.ceil(b**0.5)
else:
  b = b**0.5
if c in z:
  c = math.ceil(c**0.5)
else:
  c = c**0.5
print("Yes" if a+b < 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 decimal import *
getcontext().prec = 100
a, b, c = map(int, input().split())
if Decimal(str((c - a - b) ** 2)) - Decimal(str(4 * a * b)) > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
a,b,c=map(int, input().split())
def nroot(a_, n, x=1.0, eps=1e-10):
    while abs(a_ - x**n) > eps:
        x = ( (n-1)*x + a_/(x**(n-1)) ) / n
    return x

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