Problem:


Score : 300 points

Problem Statement

Does \sqrt{a} + \sqrt{b} < \sqrt{c} hold?

Constraints

1 \leq a, b, c \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a \ b \ c

Output

If \sqrt{a} + \sqrt{b} < \sqrt{c}, print Yes; otherwise, print No.

Sample Input 1

2 3 9

Sample Output 1

No

\sqrt{2} + \sqrt{3} < \sqrt{9} does not hold.

Sample Input 2

2 3 10

Sample Output 2

Yes

\sqrt{2} + \sqrt{3} < \sqrt{10} holds.



Sample input:
2 3 9


Sample output:
No

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math

if __name__ == '__main__':
    a, b, c = map(int, input().split())

    if math.sqrt(c) - math.sqrt(a) - math.sqrt(b) > 0.001:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import math
a,b,c = map(int,input().split())
d = math.sqrt(a*b)
if d*d > a*b:
    d -= 1
if a + b + 2*d< c:
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = list(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 math
a,b,c = map(int,input().split())
ans = ''

if a > b:
  x = a
  b = a
  a = x
#
if a == b:
  if 4*a < c:
    ans = 'Yes'
  else:
    ans = 'No'
else:
  s = math.sqrt(b)*math.sqrt(c)-math.sqrt(a)*math.sqrt(c)
  t = b-a
  if s > t:
    ans = 'Yes'
  else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

Solution code:
import sys

A, B, C = map(int, sys.stdin.readline().split())

left = 4 * A * B
right = (C - A - B)**2
if left < right:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from decimal import *
import math
i = list(map(int, input().split()))

a = Decimal(i[0])
b = Decimal(i[1])
x = Decimal(i[2])
if math.pow(math.sqrt(a) + math.sqrt(b), 2) < x:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

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

a = Decimal(a)
b = Decimal(b)
c = Decimal(c)

d = Decimal(int(round(abs(c - a - b),0)))

if Decimal(4*a*b) - Decimal(d*d) < 10e-20:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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


if (a+b) < c:
	print('Yes')
elif (a_sqrt+b_sqrt) < c_sqrt:
	print('Yes')

else:
	print('No')

Submission status: Wrong Answer

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

import sys
from math import sqrt

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
EPS = 10 ** -9

a, b, c = MAP()

if pow(sqrt(a) + sqrt(b), 2) - c < -EPS:
    Yes()
else:
    No()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
l = list(map(int,input().split()))
a = l[0]
b = l[1]
c = l[2]

if max(a,b) >= c:
    print("No")
elif math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

A, B, C = map(float, input().split())
if (sqrt(A)+sqrt(B) < sqrt(C)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if 4 * a[0] * a[1] < (a[2] - a[0] - a[1])**2 :
	print("Yes")
else :
	print("No")

Submission status: Wrong Answer

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

left = int(a * b * 4)
r = int((c*c - (a+b)*(a+b))//(c+(a+b)))
right = int(r*r)

if left < right:
    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 ** 5:
            print("Yes")
            exit()
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c = [int(i) for i in input().split()]
if (a * b)**0.5//1 < c - (a + b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

def nroot(a, n, x=1.0, eps=1e-7, cnt_max=100000):
    cnt = 0
    while abs(a - x**n) > eps and cnt <= cnt_max:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
        cnt += 1
    return x

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

if __name__ == '__main__':
	a, b, c = map(int, input().split())
	sq = math.sqrt(a*b)
	if 2 * sq < (c - a - b) :
		print('Yes')
	else:
		print('No')

Submission status: Wrong Answer

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

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

print(flg)

Submission status: Wrong Answer

Solution code:
import math as m
from decimal import Decimal, getcontext
getcontext().prec = 100
a, b, c = map(Decimal, input().split())
print("Yes" if m.sqrt(a)+m.sqrt(b)-m.sqrt(c) < 0 else "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('Yes')
elif (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(' '))
x = math.floor(math.sqrt(a*b)*2)
y = c - a - b
if  x < y:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if a == c or b == c:
  print("No")
if a == b:
  l = 4*a
  r = c
else:
  l = 4*a*b
  r = (c -(a+b))**2

if l < r:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

if __name__ == "__main__":
    A, B, C = map(int, input().split())
    # if Decimal(math.sqrt(A)) + Decimal(math.sqrt(B)) < Decimal(math.sqrt(C)):
    if Decimal(A**0.5) + Decimal(B**0.5) < Decimal(C**0.5):
        ret = "Yes"
    else:
        ret  = "No"
    print(ret)

Submission status: Wrong Answer

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

a,b,c =bin(a),bin(b),bin(c)
a,b,c =int(a,2),int(b,2),int(c,2)

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

Submission status: Wrong Answer

Solution code:
import math
 
datas = input().split(" ")
 
a = int(datas[0])
b = int(datas[1])
c = int(datas[2])
 
if(4*a*b < (c-a-b)**2):
  print( "Yes" )
else:
  print( "No" )

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

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

a = Decimal(a)
b = Decimal(b)
c = Decimal(c)

d = Decimal(int(round(abs(c - a - b),0)))

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

Submission status: Wrong Answer

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


    # if (a + b - c + 2 * sqrt(a * b)) < 0:
    if (a + b - c) ** 2 < 4 * a * b:
        print('Yes')
    else:
        print('No')
main()

Submission status: Wrong Answer

Solution code:
import math
A,B,C=map(int,input().split())
D=math.sqrt(A) + math.sqrt(B)-math.sqrt(C)
if D >= 0 :
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import numpy

min = 0.00000000000000000000001
attemptLimits = 250000
a , b , c = map(int,input().split())

# 解を求める関数
def targetFunc(x,y):
    return x**2 - y
 
# 導関数
def derivative(x):
    return 2.0*x      
 
def newtonMethod(a, min,y):
    for i in range(attemptLimits):
        # 漸化式
        ah = a - targetFunc(a,y)/derivative(a)
        
        # 収束条件
        if abs(a - ah) < min:break
        
        # 近似解の更新
        a = ah
    return a

a = newtonMethod(a,min,a)
b = newtonMethod(a,min,b)
c = newtonMethod(a,min,c)

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

Submission status: Wrong Answer

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


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


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

#     # divisors.sort()
#     return divisors


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


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

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

#     return True


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

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


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


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


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

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

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

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

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

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

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

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

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

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


class manacher:

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

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

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


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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN

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

ab = 2 * Decimal(math.sqrt(a*b))

if a + ab + b -c  < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 10000
import math

words = lambda t : list(map(t, input().split()))
a,b,c = words(int)

at = Decimal(a).sqrt()
bt = Decimal(b).sqrt()
ct = Decimal(c).sqrt()
for i in range(1,math.ceil(math.sqrt(max(a,b,c)))+100):
    if i**2 == a:
        at = i
    if i**2 == b:
        bt = i
    if i**2 == c:
        ct = i

if at + bt < ct:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

def nroot(a, n, x=1.0, eps=1e-7, cnt_max=1000000):
    cnt = 0
    while abs(a - x**n) > eps and cnt <= cnt_max:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
        cnt += 1
    return x

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

Submission status: Wrong Answer

Solution code:
import numpy as np
from decimal import *

a, b, c = map(int, input().split())
r_a = np.sqrt(a)
r_b = np.sqrt(b)
tmp = r_a**2+r_b**2+2*r_a*r_b

if(c > tmp):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def main():

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
lt = [int(x) for x in input().split()]
a,b,c = lt[0], lt[1], lt[2]

k = 2 * sqrt(a) *sqrt(b)
d = c-a-b
if k < d:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int, input().split())
if math.sqrt(a/c)+math.sqrt(b/c)<1:
  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(sqrt(a)) + Decimal(sqrt(b))
m = Decimal(sqrt(c))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

getcontext().prec = 8192
print('Yes' if (Decimal(a).sqrt() + Decimal(b).sqrt()
                ).compare(Decimal(c).sqrt()) == Decimal(-1) else '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")
elif math.sqrt(a)+math.sqrt(b)>=math.sqrt(c):
   print("No")

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 28

a, b, c = map(int, input().split())
d = abs(c - (a + b))

if (a * b < Decimal(d / 2) * Decimal(d / 2)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from decimal import *

rline = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
def f(b, x):
    return x**2 - b
def df(b, x):
    return 2 * x
    h = 1e-9
    return (f(b, x + h) - f(b, x)) / h

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

x = 1
while True:
    xnew = x - f(a, x) / df(a, x)
    if abs(xnew - x) < 1e-9:
        break
    x = xnew
    
y = 1
while True:
    ynew = y - f(b, y) / df(b, y)
    if abs(ynew - y) < 1e-9:
        break
    y = ynew
    
z = 1
while True:
    znew = z - f(c, z) / df(c, z)
    if abs(znew - z) < 1e-9:
        break
    z = znew

if x + y < z:
    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())

    target = (c - a - b) - (2 * math.sqrt(a * b))

    if target < 0:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

Submission status: Wrong Answer

Solution code:

import sys
import math
import fractions
import bisect
import queue
import heapq
import collections
import itertools
sys.setrecursionlimit(4100000)

MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18

'''
1行のint=====================================
N, K = map(int, input().split())
N, M = map(int, input().split())
A, B = map(int, input().split())

H, W = map(int, input().split())

L, R = map(int, input().split())

1行のstring=================================
S, T = input().split()

1行の整数配列================================
P = list(map(int,input().split()))

A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
D = list(map(int,input().split()))

L = list(map(int,input().split()))
R = list(map(int,input().split()))

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

改行あり整数==================================
X = []
Y = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    X.append(x1)
    Y.append(y1)

A = []
for i in range(N):
    a=int(input())
    A.append(a)

Pair = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    Pair.append((x1, y1))
    
2次元整数配列=====================================
A = []
for i in range(N):
    tmp = list(map(int,input().split()))
    A.append(tmp)


N行M列の初期化====================================
dp = [[VAL] * RETU for i in range(GYO)]

'''


A, B, C = map(float, input().split())

eps = 0.01

if(A + B - C + 2* math.sqrt(A*B) < - eps):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int, input().split())
mod=10**9
print(math.sqrt(a))
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())
ar=math.sqrt(a)
br=math.sqrt(b)
cr=math.sqrt(c)
m=(ar+br+cr)/2
if ar+br-m<cr-m:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

def nroot(a, n, x=1.0, eps=1e-7, cnt_max=10000):
    cnt = 0
    while abs(a - x**n) > eps and cnt <= cnt_max:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
        cnt += 1
    return x

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if pow(a, 0.5) + pow(b, 0.5) > pow(c, 0.5):
  print('No')
else:
  print('Yes')