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:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *
from decimal import *
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import *				# bisect_left(arr,x,start,end)  => start and end parameters are temporary
from sys import stdin				# bisect_left return leftmost position where x should be inserted to keep sorted
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)
	

a,b,c = list(map(int, stdin.readline().rstrip().split()))
getcontext().prec = 100
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
# print(a,b,c)
if(a + b < c):
	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):
    print(YES if a + b + 2 * (a * b)**0.5 < c else NO)


# 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:
#coding:utf-8
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())
aa = a+b+2*math.sqrt(a*b)
if c>aa:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
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())
print('Yes' if math.sqrt(a)+math.sqrt(a)<math.sqrt(c) else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

if math.sqrt(n[0]) + math.sqrt(n[1]) < math.sqrt(n[2]):
    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:
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 numpy
a,b,c = map(int,input().split())
if(a + b + 2*numpy.sqrt(a*b) < c):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
from collections import deque
def main():
    a,b,c = tuple([int(t)for t in input().split()])

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt
from decimal import *

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

Submission status: Wrong Answer

Solution code:
import math

li = list(map(int,input().split()))
a = math.sqrt(li[0])
b = math.sqrt(li[1])
c = math.sqrt(li[2])
if a + b < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

Submission status: Wrong Answer

Solution code:
import sys
import itertools
import math
from collections import deque
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Wrong Answer

Solution code:
import math
ABC=input().split()
A=math.sqrt(int(ABC[0]))
B=math.sqrt(int(ABC[1]))
C=math.sqrt(int(ABC[2]))
if A+B<C :
    print ("Yes")
else :
    print ("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 2020/03/14
# パナソニックプログラミングコンテスト2020 - C

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

# Calc
asq = a ** (1/2)
bsq = b ** (1/2)
csq = c ** (1/2)

if asq + bsq < csq:
    ans = "Yes"
else:
    ans = "No"

# Output
print(ans)

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:
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:
a,b,c = [int(x) for x in 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 (c-a-b)**2>4*a*b:
    ans=True
else:
    ans=False
print('Yes' if ans else 'No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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 math
a,b,c = map(int,input().split())
hoge = a**0.5+b**0.5>=c**0.5

print(["No","Yes"][math.sqrt(a)+math.sqrt(b) < math.sqrt(c)])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]
    
    (a, b, c) = [int(e) for e in lines[0].split(" ")]

    return (a, b, c)


def solve(a, b, c):



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

    return  result


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Wrong Answer

Solution code:
from math import sqrt
a, b, c = map(int, input().split())
print('Yes' if ((a + b + 2 * sqrt(a * b)) < c) 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 sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())

def main():
    a, b, c = MI()
    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:
#!/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:
import math
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nf = lambda: map(float, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7 
sys.setrecursionlimit(1000010)


a,b,c = nf()

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
from decimal import Decimal

t = input().split(' ')
if sqrt(Decimal(t[0])) + sqrt(Decimal(t[1])) < sqrt(Decimal(t[2])) :
    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:
import math
a, b, c = [int(s) for s in input().split()]
ans = 2*math.sqrt(a*b) + float(a) + float(b)
if ans < float(c):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
abc = list(map(int, input().split()))
import numpy as np
abc_sq = np.sqrt(abc)
if abc_sq[0] + abc_sq[1] < abc_sq[2]:
    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:
import math

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


rt = math.sqrt

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

import math

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

Submission status: Wrong Answer

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

l = a * b * 4
r = (c - a - b) ** 2
if l < r:
    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 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = tuple(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())
if (a**0.5 + b**0.5) <= c**0.5:
    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'


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

Submission status: Wrong Answer

Solution code:
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math

import itertools

#import bisect

import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]



def main():
    a,b,c=map(int,input().split())
    seisubu=c-a-b
    ab=a*b

    if seisubu**2-ab*4>0:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np
import math as m

def main(**kwargs):
    res = "No"

    if 4 * a * b < (c - a - b) ** 2:
        res = "Yes"

    return res

if __name__ == "__main__":
    cin = np.array(input().split(" ")).astype("int")
    a, b, c, *_ = cin

    cout = main(a=a, b=b, c=c)
    print(cout)

Submission status: Wrong Answer

Solution code:
import math

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

sab = math.sqrt(a * b)

if a + b + sab * 2 < c :
  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())
if pow(a, 0.5) + pow(b, 0.5) < pow(c, 0.5):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import sqrt

eps = 1e-8

def eq(a, b):
    return a + eps > b and a - eps < b

a, b, c = list(map(int, input().split()))
if 2 * sqrt(a * b) < c - a - b - eps:
    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())
d = c-a-b
if d**2 > 4*a*b:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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


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

#     # divisors.sort()
#     return divisors


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


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

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

#     return True


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

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


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


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


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

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

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

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

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

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

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

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

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

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


class manacher:

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

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

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


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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/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+b+(2*((a*b)**.5)) < c) 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:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


def MI(): return map(int, input().split())


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YNL = {False: 'No', True: 'Yes'}
YNU = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    a, b, c = MI()

    # print(a ** 0.5 + b ** 0.5, c ** 0.5)
    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:
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 decimal
import math
a, b, c = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
import math

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

root_a = math.sqrt(a)
root_b = math.sqrt(b)
root_c = math.sqrt(c)

if root_a + root_b < root_c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
"""
Author    : co_devil Chirag Garg
Institute : JIIT
"""
from math import log, ceil
from collections import defaultdict
from math import *
from sys import stdin, stdout
import itertools
import os
import sys
import threading
from collections import deque, Counter, OrderedDict, defaultdict
from heapq import *
# from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd
# from bisect import bisect_left,bisect_right
# from decimal import *,threading
from fractions import Fraction
mod = int(pow(10, 9)+7)


def ii(): return int(input())


def si(): return str(input())


def mi(): return map(int, input().split())


def li(): return list(mi())


def fii(): return int(stdin.readline())


def fsi(): return str(stdin.readline())


def fmi(): return map(int, stdin.readline().split())


def fli(): return list(fmi())


abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12,
       'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24,
       'z': 25}


def getKey(item): return item[0]


def sort2(l): return sorted(l, key=getKey)


def d2(n, m, num): return [[num for x in range(m)] for y in range(n)]


def isPowerOfTwo(x): return (x and (not (x & (x - 1))))


def decimalToBinary(n): return bin(n).replace("0b", "")


def ntl(n): return [int(i) for i in str(n)]


def powerMod(x, y, p):
    res = 1
    x %= p
    while y > 0:
        if y & 1:
            res = (res * x) % p
        y = y >> 1
        x = (x * x) % p
    return res


graph = defaultdict(list)
visited = [0] * 1000000
col = [-1] * 1000000


def bfs(d, v):
    q = []
    q.append(v)
    visited[v] = 1
    while len(q) != 0:
        x = q[0]
        q.pop(0)
        for i in d[x]:
            if visited[i] != 1:
                visited[i] = 1
                q.append(i)
        print(x)


def make_graph(e):
    d = {}
    for i in range(e):
        x, y = mi()
        if x not in d:
            d[x] = [y]
        else:
            d[x].append(y)
        if y not in d:
            d[y] = [x]
        else:
            d[y].append(x)
    return d


def gr2(n):
    d = defaultdict(list)
    for i in range(n):
        x, y = mi()
        d[x].append(y)
    return d


def connected_components(graph):
    seen = set()

    def dfs(v):
        vs = set([v])
        component = []
        while vs:
            v = vs.pop()
            seen.add(v)
            vs |= set(graph[v]) - seen
            component.append(v)
        return component

    ans = []
    for v in graph:
        if v not in seen:
            d = dfs(v)
            ans.append(d)
    return ans


def primeFactors(n):
    s = set()
    while n % 2 == 0:
        s.add(2)
        n = n // 2
    for i in range(3, int(sqrt(n)) + 1, 2):
        while n % i == 0:
            s.add(i)
            n = n // i
    if n > 2:
        s.add(n)
    return s


def find_all(a_str, sub):
    start = 0
    while True:
        start = a_str.find(sub, start)
        if start == -1:
            return
        yield start
        start += len(sub)


def SieveOfEratosthenes(n, isPrime):
    isPrime[0] = isPrime[1] = False
    for i in range(2, n):
        isPrime[i] = True
    p = 2
    while (p * p <= n):
        if (isPrime[p] == True):
            i = p * p
            while (i <= n):
                isPrime[i] = False
                i += p
        p += 1
    return isPrime


def dijkstra(edges, f, t):
    g = defaultdict(list)
    for l, r, c in edges:
        g[l].append((c, r))

    q, seen, mins = [(0, f, ())], set(), {f: 0}
    while q:
        (cost, v1, path) = heappop(q)
        if v1 not in seen:
            seen.add(v1)
            path = (v1, path)
            if v1 == t:
                return (cost, path)

            for c, v2 in g.get(v1, ()):
                if v2 in seen:
                    continue
                prev = mins.get(v2, None)
                next = cost + c
                if prev is None or next < prev:
                    mins[v2] = next
                    heappush(q, (next, v2, path))
    return float("inf")


def binsearch(a, l, r, x):
    while l <= r:
        mid = l + (r-1)//2
        if a[mid]:
            return mid
        elif a[mid] > x:
            l = mid-1
        else:
            r = mid+1
    return -1


def dfs(d, v):
    q = []
    q.insert(0, v)
    visited[v] = 1
    while len(q) != 0:
        x = q[0]
        q.pop(0)
        for i in d[x]:
            if visited[i] != 1:
                visited[i] = 1
                q.insert(0, i)
        print(x)


def sq(n):
    return n**0.5


a, b, c = mi()

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

Submission status: Wrong Answer

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