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: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('utf-8')


def solve():
    a, b, c = [int(x) for x in input().split()]
    d = c - a - b
    if d > 0 and d * d > 4 * a * b:
        print("Yes")
    else:
        print("No")
    

        
    
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()


"""

7
3 1
4 1
5 9
2 6
5 3
5 8
9 7 5

"""

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd, fsum
from functools import lru_cache, reduce
from decimal import Decimal, getcontext
from operator import mul

INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)


# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

# 組合せnCr
def combinations_count(n, r):
    if n < r:
        return 0
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# 素数判定
def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True


# limit以下の素数を列挙
def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P

# 同じものを含む順列
def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        # set（集合）型で重複を削除、ソート
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]



# ここから書き始める
a, b, c = map(int, input().split())
if c - a - b > 0 and 4 * a * b < (c - a - b) ** 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a,b,c = I()
if c < a+b:
    print("No")
    sys.exit()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

a,b,c = readints()

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

Submission status: Accepted

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

d=c-b-a
if (d>0) and (4*a*b <d*d):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if __name__ == "__main__":
    a, b, c = [int(x) for x in input().split(" ")]
    if a + b >= c:
        print("No")
        sys.exit(0)
    if 4 * a * b < (c - a - b) ** 2:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if d > 0 and 4*a*b < d**2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import math
a, b, c = [int(i) for i in input().split(" ")]
d = c - a - b
if 0 < d and 4 * a * b < d * d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import sqrt
a, b, c = [int(w) for w in input().split()]
cond = 4*a*b < (c-a-b)**2 and (c-a-b) > 0


print("Yes" if cond else "No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import bisect,copy,heapq,string
from collections import *
from math import *
from itertools import *
import sys
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def LIST()  : return list(MAP())

a, b, c = MAP()
print("Yes" if c-a-b > 0 and a**2+b**2+c**2-2*(a*b+b*c+c*a) > 0 else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
# a + 2√ab + b < c , 2√ab < c - a - b, 4ab < (c - a - b)^2
if c - a - b < 0:
    print("No")
else:
    print("Yes" if 4 * a * b < (c - a - b)**2 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c = mi()
    if c - (a + b) <= 0:
        print('No')
    else:
        print('Yes') if 4 * a * b < (c - (a + b)) ** 2 else print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if 4*A*B<(C-A-B)*(C-A-B) and C>A+B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = c - b - a
if x > 0 and a * b * 4 < x * x:
	print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")

import decimal
a,b,c = map(int, input().split())
val = (c-a-b)**2 - 4*a*b
if c-a-b<0:
    print("No")
else:
    if val>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal

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

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

Submission status: Accepted

Solution code:
from decimal import Decimal

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from decimal import Decimal

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

# ans = "Yes" if (math.sqrt(a) + math.sqrt(b)) < math.sqrt(c) else "No"
root = Decimal("0.5")
ans = "Yes" if ((a ** root) + (b ** root)) < (c ** root) else "No"


print(ans)

Submission status: Accepted

Solution code:
from decimal import Decimal
a,b,c=map(lambda x:Decimal(x)**Decimal("0.5"),input().split())
print("Yes" if a+b<c else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if c - a - b < 0:
  print("No")
  sys.exit()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if 4*a*b<(c-a-b)*(c-a-b) and c-a-b>=0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:

a, b, c = [int(x) for x in input().split()]
#a, b, c = [249999999, 250000000, 999999998]
d = c - a - b

if d <= 0:
    print("No")
else:
    if 4 * a * b < d * d:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import math
from decimal import Decimal
a, b, c = map(int, input().split())
if Decimal(str(a * b))**Decimal('0.5') >= Decimal(str((c - a - b) / 2)):
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

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

if a+b>c:
    print('No')
    exit()


f1 = 4*a*b - 2*a*b + 2*c*a + 2*b*c
f2 = c**2 + b**2 + a**2

if f1 < f2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal

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

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

Submission status: Accepted

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

d = 0

if ( a + b - c )  < 0:
  if ( a + b - c ) ** 2 > 4 * a * b:
    d = 1 
  
if d == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Jun 10 22:32:44 2020

@author: NEC-PCuser
"""
from decimal import Decimal
import numpy as np

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

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

a1 = a + b - c
if a1 >0:
    print('No')
    sys.exit()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import *

a,b,c = map(int, open(0).read().split())
getcontext().prec = 25
A = Decimal(a).sqrt()
B = Decimal(b).sqrt()
C = Decimal(c).sqrt()
if A + B < C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from decimal import Decimal, getcontext
a,b,c = input().split()
getcontext().prec = 10000
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
if a+b+Decimal(1e-14)< c:
	print("Yes")
else:
  	print("No")

Submission status: Accepted

Solution code:
import decimal

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

sqrta = decimal.Decimal(a).sqrt()
sqrtb = decimal.Decimal(b).sqrt()
sqrtc = decimal.Decimal(c).sqrt()

if sqrta + sqrtb < sqrtc:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal
import math
a, b, c = map(decimal.Decimal, input().split())
if 4 * a * b < (c-a-b) ** 2 and 0 < c-a-b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import decimal
a,b,c = map(decimal.Decimal,input().split())
print("Yes" if 4*a*b < (c-(a+b))**2 and 0 < c-(a+b) else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = [int(i) for i in input().split()]
print("Yes" if(a * a + b * b + c * c - 2 * a * b - 2 * b * c - 2 * c * a > 0 and c - a - b > 0) else "No")

Submission status: Accepted

Solution code:
def main():
    import sys
    def input(): return sys.stdin.readline().rstrip()
    a,b,c = map(int, input().split())
    import numpy as np
    if c-a-b >=0 and (c-a-b)**2-4*a*b > 0:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

from decimal import Decimal

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

from decimal import *

getcontext().prec = 100



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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d = c - a - b
e = 4*a*b

if(d>0 and d**2 > e):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal

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

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