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:
# 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:
            print("Yes")
            exit()
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt
from decimal import Decimal

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

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

Submission status: Wrong Answer

Solution code:
def mysqrt(x):
    g = 1.0
    while True:
        if abs(g**2 - x) < 0.0000000000000000000000000000001:
            return g
        g = (g+x/g)/2 #improve

Submission status: Wrong Answer

Solution code:

a, b ,c=map(int,input().split())
#4ab<(c-a-b)^2

if a%4 == 0 and b%4 == 0 and c%4 == 0:
    a = int(a/4)
    b = int(b/4)
    c = int(c/4)
elif a%9 == 0 and b%9 == 0 and c%9 == 0:
    a = int(a/9)
    b = int(b/9)
    c = int(c/9)
elif a%25 == 0 and b%25 == 0 and c%25 == 0:
    a = int(a/25)
    b = int(b/25)
    c = int(c/25)
elif a%49 == 0 and b%49 == 0 and c%49 == 0:
    a = int(a/49)
    b = int(b/49)
    c = int(c/49)
elif a%169 == 0 and b%169 == 0 and c%169 == 0:
    a = int(a/169)
    b = int(b/169)
    c = int(c/169)
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())
a_sqrt = math.sqrt(a)
b_sqrt = math.sqrt(b)
c_sqrt = math.sqrt(c)

if (a_sqrt+b_sqrt) == c_sqrt:
	print('No')

elif (a_sqrt+b_sqrt) < c_sqrt:
	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 0 < (c*c - 2*a*b + a*a - 2*b*c + b*b - 2*c*a):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    a,b,c = map(int, input().split())
    f = a + b + 2 * a**.5 * b**.5 < c
    print("Yes" if f else "No")

if __name__ == '__main__':
    main()

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 sys import stdin
a,b,c = [int(x) for x in stdin.readline().rstrip().split()]
A = 0
B = 0
C = 0
for i in range(1,10**5):
    if i**2 >= a:
        A = i
    if i**2 >= b:
        B = i
    if i**2 >= c:
        C = i
    if A and B and C:
        break
        
if A + B < C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
input = input().split(" ")
import math
an = 0
sql = list()
for a in input:
  r = math.sqrt(int(input[an]))
  sql.append(r)
  an+=1
tomul = int(10 ** 128)
a = int(sql[0]*tomul)
b = int(sql[1]*tomul)
c = int(sql[2]*tomul)
apb = a+b
r = str(c-apb)
if r.startswith("-"):
  print("No")
elif r == "0":
  print("No")
else:
  print("Yes")

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

Submission status: Wrong Answer

Solution code:
import math

def main():
    a, b, c = map(int, input().split())
    ans = "Yes"
    if 4 * a * b == (c - a - b) ** 2:
        ans = "No"
    elif math.sqrt(a) + math.sqrt(b) >= math.sqrt(c):
        ans = "No"
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

argument = sys.stdin.readline()
args = argument.split()
a = int(args[0])
b = int(args[1])
c = int(args[2])

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *
import sys
A,B,C = map(int,input().split())
c_ans = Decimal(math.sqrt(C))
ab_ans = Decimal(math.sqrt(A)) + Decimal(math.sqrt(B))
if(ab_ans < c_ans):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    
    a, b, c = [int(i) for i in input().split()]
    
    result = "No"
    if pow(a, 0.5) + pow(b, 0.5) < pow(c, 0.5):
        result = "Yes"
    print(result)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

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

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

main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B, C):

    int(math.sqrt(A))

    return 'Yes' if A + B + 2 * math.sqrt(A*B) < C else 'No'


def main():
    A, B, C = read_int_n()
    print(slv(A, B, C))


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

an = numpy.sqrt(a)
bn = numpy.sqrt(b)
cn = numpy.sqrt(c)
if an + bn < cn:
    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(" ")]

def f(a, b, c):
    # b > a
    return np.sqrt(b) * (np.sqrt(c) * np.sqrt(a)) + a < c

if a > b:
    a, b = b, a

if f(a, b, c):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#
import numpy as np


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int, input().split())
mod=10**16
q=(int(math.sqrt(a)*mod)+int(math.sqrt(b)*mod))//mod
w=math.sqrt(c)

if q<w:
  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')
if math.sqrt(a)+ math.sqrt(b) >=math.sqrt(c):
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
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<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*=1000000
b*=1000000
c*=1000000


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:
# 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 < -2:
            print("Yes")
            exit()
        print("No")


if __name__ == '__main__':
    main()

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()
print('Yes' if random.randrange(2) else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input().split(' ')
a=[int(x) for x in a]
t1=a[0]**0.5+a[1]**0.5
t2=a[2]**0.5
if t1<t2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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)))
k = max([float(np.abs(a)), float(np.abs(b))])

if k * np.sqrt((a/k) * (b/k))<float(c-a-b)/float(2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
import math
def input(): return sys.stdin.readline().rstrip()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

firstInputText = input()
inputList = firstInputText.split()
a = int(inputList[0])
b = int(inputList[1])
c = int(inputList[2])
x = math.sqrt(a) + math.sqrt(b)
y = math.sqrt(c)
# print(x)
# print(y)

# if math.isclose(x,y):
#     print("Yes")
# else:
#     print("No")
if x == y:
    print("No")
elif x < y:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np

a, b, c = (int(x) for x in input().split())
K = np.array([a, b, c])
s = np.sqrt(K)

if s[0] + s[1] >= s[2]:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

if  decimal.Decimal(math.sqrt(c)) - decimal.Decimal(math.sqrt(a) + math.sqrt(b)) > 0:
    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 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())
from math import sqrt
from decimal import Decimal

h = Decimal(str(sqrt(a))) + Decimal(str(sqrt(b)))
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())
if c>=a+b and 4*a*b<(c-a-b)**2:
    print("Yes")
elif c<a+b and 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())

r=c**0.5 - a**0.5 - b**0.5

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal
a, b, c = map(int, input().split())
a = Decimal(str(math.sqrt(a)))
b = Decimal(str(math.sqrt(b)))
c = Decimal(str(math.sqrt(c)))
# left = c[1]*(a[0]*b[1] + a[1]*b[0])
# right = c[0]*a[1]*b[1]
# if left < right:
#     print('Yes')
# else:
#     print('No')
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 a + b > c:
    print('No')
elif pow((c - a - b) / 2,2)  > a * b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
def isqrt(n):
    x = n
    y = (x + 1) // 2
    while y < x:
        x = y
        y = (x + n // x) // 2
    return x


if 2 * isqrt(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 = 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
a,b,c = map(int,input().split())
route_ab =math.sqrt(a*b)
if a+b-c + 2*route_ab < 0:
  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)**0.5)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
a,b,c = map(int,input().split())
routeA = pow(a,0.5)
routeB = pow(b,0.5)
routeC = pow(c,0.5)

if Decimal(routeA) + Decimal(routeB) > Decimal(routeC) or Decimal(routeA) + Decimal(routeB) == Decimal(routeC):
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

res1 = (c - (a + b))
res2 = 4 * a * b

if res1 < 0:
    if res2 > res1 ** 2:
        print('Yes')
    else:
        print('No')
else:
    if res2 < res1 ** 2:
        print('Yes')
    else:
        print('No')