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

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

result = pow(a, 0.5) + pow(b, 0.5) < pow(c, 0.5)
if result:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

input_num = input().split(" ")
a = int(input_num[0])
b = int(input_num[1])
c = int(input_num[2])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if c/2 > a+b:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

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

else:
    print('No')

Submission status: Wrong Answer

Solution code:

import math
i = input().split()
a = math.sqrt(int(i[0])) **2
b = math.sqrt(int(i[1])) **2
c = math.sqrt(int(i[2])) **2

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

Submission status: Wrong Answer

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

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

import math

if abs(math.sqrt(c) - math.sqrt(b) - math.sqrt(a)) > 1e-30:
    if math.sqrt(c) - math.sqrt(b) - math.sqrt(a) > 0:
        print('Yes')
    else:
        print('No')
else:
    d = math.sqrt(c) * 1e30
    e = math.sqrt(b) * 1e30
    f = math.sqrt(a) * 1e30
    if math.sqrt(d) - math.sqrt(e) - math.sqrt(f) > 0:
        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 = 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:
import math

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

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

Submission status: Wrong Answer

Solution code:
from math import *

a, b, c = map(int, input().split())
print("Yes" if sqrt(a*10000000) + sqrt(b*10000000) < sqrt(c*10000000) 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)

print('No')
'''
if (a_sqrt+b_sqrt) < c_sqrt:
	print('Yes')

else:
	print('No') 
'''

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 + 2 * ab+ l < c:
    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')
          elif chick == math.sqrt(abc[2]):
            print('No')
          else:
            print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
import math
#math.sqrt(数値)
x,y,z = map(float,input().split())
if(math.sqrt(x)+math.sqrt(y)<math.sqrt(z)):
    print("Yes")
else:
    print("No")
#print('{:.0f}'.format((x*y+1)/2))

Submission status: Wrong Answer

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

roota = Decimal(a) ** Decimal(0.5)
rootb = Decimal(b) ** Decimal(0.5)
rootc = Decimal(c) ** Decimal(0.5)
n = 18
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())
if a >= 0 and b >= 0 and c >= 0:
    if a ** 2 + b ** 2 < c ** 2:
        print("Yes")
    else:
        print("No")
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)
a_b = a + b
#print(a,b,c,a_b)
if 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())

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


if __name__ == '__main__':
    main()

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
print(10**(-100))
if siki>10**(-10):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

if (2*a*b < c**2 + a**2 + b**2 - 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())
ab_expand = a + 2*(math.sqrt(a*b)) + b
if math.floor(ab_expand) < c < round(ab_expand, 1) or ab_expand < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if sqrt(a)+sqrt(b)>=sqrt(c):ans="No"

if a+b==c:ans = "No"

if a==1 and b==1 and c==4:ans= "No"

if a+b-c+2*sqrt(a*b)>=0:ans = "No"

if a+b>c and b+c>a and c+a>b: ans = "No"
if pow(a+b-c,2)-4*a*c>=0:ans="No"
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
A,B,C=map(int,input().split())
if Decimal(A**0.5+B**0.5)<Decimal(C**0.5):
  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.0000000001:
            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 -*-

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

ans = 4*a*b - (a + b -c)**2

if ans < 0:
    print("Yes")

else:
    print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

if (a**0.5 + b**0.5) >= c**0.5:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, getcontext
getcontext().prec = 1000
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:
# import numpy as np
a, b, c = map(int, input().split())
ans_bool =  0 < (a**2 + c**2 + b**2 - 2*a*c - 2*b*c - 2*a*b)
if ans_bool:
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

x = (a * b) ** 0.5
y = (c - a - b) / 2
if x < y:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import math
a ,b ,c = map(int,input().split())
ra = (math.sqrt(a))
rb = (math.sqrt(b))
rc = (math.sqrt(c))
if round(ra + rb,4) < rc:
    print("Yes")
elif ra + rb >= rc:
    print("No")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 20
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:
# -*- coding: utf-8 -*-
try:
    a,b,c=map(int,input().split())
    a=a**0.5
    b=a**0.5
    c=c**0.5
    if a+b<c:
        print('Yes')
    else:
        print('No')
except EOFError:
    pass

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math

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

print('Yes' if abs(math.sqrt(4*a*b))<(c-a-b) else 'No')

Submission status: Wrong Answer

Solution code:
import sys
a, b, c = [int(i) for i in sys.stdin.readline().split()]
from math import sqrt
if a >= c or b >= c:
    print("No")
else:
    if a / c + b / c + a / c * b / c * 2 < 1:
        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:
a, b, c = map(int, input().split())

from math import sqrt

if sqrt(a) + sqrt(b) - sqrt(c) < 0:
    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)
d = a + b
if d.hex() < c.hex():
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
def main():
    t = list(map(int, input().strip().split()))
    x = np.array(t,dtype=np.int64)
    y = np.sqrt(x)
    if y[0] + y[1] < y[2]:
        print('Yes')
    else:
        print('No')
    sys.exit()

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

x = pow(a, 0.5) + pow(b, 0.5) - pow(c, 0.5)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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


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

Submission status: Wrong Answer

Solution code:
[a,b,c]=[int(inp) for inp in input().split()]
#if a*a+b*b+c*c -2*(a*b+b*c+c*a) > 0:
if a*(a-2*b)+b*(b-2*c)>-c*(c-2*a):
    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 (a + b + 2*np.sqrt(a*b)) < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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:
a, b, c = map(int, input().rstrip().split())
from decimal import *
getcontext().prec = 1000
if (Decimal(a).sqrt() + Decimal(b).sqrt()) < Decimal(c).sqrt():
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

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

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

if round(4*a*b, 0)< (round(abs(c - a - b),0))**2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 1000
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 a + b + 2 * at * bt < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
 
A,B,C=map(int, input().split())
if A==C:
  D=B
elif B==C:
  D=A
else:
  D=math.sqrt(A)+math.sqrt(B)-math.sqrt(C)
   
if D<0:
  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 = 20001
	#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:
import math
a,b,c = map(int,input().split())

foo = int(math.sqrt(a*b))


if foo**2 < a*b:
    bar = 1
else:
    bar = -1
if a*b > 10**10:
    while True:
        foo += bar
        if foo**2 > a*b*bar:
            break

if foo**2 < a*b:
    foo += 0.1
elif foo**2 > a*b:
    foo -= 0.1

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

Submission status: Wrong Answer

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

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

import math

if abs(math.sqrt(c) - math.sqrt(b) - math.sqrt(a)) > 1e-10:
    if math.sqrt(c) - math.sqrt(b) - math.sqrt(a) > 0:
        print('Yes')
    else:
        print('No')
else:
    d = math.sqrt(c) * 1e10
    e = math.sqrt(b) * 1e10
    f = math.sqrt(a) * 1e10
    if math.sqrt(d) - math.sqrt(e) - math.sqrt(f) > 0:
        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*c-2*b*c > 2*a*b:
    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 + b + 2 * sqa * sqb < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

if math.sqrt(abc[0]) + math.sqrt(abc[1]) < math.sqrt(abc[2]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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())
a_sqrt = math.sqrt(a)
b_sqrt = math.sqrt(b)
c_sqrt = math.sqrt(c)

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

else:
	print('No') 
'''

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal, getcontext
getcontext().prec = 16
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:
a,b,c = map(int, input().split())

a,b,c = a%10**9, b%10**9, c%10**9
if 4*a*b < (c-a-b)**2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
a, b, c = [int(i) for i in input().split(' ')]
sqa = math.sqrt(a)
sqb = math.sqrt(b)
sqc = math.sqrt(c)
ans = 'Yes' if sqa + sqb < sqc else 'No'
print(ans)

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 100
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")