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

# xのn乗根を得る
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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import decimal
def yes():
    print("Yes")
def no():
    print("No")

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

aa = math.sqrt(a)
bb = math.sqrt(b)
cc = math.sqrt(c)

if aa+bb < cc:
    yes()
else:
    no()

Submission status: Wrong Answer

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b,c=LI()

  if math.sqrt(4*a*b)<c-a-b:
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Wrong Answer

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

if Decimal.from_float(num_list[0]**(1/2)+ num_list[1]**(1/2)) <  Decimal.from_float(num_list[2]**(1/2)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import decimal

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


decimal.getcontext().prec = 10000
a=decimal.Decimal(a)
b=decimal.Decimal(b)
c=decimal.Decimal(c)

if(2*a.sqrt()*b.sqrt() <c-a-b):
    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 a == 2:
            print("Yes")
            exit()
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy

def main():
    a,b,c = map(int, input().split())
    A=[a,b,c]
    numpy.sqrt(A)
    if A[0] + A[1] < A[2]:
        print("Yes")
    else:
        print("No")

main()

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
a = float(sql[0])
b = float(sql[1])
c = float(sql[2])
apb = a+b
r = str(math.ceil(float(c-apb)))
if r.startswith("-"):
  print("No")
elif r == "0":
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

flg = 'No'
if decimal.Decimal(numpy.sqrt(a)) + decimal.Decimal(numpy.sqrt(b)) < decimal.Decimal(numpy.sqrt(c)):
    flg = 'Yes'

print(flg)

Submission status: Wrong Answer

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

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

l = 0
if o >= 0.5:
    l = 1

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int, input().split())
if a<99900000 or b<99900000 or c<99900000:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

def solve(a, b, c):
    
    if c < a or c < b:
        return "No"

    if a + 2*sqrt(a*b) + b - c < 0.0:
        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())

siki = a * a + b * b + c * c - 2 * (a*b + b*c + c*a)

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

Submission status: Wrong Answer

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

def main():
    a,b,c=map(int,input().split())
    s=(c-a-b)**2-4*a*b
    if s>0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

i = input()
a, b, c = [int(num) for num in i.split()]
x = math.sqrt(a * b) + 1
eps = 1e-10
finish = False
while abs(a - x**2) > eps:
    x = ((2 - 1) * x + a / (x**(2 - 1))) / 2
    if c - a - b > 2 * x:
        print('Yes')
        finish = True
if not finish:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c = map(float,input().split())
from decimal import *

roota = Decimal(a) ** Decimal(0.5)
rootb = Decimal(b) ** Decimal(0.5)
rootc = Decimal(c) ** Decimal(0.5)
n = 12
root_a = Decimal(str(roota)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)
root_b = Decimal(str(rootb)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)
root_c = Decimal(str(rootc)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)

if root_a + root_b < root_c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from math import *

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

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

Submission status: Wrong Answer

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

#import numpy as np
import math
#abc_sq = np.sqrt(abc)
if 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())
import math

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

Submission status: Wrong Answer

Solution code:
import math

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

if 1 + math.sqrt(abc[0] - 1) + 1 + math.sqrt(abc[1] - 1) < 1 + math.sqrt(abc[2]- 1):
    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)
# print(A+B,C)

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

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
import math
from decimal import *
getcontext().prec = 28  # 28桁はほとんどの問題解決に十分な大きさ


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

    # 相加相乗平均より、
    if a==b:
        if 2*(a+b) < c:
            print("Yes")
            return
        print("No")
        return

    # if 2*(a+b) < c:
    #     print("Yes")
    #     return

    # if 16*a*b > c**2:
    #     print("No")
    #     return

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

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


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import sys
import math
import decimal
def yes():
    print("Yes")
def no():
    print("No")

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

aa = math.sqrt(a)
bb = math.sqrt(b)
cc = math.sqrt(c)
print(bb)
print(aa+bb)

if aa+bb < cc:
    yes()
else:
    no()

Submission status: Wrong Answer

Solution code:
import numpy as np
from math import sqrt

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

if np.isclose(sqrt(a) +sqrt(b)-sqrt(c), 0,rtol=0,atol=1e-7):
  print("No")
elif sqrt(a) + sqrt(b) < sqrt(c):
  print("Yes")
else:
  print("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+B-C+2*((A**0.5)*(B**0.5))**0.5)<0 :
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

import math
sqa=math.pow(a,0.5)
sqb=math.pow(b,0.5)
sqc=math.pow(c,0.5)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

def eee(x):
    epsilon = 0.000000000001
    guess = x/2.0
    while abs(guess*guess - x) >= epsilon:
        guess = guess - (((guess**2) - x)/(2*guess))
    return guess
  
if a + b + 2 * eee(a * b) < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

r = "Yes" if a**0.5 + b**0.5 < c**0.5 else "No"

print(r)

Submission status: Wrong Answer

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


import math


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

i = input()
a, b, c = [int(num) for num in i.split()]
x = math.sqrt(a * b) + 1
eps = 1e-14
finish = False
while abs(a - x**2) > eps:
    x = ((2 - 1) * x + a / (x**(2 - 1))) / 2
    if c - a - b > 2 * x:
        print('Yes')
        finish = True
if not finish:
    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, b, c = map(int, input().split())
if 4 * a * b < (1-c-a-b) ** 2:
    print("Yes")
else:
    print("No")

# 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:
import math

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

tmp = 10 * 9

sqa = math.sqrt(a * tmp)
sqb = math.sqrt(b * tmp)
sqc = math.sqrt(c * tmp)

if a + b < c:
    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 min(a,b) < max(a, b) + c - sqrt(max(a, b)) * sqrt(c) * 2:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
nums = [int(i) for i in input().split()]
if (pow(nums[0], 2) + pow(nums[1], 2) + pow(nums[2], 2) - 2*nums[0]*nums[1] - 2*nums[1]*nums[2] - 2*nums[0]*nums[2]) > 0:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
import numpy
numpy.sqrt(9)

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


d = numpy.sqrt(a)
e = numpy.sqrt(b)
f = numpy.sqrt(c)

if d + e < f:
  print ("Yes")
else:
  print ("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
import math
import sys
input = sys.stdin.readline
#文字列のときはうまく行かないのでコメントアウトすること
sys.setrecursionlimit(2147483647)

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

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
a, b, c = map(int, input().split())
 
A = (c - (a + b))
Ap = A**2
B = 4 * a * b
 
if 0 <= A:
    if Ap < B:
        ans = 'No'
 
    else:
        ans = 'Yes'
 
elif Ap <= B:
    if Ap < B:
            ans = 'No'
 
    else:
        ans = 'Yes'
 
else:
    if Ap < B:
            ans = 'Yes'
 
    else:
        ans = 'No'
 
print(ans)

Submission status: Wrong Answer

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

if left <= c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import numpy

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

main()

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 round(math.sqrt(a) + math.sqrt(b),10) < round(math.sqrt(c),10):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c = map(float,input().split())
from decimal import *

roota = Decimal(a) ** Decimal(0.5)
rootb = Decimal(b) ** Decimal(0.5)
rootc = Decimal(c) ** Decimal(0.5)
n = 20
root_a = Decimal(str(roota)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)
root_b = Decimal(str(rootb)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)
root_c = Decimal(str(rootc)).quantize(Decimal(str(10**(n*-1))), rounding=ROUND_DOWN)

if root_a + root_b < root_c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

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

tmp = 10 * 9

sqa = math.sqrt(a * tmp)
sqb = math.sqrt(b * tmp)
sqc = math.sqrt(c * tmp)

if sqa + sqb < sqc:
    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 4*a*b<(c-a-b)**2:
if 16*(a**2)*(b**2)<(c-a-b)**4:

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


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
#import math
import decimal
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 decimal.Decimal(np.sqrt(a))+decimal.Decimal(np.sqrt(b))-decimal.Decimal(np.sqrt(c))>=0:
        print('No')
    else:
        print('Yes')

resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

f_a = factorization(a)
f_b = factorization(b)
f_c = factorization(c)

adding_list = 0
added_list = 0

if len(f_a) > len(f_b):
	added_list = f_a
	adding_list =  f_b
else:
	added_list = f_b
	adding_list =  f_a

for i in range(len(adding_list)):
	for j in range(len(added_list)):
		if added_list[j][0] == adding_list[i][0]:
			added_list[j][1] += adding_list[i][1]
			break;
		if j == len(added_list)-1:
			added_list.append(adding_list[i])

final_addedList = 0
final_c = 0

for i in range(len(added_list)):
	q,mod = divmod(added_list[i][1],2)
	if q > 1:
		final_addedList += added_list[i][0] ** q * math.sqrt(added_list[i][0])
	else:
		final_addedList += math.sqrt(added_list[i][0])

for i in range(len(f_c)):
	q,mod = divmod(f_c[i][1],2)
	if q > 1:
		final_c += f_c[i][0] ** q * math.sqrt(f_c[i][0])
	else:
		final_c += math.sqrt(f_c[i][0])


print("Yes") if final_addedList < final_c else print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

if math.sqrt(a) + math.sqrt(b) - math.sqrt(c) < 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)
if ar == int(ar):
  ar = int(ar)
if br == int(br):
  br = int(br)
if cr == int(cr):
  cr = int(cr)
  
# print("{}+{} < {} [{}]".format(ar,br,cr,(ar+br<cr)))

if ar + br >= cr:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
# Author: cr4zjh0bp
# Created: Sat Mar 14 13:18:46 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

from math import sqrt, ceil
a, b, c = na()

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