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:
# -*- 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

import numpy as np

##### リストの 二分木検索 #####
# 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()

	if np.sqrt(a) + np.sqrt(b) <= np.sqrt(c):
		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:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [input() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [int(input()) for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def divisor(n):
        res = []
        i = 1
        for i in range(1, int(n ** 0.5) + 1):
            if n % i == 0:
                res.append(i)
                if i != n // i:
                    res.append(n // i)
        return res

    @staticmethod
    def round_up(a, b):
        return -(-a // b)

    @staticmethod
    def is_prime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True


class PriorityQueue:
    def __init__(self, l=[]):
        self.q = l
        heapq.heapify(self.q)
        return

    def push(self, n):
        heapq.heappush(self.q, n)
        return

    def pop(self):
        return heapq.heappop(self.q)


MOD = int(1e09) + 7
INF = int(1e15)


def main():
    # sys.stdin = open("sample.txt")
    a, b, c = Scanner.map_int()
    if (a ** 0.5 + b ** 0.5 < c ** 0.5):
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

square_list = [i**2 for i in range(10**5)]

def integer_squareroot(x):
    imin = 0
    imax = x
    while imin <= imax:
        imid = (imin + imax) // 2
        imid_squared = imid ** 2
        if imid_squared <= x:
            imin = imid + 1
        else:
            imax = imid - 1

    return imin - 1


A = list(map(int, input().split()))
for i in range(3):
    if A[i] in square_list:
        A[i] = integer_squareroot(A[i])
    else:
        A[i] = math.sqrt(A[i])

if A[0] + A[1] < A[2]:
    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:
# -*- coding: utf-8 -*-
import sys


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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3 ## -*- python -*-
import math

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 

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

if __name__ == '__main__':
    resolve()

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

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
	a, b, c = MAP()
	if c - a - b - 2 * sqrt(a * b) > 0:
		print("Yes")
	else:
		print("No")

if __name__=='__main__':
	main()

Submission status: Wrong Answer

Solution code:
def inpl():
    return list(map(int, input().split()))


a, b, c = inpl()
if (c - (a + b))**2 / 4 > a * b:
    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:
from math import sqrt

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
big = 10**19
d = (a*big)**.5 + (b*big)**.5
e = (c*big)**.5
#print(d)
#print(e)
if d < e:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(a: int, b: int, c: int):
    print(YES if (a**.5+b**.5 < c**.5) else NO)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

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")
print(math.sqrt(a)+math.sqrt(b), math.sqrt(c))

Submission status: Wrong Answer

Solution code:
import math


a,b,c = list(map(int, input().split(' ')))
s = math.sqrt(a * b)
t = (c * c - a - b) / 2

if s < t:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

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:
from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
import math
from fractions import gcd
import sys
#input = sys.stdin.readline


#N=int(input())

#A=list(map(int,input().split()))
#XY=[list(map(int,input().split())) for i in range(N)]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

import math

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

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

Submission status: Wrong Answer

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

if pow(a,1/2)+pow(b,1/2)<pow(c,1/2):
    print("Yes")

else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

def solve():
    A, B, C = map(int, input().split())
    if (C - A - B) ** 2 > 4 * A * B: print("Yes")
    else: print("No")

    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

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

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

print()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
enu = enumerate

sys.setrecursionlimit(10**7)
a, b, c = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
import math

a,b,c = [int(x) for x in input().split()]
x = c-a-b
y = 2 * math.sqrt(a*b)
if y<x:
    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:
from math import sqrt
a, b, c = map(int, input().split())
a = sqrt(a)
b = sqrt(b)
c = sqrt(c)
if a + b < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, input().split())
if 4 * a * b < (c - a - b) ** 2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
a, b, c = map(int,input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

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

Submission status: Wrong Answer

Solution code:
import math

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

if math.pow(a, 1 / 2) + math.pow(b, 1 / 2) < math.pow(c, 1 / 2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math





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


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
def main():
    from math import sqrt

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = 1
sq_list = []
while i ** 2 <= 10 ** 9:
	sq_list.append(i ** 2)
	i += 1

if a in sq_list and b in sq_list and c in sq_list:
	if round(a ** 0.5) + round(b ** 0.5) < round(c ** 0.5):
		print("Yes")
	else:
		print("No")
elif 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())
print("Yes" if 4 * a * b < (c - a - b)**2 else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
import math
k = math.sqrt(a[0]) + math.sqrt(a[1])

if k < math.sqrt(a[2]):
  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:
a, b, c = map(int, input().split())

sahen = a**0.5 + b**0.5

uhen = c**0.5

if sahen < uhen:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,c = LI()
x = 4*a*b
y = c**2 - 2*c*(a+b) + (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())
if (a)**(1/2)+(b)**(1/2)<(c)**(1/2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
n, m, k = map(int, input().split())
if math.sqrt(n) + math.sqrt(m) < math.sqrt(k):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt
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:
#!/usr/bin/env python
import numpy as np

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

    if a + b < c:
        print('yes')
    else:
        print('no')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x = input().split()

if 2*math.sqrt(int(x[0])*int(x[1])) < int(x[2]) - int(x[1]) - int(x[0]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(a: int, b: int, c: int):
    import numpy as np
    if np.sqrt(a)+np.sqrt(b)<np.sqrt(c):
        print(YES)
        exit()
    print(NO)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

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:
a,b,c=map(int,input().split())
if pow(a*(10**20),0.5)+pow(b*(10**20),0.5)<pow(c*(10**20),0.5):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

a, b, c = map(int, input().split())
tmp1 = a ** 0.5 + b ** 0.5
tmp2 = c ** 0.5

if tmp1 < tmp2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

a, b, c = MAP()
ans = 'No'
if 0 < a ** 2 + b ** 2 + c ** 2 - 2 * (a * b + b * c + c * a):
    ans = 'Yes'
print(ans)

Submission status: Wrong Answer

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

def main():
  a, b, c = map(int, input().split())
  r_a = math.sqrt(a)
  r_b = math.sqrt(b)
  r_c = math.sqrt(c)
  if r_a+r_b<r_c:
    print('Yes')
  else:
    print('No')
  

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np
import math
a,b,c = map(int, input().split())
# n = int(input())
# p = list(map(int, input().split()))
ans = 'No'

# print(a)
if a + b + 2 * int(math.sqrt(a*b)) +1 <= c:
    ans = 'Yes'

print(ans)

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

if round(sqrt(a)+sqrt(b),3)<round(sqrt(c),3):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# from fractions import gcd
# mod = 10 ** 9 + 7
# N = int(input())
# a = list(map(int,input().split()))
# a,b,c = map(int,input().split())
# ans = [0] * N
# math.ceilで切り上げ
# dp = [[0] * 4 for i in range(3)] #2次元配列初期化
# dp = [[[0] * 2 for i in range(3)] for j in range(5)]
# (ord('A'))でASCII出力 Aは65
import math
import numpy as np
import statistics
import string
import sys
from array import array
from collections import deque

def intinput():
    return int(input())
def listintinput():
    return list(map(int, input().split()))
def splitintinput():
    return map(int, input().split())
def factorialsurplus(x, y, z):  # xからyまでの階乗をzで割ったあまりを求める
    ret = 1
    for i in range(x, y + 1):
        ret = (ret * i) % z
    return (ret)
def isprime(x):
    if x == 1:
        return False
    if x == 2:
        return True
    sq = int(math.sqrt(x))
    for i in range(2,sq+1):
        if x % i == 0:
            return False
    return True
def hcfnaive(a,b):#最大公約数 math.gcdが使えない時の手段として入れとく。pythonが更新されたらいらなくなるはず
    if(b==0):
        return a
    else:
        return hcfnaive(b,a%b)

a,b,c = splitintinput()
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())
sa, sb, sc = a ** (1/2), b ** (1/2), c ** (1/2)
if sa + sb < sc:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math


a,b,c = list(map(int, input().split(' ')))
s = math.sqrt(a * b)
t = (c * c - a - b) // 2

if s < t:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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())
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 2*math.sqrt(a*b)+a+b<c:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from sys import stdin,setrecursionlimit
import math
setrecursionlimit(10**7)
a,b,c = map(int,stdin.readline().rstrip().split())
if a+b+2*math.sqrt(a*b) < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys,math
#input = sys.stdin.buffer.readline

def inn(func=int):
    return list(map(func,input().split()))

def ins():
    return input().split()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt


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

Submission status: Wrong Answer

Solution code:
import math

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


d = 4*a*b
e = (c-a-b)**2

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

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    import math
    input = sys.stdin.readline
    a, b, c = map(int, input().split())

    # sa, sb, sc = math.sqrt(a), math.sqrt(b), math.sqrt(c)
    ab = math.sqrt(a*b)

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

    # if sa+sb < sc:
    #     print('Yes')
    # else:
    #     print('No')


if __name__ == '__main__':
    main()

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