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 math
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 = list(map(int, input().split()))
print('Yes' if a + b + 2 * ((a * b) ** 0.5) < c - 1e-10 else 'No')

Submission status: Wrong Answer

Solution code:
import bisect
import collections
import sys

sys.setrecursionlimit(100000)
input = sys.stdin.readline
ACMOD = 1000000007
INF = 1 << 32


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


def llmi(n):
    return [lmi() for _ in range(n)]

a,b,c = lmi()

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

Submission status: Wrong Answer

Solution code:
#C
A,B,C=map(int,input().split())
if 4*A*B<(C-A-B)**2:
    print('Yes')
else:
    print('No')

#D

Submission status: Wrong Answer

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy 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()))
if(sqrt(a) + sqrt(b) < 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) < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

a,b,c = nm()
eps = 10**-7

if (a*b)**.5 < (c-a-b)/2 + eps:
    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())
import math
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 = map(float,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**(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 A + B + 2 * (A * B) ** 0.5 < C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt
a, b, c = list(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.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**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 (a ** (1/2)) + (b ** (1/2)) < (c **(1/2)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
# coding: utf-8
import sys
sys.setrecursionlimit(10000000)

#const
# my functions here!
def pin(type=int):
    return map(type,input().rstrip().split())

def resolve():
    a,b,c=pin()
    from math import sqrt
    cond =sqrt(a)+sqrt(b)<sqrt(c) 
    print(["No","Yes"][cond])
"""
#printデバッグ消した？
#前の問題の結果見てないのに次の問題に行くの？
"""
"""
お前カッコ閉じるの忘れてるだろ
"""
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """2 3 9"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """2 3 10"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__=="__main__":resolve()

Submission status: Wrong Answer

Solution code:
import numpy as np
import fractions

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

def one_int():
    return int(input())

def one_str():
    return input()

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

A, B, C = input_int()

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 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 a**0.5+b**0.5 < c**0.5 else 'No')

Submission status: Wrong Answer

Solution code:
from math import ceil
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 math import sqrt


def main():
    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 c-(a+b)>2*(a*b)**0.5:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys,collections as cl,bisect as bs,math
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a,b,c = m()

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

Submission status: Wrong Answer

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    a,b,c = inpm()
    if a**(1/2)+b**(1/2)<c**(1/2):
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np

a, b, c = list(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:
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 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:
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())
migi=c-a-b
hidari=2*((a*b)**(1/2))
print('Yes' if migi > hidari else '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())
if sqrt(a)+sqrt(b) < sqrt(c):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

import math

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

Submission status: Wrong Answer

Solution code:
# import sys
import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
# import collections # queue
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

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

if __name__=='__main__':
    main()

Submission status: Wrong Answer

Solution code:
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

def solve():
    a, b, c = [int(_) for _ in raw_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 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:
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 = 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:
a, b, c = [int(i) for i in 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 sqrt(a) + sqrt(b) < sqrt(c):
    ans = "Yes"
else:
    ans = "No"

print(ans)

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

if c>a+b+2*math.sqrt(a*b):
    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
li = list(map(int,input().split()))
a, b, c = li

if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    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 sqrt(a) + sqrt(b) < sqrt(c):
    ans = 'Yes'
print(ans)

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

from math import sqrt

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("YNeos"[a**0.5+b**0.5>=c**0.5::2])

Submission status: Wrong Answer

Solution code:
a,b,c = [int(i) for i in input().split()]
ak = a**(1/2)
bk = b**(1/2)
ck = c**(1/2)
if ak+bk < ck:
    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=[int(i) for i in input().split()]
print("Yes" if a**0.5+b**0.5<c**0.5 else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
print("YNeos"[a**0.5+b**0.5>=c**0.5::2])

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=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 numpy as np
a,b,c = list(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())
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 = 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 = [int(i) for i in input().split()]
print('Yes' if (a**.5 + b**.5)<(c**.5) else '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 accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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

a, b, c = MAP()

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)**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:
from math import sqrt

a, b, c = map(int, input().split())
sa = sqrt(a)
sb = sqrt(b)
sc = sqrt(c)

print("Yes" if sa + sb < sc else "No")

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import sys
from math import sqrt

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7


a, b, c = MI()
left = a + 2 * sqrt(a * b) + b
if left < 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) + 10 ** -5:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt


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

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


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C
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 math

def solve():
    a, b, c = list(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:
def main():
    import sys
    input = sys.stdin.readline

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

def main():
    mod=10**9+7
    a,b,c=MI()
    ra=a**0.5
    rb=b**0.5
    rc=c**0.5
    if ra+rb<rc:
        print("Yes")
    else:
        print("No")

main()

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols
    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])
    return ret


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_map_as_int(H):
    '''
    #→1,.→0として読み込む
    '''
    ret = []
    for _ in range(H):
        ret.append([1 if s == '#' else 0 for s in read()[:-1]])
        # 内包表記はpypyでは若干遅いことに注意
        # #numpy使うだろうからこれを残しておくけど
    return ret


# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from fractions import gcd


def lcm(a, b):
    # 最小公約数
    g = gcd(a, b)
    return a * b // g


a, b, c = read_ints()
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())
print('Yes' if a**0.5+b**0.5 < c**0.5 else '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 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 a**.5+b**.5<c**.5:
    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:
def solve():
    N, M, L = map(int, input().split())
    return 'Yes' if N ** 0.5 + M  ** 0.5 < L ** 0.5 else 'No'

print(solve())

Submission status: Time Limit Exceeded

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7

#############
# Main Code #
#############

def judge(x):
    for i in range(1, x):
        if x // i == i and x % i == 0:
            return i
        elif x // i == 0:
            break
    return False

A, B, C = getNM()
j_a = judge(A)
j_b = judge(B)
j_c = judge(C)
if j_a and j_b and j_c and j_a + j_b == j_c:
    print('No')
    exit()

if (math.sqrt(A) + math.sqrt(B)) < math.sqrt(C):
    print('Yes')
else:
    print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
from decimal import *
getcontext().prec = 100000

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

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

Submission status: Time Limit Exceeded

Solution code:
import sys
from itertools import combinations, permutations, product, combinations_with_replacement, accumulate
from heapq import heapify, heappop, heappush, heappushpop
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from math import sqrt, log, floor, ceil, factorial, cos, sin, pi #, gcd
from fractions import gcd
from operator import mul
from functools import reduce
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
INF = float('inf')
LINF = 2**63-1
NIL = -LINF
MOD = 10**9+7
MGN = 4
def II(): return int(input())
def IF(): return float(input())
def IS(): return input().replace('\n', '')
def ILCI(n: int): return [II() for _ in range(n)]
def ILCF(n: int): return [IF() for _ in range(n)]
def ILI(): return list(map(int, input().split()))
def ILLI(n: int): return [[int(j) for j in input().split()] for i in range(n)]
def ILF(): return list(map(float, input().split()))
def ILLF(n: int): return [[float(j) for j in input().split()] for i in range(n)]
def LTOS(lst: list, sep: str = ' '): return sep.join(map(str, lst))
def DEC(lst: list): return list(map(lambda x: x-1, lst))
def INC(lst: list): return list(map(lambda x: x+1, lst))


def main():
    A,B,C = ILI()

    ans = "No"
    if C - A - B < 0:
      for i in range(10**8):
        pass
    
    # A + 2sqrt(AB) + B < C
    if C - A - B  > 0 and  4 * A * B < (C- A - B) ** 2:
        ans = "Yes"

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys
from itertools import combinations, permutations, product, combinations_with_replacement, accumulate
from heapq import heapify, heappop, heappush, heappushpop
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from math import sqrt, log, floor, ceil, factorial, cos, sin, pi #, gcd
from fractions import gcd
from operator import mul
from functools import reduce
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
INF = float('inf')
LINF = 2**63-1
NIL = -LINF
MOD = 10**9+7
MGN = 4
def II(): return int(input())
def IF(): return float(input())
def IS(): return input().replace('\n', '')
def ILCI(n: int): return [II() for _ in range(n)]
def ILCF(n: int): return [IF() for _ in range(n)]
def ILI(): return list(map(int, input().split()))
def ILLI(n: int): return [[int(j) for j in input().split()] for i in range(n)]
def ILF(): return list(map(float, input().split()))
def ILLF(n: int): return [[float(j) for j in input().split()] for i in range(n)]
def LTOS(lst: list, sep: str = ' '): return sep.join(map(str, lst))
def DEC(lst: list): return list(map(lambda x: x-1, lst))
def INC(lst: list): return list(map(lambda x: x+1, lst))


def main():
    A,B,C = ILI()

    ans = "No"
    if C - A - B < 0:
      for i in range(10**9):
        A *= 1
    
    # A + 2sqrt(AB) + B < C
    if C - A - B  > 0 and  4 * A * B < (C- A - B) ** 2:
        ans = "Yes"

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
A, B, C = map(int, input().split())

def intSqrt(n):
    M = int(n**0.5)

    while (M + 1)**2 <= n:
        M += 1

    for _ in range(4000):
        n *= 100
        M *= 10
        for add in range(0, 10)[:: -1]:
            if (M + add)**2 <= n:
                M += add
                break

    return M

if intSqrt(A) + intSqrt(B) < intSqrt(C):
    print('Yes')
else:
    print('No')

Submission status: Time Limit Exceeded

Solution code:
A, B, C = map(int, input().split())

def intSqrt(n):
    M = int(n**0.5)

    while (M + 1)**2 <= n:
        M += 1

    for _ in range(10000):
        n *= 100
        M *= 10
        for add in range(0, 10)[:: -1]:
            if (M + add) * (M + add) <= n:
                M += add
                break

    return M

if intSqrt(A) + intSqrt(B) < intSqrt(C):
    print('Yes')
else:
    print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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