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
from decimal import *

rline = sys.stdin.readline


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
def main():
    a, b, c = map(int, input().split())
    ans = "Yes"
    if 4 * a * b == (c - a - b) ** 2:
        ans = "No"
    else:
        if math.ceil(a ** (1 / 2) + b ** (1 / 2)) > math.ceil(c ** (1 / 2)):
            ans = "No"
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=(float(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:
# coding: utf-8
import numpy as np

a, b, c = map(int, input().split())
# print(a, b, c)
# if a + b < c:
#     print('Yes')
# print(np.sqrt(a))
# print(np.sqrt(b))
# print(np.sqrt(c))
if (np.sqrt(a) + np.sqrt(b) < np.sqrt(c)) and (-1 *(np.sqrt(a) + np.sqrt(b)) > -1*np.sqrt(c)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import numpy

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

Submission status: Wrong Answer

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

 
#a = np.array([a]).astype('float64')[0]
#b = np.array([b]).astype('float64')[0]
#c = np.array([c]).astype('float64')[0]



#if c**2 + a**2 + b**2 -2*a*c + -2*b*c + 2*a*b > 4*a*b:
if np.sqrt(a).astype('float64') + np.sqrt(b).astype('float64') < np.sqrt(c).astype('float64'):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

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

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

Submission status: Wrong Answer

Solution code:
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(int, input().split())
print('Yes' if sqrt(a) + sqrt(b) < sqrt(c) else 'No')

Submission status: Wrong Answer

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

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 = 300
	#print(Decimal(a).sqrt())

	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
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 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:
p = list(map(int,input().split()))
a = p[0]
b = p[1]
c = p[2]
if 0 < a**2 + b**2 + c**2 - 2*(a*b+b*c+c*a):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

a, b, c = list(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:
from decimal import *
from math import *

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

input = input().split()

a = math.sqrt(float(input[0]))
b = math.sqrt(float(input[1]))
c = math.sqrt(float(input[2]))
if a+b<=c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import numpy
from decimal import *

getcontext().prec = 10000
a,b,c =map(int,input().split())
d=math.sqrt(a)
e=math.sqrt(b)
f=math.sqrt(c)
h= d+e
if h<f:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c = map(int, input().split())
l = np.float128(np.sqrt([a,b,c]))
if l[0]+l[1] < l[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

val = input().split(' ')
a = int(val[0])
b = int(val[1])
c = int(val[2])

# TODO このままだと、丸め桁数分間違いが発生する可能性がある
diff = sqrt(c) - sqrt(a) + sqrt(b)
result = 'Yes' if diff > 0 else 'No'
if diff > 0 and diff < 0.0000000000000001:
    result = 'No'
print(result)

Submission status: Wrong Answer

Solution code:
import sys
import os
import math
from decimal import Decimal

Q = 10 * 9


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b, c = list(map(int, sys.stdin.readline().split()))
    # print(math.sqrt(a * Q), math.sqrt(b * Q), math.sqrt(c * Q))
    # print(Decimal(math.sqrt(a*Q)), Decimal(math.sqrt(b*Q)), Decimal(math.sqrt(c*Q)))

    print('Yes' if Decimal(math.sqrt(a*Q)) + Decimal(math.sqrt(b*Q)) < Decimal(math.sqrt(c*Q)) else 'No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
x = a*b*4
y = (c-a+b)**2

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

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

Submission status: Wrong Answer

Solution code:
inp = list(map(int,input().split()))
if (inp[0]<5000000000):
    if (inp[0]+inp[1]-inp[2] < -2 * (inp[0]*inp[1])**0.5):
        print("Yes")
    else:
        print("No")
else:
    if(inp[0]**2+inp[1]**2+inp[2]**2-2*(inp[0]*inp[1]+inp[1]*inp[2]+inp[0]*inp[1])<0):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import math

s = input().split()
a, b, c = int(s[0]), int(s[1]), int(s[2])

k = max(float(a), float(b))
if float(a) + float(b) - float(c) + 2.0 * math.sqrt(a*k * b*k) / k < 0.0:
    if a < 990000000 or b < 990000000:
        print("Yes")
        # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))
    else:
        print("No")
else:
    if a < 990000000 or b < 990000000:
        print("No")
        # print("{} {} {}".format(numpy.sqrt(a), numpy.sqrt(b), numpy.sqrt(c)))
    else:
        print("Yes")

Submission status: Wrong Answer

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

import math

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math

def nroot(a, n, x=1.0, eps=1e-9):
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x

a,b,c=list(map(lambda i:int(i),input().split()))
if(nroot(c,2) -(nroot(a,2)+nroot(b,2))) >0 :
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if x < math.sqrt(c):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(float,input().split())
print('Yes' if (c-a-b)**2 > 4*a*b else '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())
ep = 10**(-3)
if 0 < a*a+b*b+c*c-2*(a+b)*c-2*a*b + ep:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- 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 = 100
	#print(Decimal(a).sqrt())

	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
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 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 sys
input = sys.stdin.readline
# import math
# sqrt = math.sqrt

# def int_sqrt2(n):
#     def f(prev):
#         while True:
#             m = (prev + n / prev) / 2
#             if m >= prev:
#                 return prev
#             prev = m
    
#     return f(int(sqrt(n) * (1 + 1e-20)))

# from decimal import *

# getcontext().prec = 20      # デフォルト28桁のところを20桁にする
# m = int(Decimal(n).sqrt())
# print m ** 2 - n            # -2222221948

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

def gcd(n,m):
    while m:
        n,m = m, n%m
    return n

def lcm(n,m):
    return n*m//gcd(n,m)


def main():
    # N = int(input())
    A,B,C = linput()
    # vA = linput()
    # S = input()
    # mX = [linput() for _ in [0,]*N]

    # res = 0
    # res = -(-N//M)

    # LH = A**.5 + B**.5
    # RH = C**.5

    # rtAB = int(Decimal(A*B).sqrt())
    # rtAB = int_sqrt2(A*B)

    LH = A * B * 4
    RH = (C-A-B)**2

    res = ("No","Yes")[LH < RH]

    print(res)

main()

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
de = c - a - b
dob = a * b * 4

if dob < de*de:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

input = input().split()

a = math.sqrt(float(input[0]))
b = math.sqrt(float(input[1]))
c = math.sqrt(float(input[2]))
if a+b<c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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())
#sqa = math.floor(math.sqrt(a)*10**(1000))/10**(1000)
#sqb = math.floor(math.sqrt(b)*10**(1000))/10**(1000)
#sqc = math.floor(math.sqrt(c)*10**(1000))/10**(1000)

sqa = float("{:.100f}".format(math.sqrt(a)))
sqb = float("{:.100f}".format(math.sqrt(b)))
sqc = float("{:.100f}".format(math.sqrt(c)))

#s = c - (a + b)
#t = 2 * sqa * sqb
#if t < s:
#  print("Yes")
#else:
#  print("No")
#sqc = math.sqrt(c)
if sqa + sqb < sqc:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

#if isinstance(abc[0], int) == True and isinstance(abc[1], int) == True isinstance(abc[2], int) == True:
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:
from math import sqrt

a, b, c = map(float, input().split())
k = max(a, b)

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

Submission status: Wrong Answer

Solution code:
from decimal import *
getcontext().prec = 10
a,b,c = map(float, input().split())
if Decimal(a).sqrt()+Decimal(b).sqrt()<Decimal(c).sqrt():
  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())

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

if a+b+2*ab<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) else print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a + b >= c:
    print('No')
elif a**0.5+b**0.5-c**0.5 < 1e-50:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# from 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 c - a - b < 0:
        if left < right:
            print("No")
        else:
            print("Yes")
        exit()
 


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

s=Decimal(sqrt(a))
t=Decimal(sqrt(b))
u=Decimal(sqrt(c))

if s>=t:
  if a-b < u*(s-t):
    print("Yes")
  else:
    print("No")
else:
  if b-a < u*(t-s):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

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

import math
aa = math.sqrt(a)
bb = math.sqrt(b)
cc = math.sqrt(c)
if a + b < c:
    if (aa + bb) < cc:
        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")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
abc = input().split()
root_a = math.sqrt(int(abc[0]))
root_b = math.sqrt(int(abc[1]))
root_c = math.sqrt(int(abc[2]))
stg = root_a + root_b
if stg < root_c:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
inp = list(map(int,input().split()))
if (inp[0]<100000000000):
    if (inp[0]+inp[1]-inp[2] < -2 * (inp[0]*inp[1])**0.5):
        print("Yes")
    else:
        print("No")
else:
    if(inp[0]**2+inp[1]**2+inp[2]**2-2*(inp[0]*inp[1]+inp[1]*inp[2]+inp[0]*inp[1])<0):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

if a!=b:
  print('Yes' if 2*a+2*b<=c else 'No')
else:
  print('Yes' if 2*a+2*b<c else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

#print(ra + rb - rc)

if ra + rb - rc < 0:
    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 > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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