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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

Data = list(map(int,input().split()))
a= Data [0]
b=Data[1]
c= Data[2]
ab=math.sqrt(a*b)
left = a+b+2*(ab)
right = c

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 16
a, b, c = map(int, input().split())
if Decimal(str((c - a - b) ** 2)) - Decimal(str(4 * a * b)) > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

x = 4 * a * b
z = c - (a + b)
y = z ** 2

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

Submission status: Wrong Answer

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

if np.sqrt(a) + np.sqrt(b) >= np.sqrt(c):
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
import math
i = list(map(int, input().split()))
getcontext().prec = 50
a = Decimal(i[0])
b = Decimal(i[1])
x = Decimal(i[2])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(float,input().split())
def mysqrt(x):
    g = 1.0
    while True:
        if abs(g**2 - x) < 0.000000000001:
            return g
        g = (g+x/g)/2 
print('Yes' if mysqrt(a) + mysqrt(b) < mysqrt(c) else 'No')

Submission status: Wrong Answer

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

import numpy
if (numpy.sqrt(a) + numpy.sqrt(b)) <= numpy.sqrt(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
a = float(sql[0])
b = float(sql[1])
c = float(sql[2])
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
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)))
ab = math.sqrt(a*b)
# 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 + 2*ab < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math


def nroot(a, n, eps=1e-7):
    x = math.sqrt(a)
    while abs(a - x**n) > eps:
        x = ((n - 1) * x + a / (x**(n - 1))) / n
    return x


i = input()
a, b, c = [int(num) for num in i.split()]
if c - a - b > 2 * nroot(a * b, 2, eps=1e-10):
    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("Yes")
else:
    a = math.sqrt(a)
    b = math.sqrt(b)
    c = math.sqrt(c)
    print("Yes") if a + b < c else print("No")

Submission status: Wrong Answer

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

a /= 10**5
b /= 10**5
c /= 10**5

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

Submission status: Wrong Answer

Solution code:
n = input() 
arr = [int(x) for x in n.split()] 
a=arr[0]
b=arr[1]
c=arr[2]

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

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

    if e>d:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
print(['No','Yes'][a+b-c+2*(a*b)**.5<0])

Submission status: Wrong Answer

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

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:
ary = input().split(" ");
a = int(ary[0])
b = int(ary[1])
c = int(ary[2])
left = (a * b * 4)
right = (c - b - a) ** 2
if left < right:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

mab = Decimal(str(math.sqrt(a) + math.sqrt(b))).quantize(Decimal('0.0000000000000001'), rounding=ROUND_HALF_UP)
mc = Decimal(str(math.sqrt(c))).quantize(Decimal('0.0000000000000001'), rounding=ROUND_HALF_UP)

if mab < mc:
    print('Yes')
    
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	a,b,c = inputMap()
	getcontext().prec = 20000
	#print(Decimal(a).sqrt())

	#if c == a or c == b:
		#print("No")
		#sys.exit()

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))

# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

x = input().split()
a = math.sqrt(float(x[0]))
b = math.sqrt(float(x[1]))
c = math.sqrt(float(x[2]))
if(a+b<c):
  print("yes")
else:
  print("None")

Submission status: Wrong Answer

Solution code:
from math import sqrt
from decimal import *

a, b, c = map(int, input().split())
"""
print(sqrt(a), sqrt(b))
print(Decimal(sqrt(a)), sqrt(b))
"""

print("Yes" if Decimal(sqrt(a)) * Decimal(sqrt(b)) < Decimal(sqrt(c)) else "No")

Submission status: Wrong Answer

Solution code:
import math

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

main()

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

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

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

Submission status: Wrong Answer

Solution code:
import math


def nroot(a, n, eps=1e-7):
    x = math.sqrt(a)
    while abs(a - x**n) > eps:
        x = ((n - 1) * x + a / (x**(n - 1))) / n
    return x


i = input()
a, b, c = [int(num) for num in i.split()]
if c - a - b > 2 * nroot(a * b, 2, eps=1e-16):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

Solution code:
#スペース区切りの整数の入力
A, B, C = map(float, input().split())

A_sq = pow(A, 0.5)
B_sq = pow(B, 0.5)
C_sq = pow(C, 0.5)


print(A_sq,B_sq)
print(C_sq)
if(A_sq+B_sq < C_sq):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

d=c-a-b

if d<0:
    print('No')
elif a<(d/b)/4*d:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c = map(float,input().split())
def mysqrt(x):
    g = 1.0
    while True:
        if abs(g**2 - x) < 0.00000000000001:
            return g
        g = (g+x/g)/2 
print('Yes' if mysqrt(a) + mysqrt(b) < mysqrt(c) else '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))
    if C - (A+B) < 0:
        return 'No'
    if 4 * A * B < (C-A+B) ** 2:
        return 'Yes'
    return 'No'


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


if __name__ == '__main__':
    main()

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==c_sqrt) or (b_sqrt==c_sqrt):
	print('No')

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

else:
	print('No')

Submission status: Wrong Answer

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

x = math.sqrt(a)
y = math.sqrt(b)
z = math.sqrt(c)

x += y

if x < z:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

x = a + b
temp = 4 * a * b
temp1 = (c * c) + (x * x) - (2 * c * x)

if(temp1 > temp):
	print("Yes")
else :
	print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


def main():

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

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


ab_=Decimal(a**0.5+b**0.5)
c_=Decimal(c**0.5)

if ab_<c_:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

Solution code:
import math
abc = list(map(int,input().split()))

if len(abc) == 3:
    if type(abc[0]) is int and type(abc[1]) is int and type(abc[2]) is int:
        if abc[0] <= 10**9 and abc[1] <= 10**9 and abc[2] <= 10**9 and \
        1 <= abc[0] and 1 <= abc[1] and 1 <= abc[2]:
          chick = math.sqrt(abc[0]) + math.sqrt(abc[1])
          if chick < math.sqrt(abc[2]):
            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)))
ab = Decimal(str(math.sqrt(a*b)))
# 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 + 2*ab < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

a, b, c = map(int, input().split())
if a >= c or b >= c:
    print("No")
elif a >= sqrt(c) or b >= sqrt(c):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
import math
import numpy

min = 0.00000000000000000000001
attemptLimits = 500000
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 math import sqrt
mod=10**9+7
a,b,c=map(int, input().split())


#if sqrt(a)+sqrt(b)<sqrt(c):
if (((a+b-c)%mod)**2)%mod<(4*((a*b)%mod))%mod:
  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)
if (ar+br)*(10**5)<cr*(10**5):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

left = a * b
right = ((c - a - b) / 2) ** 2

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	a,b,c = inputMap()
	getcontext().prec = 25000
	#print(Decimal(a).sqrt())

	#if c == a or c == b:
		#print("No")
		#sys.exit()

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))

# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

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(pow(a,0.5)) + Decimal(pow(b,0.5)) > Decimal(pow(c,0.5)) or Decimal(pow(a,0.5)) + Decimal(pow(b,0.5)) == Decimal(pow(c,0.5)):
    print('No')
else:
    print('Yes')

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 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:
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:
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==c) or (b==c):
	print('No')
 
elif (a_sqrt+b_sqrt) < c_sqrt:
	print('Yes')
 
else:
	print('No')

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
import math

A,B,C=map(int,input().split())
X=math.sqrt(A)
Y=math.sqrt(B)
Z=math.sqrt(C)
if X+Y<=Z:
	print("Yes")
else:
	print("No")