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:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        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 combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        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 combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    a, b, c = R()
    if c > a + b and (c - a - b)**2 > 4*a*b:
        print('Yes')
    else:
        print('No')
    
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

from decimal import Decimal

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

a = Decimal(A).sqrt()
b = Decimal(B).sqrt()
c = Decimal(C).sqrt()


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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
import math
import sys
m=9223372036854775808
A=math.sqrt(a)
B=math.sqrt(b)
C=math.sqrt(c)
d=c-a-b
e=a*b*4
f=d*d
if e<f and d>0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!python3.4
# -*- coding: utf-8 -*-
# panasonic2020/panasonic2020_c
import sys
from math import sqrt

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))


def main():
    a, b, c = i2nn()
    if a + b >= c:
        print('No')
        return
    if 4 * a * b < (c - a - b)**2:
        print('Yes')
    else:
        print('No')
    return

main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque, Counter
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math
from decimal import *
INF = 10 ** 20

def main():
    a,b,c = getList()
    k = max([a,b,c])
    getcontext().prec = 20  # デフォルト28桁のところを20桁にする
    a = Decimal(a).sqrt()
    b = Decimal(b).sqrt()
    c = Decimal(c).sqrt()
    # if math.sqrt(a/k) + math.sqrt(b/k)  < math.sqrt(c/k):
    if a + b < c:
        print("Yes")
    else:
        print("No")

    # print(math.sqrt(2000000000))
if __name__ == "__main__":
    main()

Submission status: Accepted

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

if m <= 0:
  print('No')

else:
  X = (m * m) - (4 * a * b)
  if X > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-y
import math
import decimal

a, b, c = map(int, input().split())
"""
left = a + 2 * math.sqrt(a) * math.sqrt(b) + b
"""

if decimal.Decimal(a).sqrt() + decimal.Decimal(b).sqrt() < decimal.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) * (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 > 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import *

a,b,c = map(int,input().split())
a2 = Decimal(str(a))
b2 = Decimal(str(b))
c2 = Decimal(str(c))

if a2.sqrt() + b2.sqrt() < c2.sqrt():
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from decimal import *
i = list(map(int, input().split()))

a = int(i[0])
b = int(i[1])
c = int(i[2])

a1 = Decimal(a).sqrt()
b1 = Decimal(b).sqrt()
c1 = Decimal(c).sqrt()

if a1 + b1 < c1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
import math
import collections
from collections import deque
#k = int(input())
a, b, c = map(int, sys.stdin.readline().split())
#s = input()
#x = sys.stdin.readline().split()

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

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

if d - e > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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


if __name__=='__main__':
	main()

Submission status: Accepted

Solution code:
from decimal import *
A, B, C = map(int,input().split())
a = Decimal(A)
b = Decimal(B)
c = Decimal(C)
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 a + b > c:
    print("No")
else:
    if 4 * a * b < (c - a - b) ** 2:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
from decimal import Decimal, getcontext

getcontext().prec = 100

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

Submission status: Accepted

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

sahen=4*a*b

uhen=pow((c-b-a),2)

if c-b-a<0:
    print("No")
else:
    if sahen <uhen:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
x,y,z = map(int, input().split())
 
if (x + y - z) * (x + y - z) > (4 * x * y):
  if z -x - y < 0:
    print('No')
  else:
    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*d:    
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from collections import deque, defaultdict
import bisect
from math import factorial, sqrt


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

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

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


if __name__ == '__main__':
    main()

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 c >= a+b:
#if float(math.sqrt(a))+ float(math.sqrt(b)) < float(math.sqrt(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())
if (c - a - b) ** 2 > 4 * a * b and c - a - b > 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from decimal import Decimal
import math
nums = list(map(Decimal, input().split()))

if nums[0].sqrt() + nums[1].sqrt() < nums[2].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')
  exit()
if (c-a-b)**2>4*a*b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import sys

a, b, c = map(int, sys.stdin.readline().split())
if (c-(a+b))>0 and (a**2 + b**2 + c**2) > 2*(a*b + b*c + c*a):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 'No'
if c-a-b < 2:
    ans = 'No'
elif 4*a*b < (c-a-b)**2:
    ans = 'Yes'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
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=input().split()
a=int(a)
b=int(b)
c=int(c)
if a>=c or b>=c:
	print("No")
else:
	x=4*a*b
	y=(c-(a+b))*(c-(a+b))

	if x<y:
		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')
else:
    if (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,input().split())
a=Decimal(a)
b=Decimal(b)
c=Decimal(c)
if a.sqrt()+b.sqrt()<c.sqrt():
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import *


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
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:
abc = input().split()

a = int(abc[0])
b = int(abc[1])
c = int(abc[2])
import math
if a > c:
  print('No')
elif b > c:
  print('No')
elif 4*a*b < a**2 + b**2 +c**2 - 2*a*c -2*b*c + 2*a*b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

c -= a + b

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

Submission status: Accepted

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

if a+b > c:
    print('No')
elif pow(c-a-b,2) > 4*a*b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
import math
from fractions import gcd
import sys
from decimal import *
#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())
X=gcd(gcd(a,b),c)
c//=X
a//=X
b//=X
getcontext().prec = 500
c=Decimal(c).sqrt()
b=Decimal(b).sqrt()
a=Decimal(a).sqrt()

if c-a-b>0.0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
l = sys.stdin.readline().strip()
 
a, b, c = map(int, l.split())
right = (c-a-b)
if right < 2:
    print("No")
else:
    right *= right
    left = 4 * a *b
    if left < right:
        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:
def main():
    a, b, c = map(int, input().split())

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


main()

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

Submission status: Accepted

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
aa = Decimal(a).sqrt()
bb = Decimal(b).sqrt()
cc = Decimal(c).sqrt()
# print(a,b,c)
if(a + b + 2*aa*bb < c):
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = input().strip().split()
a, b, c = [int(a), int(b), int(c)]
if(c-a-b < 0):
  print("No")
  exit(0)

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

a,b,c = get_nums_l()

if a + b - c > 0:
    print("No")
    exit()

x = (a+b-c) ** 2
y = 4 * a * b

print("Yes" if x > y else "No")