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:
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 + 2*((a*b)**0.5):
        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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = []
for i in input().split(" "):
    a.append(int(i))
b = a[0] + a[1] - a[2]
c = a[0]*a[1]*4

if b >= 0:
    print("No")
else:
    if b**2 < c:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
import math

a, b, c = (int(x) for x in input().split())

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 1000000000000
a, b, c = map(int, input().split())
ab = a * b
rab = Decimal(math.sqrt(ab))
rab1 = math.floor(rab)

#print(rab)

ans = a + b - c

if ans > 0:
    print('No')
elif ans < 0:
    ans1 = abs(ans)
    if ans1 <= rab1:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

a, b, c = map(int, read().split())
if a + b - c >= 0:

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

Submission status: Wrong Answer

Solution code:
import math

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

#left = a + b + 2 * math.sqrt(a*b)
#right = c
left = 4 * a * b
right = (c-a)*(c-a) + b*b - 2*b*(c-a)

if (left < right):
    print ('Yes')
else:
    print ('No')

Submission status: Wrong Answer

Solution code:
import math

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

ra = math.sqrt(a / c)
rb = math.sqrt(b / c)

sahen = math.fsum([ra, rb])

if sahen < 1:
    print("Yes")
elif sahen >= 0:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a = math.sqrt(a)
b = math.sqrt(b)
c = math.sqrt(c)

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

Submission status: Wrong Answer

Solution code:

a, b ,c=map(int,input().split())
#4ab<(c-a-b)^2
e = 4*a*b
e2 = (c-a-b)**2
if e< e2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
a, b, c = round(a**0.5, 5), round(b**0.5, 5), round(c**0.5, 5)

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

Submission status: Wrong Answer

Solution code:
def nroot(a, n, x=1.0, eps=1e-10000000000):
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x

a,b,c =map(int,input().split())
d=nroot(a,2)
e=nroot(b,2)
f=nroot(c,2)

if d+e<f:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

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



if c - (a+b+sqrt(4*a*b))>1e-1000:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import sqrt

def C(a: int, b: int, c: int) -> str:
	if a + b >= c:
		return "Yes"
	else:
		return "Yes" if a + b < c - 2 * sqrt(a * b) else "No"

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
import sys
eps = sys.float_info.epsilon
# map(int,input().split())
a,b,c = map(int,input().split())
if (4*a*b - (c-a-b)*(c-a-b) < -1*eps):
  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())
    print(c**0.5,a**0.5,b**0.5)
    if math.sqrt(c)-math.sqrt(a)>=math.sqrt(b):
        print("Yes")
    else:
        print("No")
    return

if __name__=='__main__':
    main()

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 numpy as np

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
ABC=input().split()
 
a=int(ABC[0])
b=int(ABC[1])
c=int(ABC[2])
 
if a*a+b*b+c*c-2*a*b-2*a*c-2*b*c>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('No')
elif a**0.5+b**0.5<c**0.5:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from decimal import *
a, b, c = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
import math

a, b, c = [int(x) for x in input().split()]
A = math.sqrt(a)
B = math.sqrt(b)
C = math.sqrt(c)

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a * b < ((c - (a + b)) / 2)**2:
    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())
# print(a ** 0.5, b ** 0.5, c ** 0.5)
digit = 50
right = (c - a - b) * (10 ** digit)
ab = a * b * (10 ** (digit * 2))
sqrt_ab = 0
ans = False
for i in range(10 ** 5):
    # print(i, i * i * (10 ** (digit * 2)), ab, (i - 1) * (10 ** digit))
    if i * i * (10 ** (digit * 2)) > ab:
        sqrt_ab += (i - 1) * (10 ** digit)
        break
# print(sqrt_ab)
for i in range(1, digit):
    # if int(sqrt_ab + 1) * 2 < right:
    #     ans = True
    #     break
    for j in range(1, 10):
        # print(i, j, sqrt_ab + j * (10 ** (digit - i)), )
        if (sqrt_ab + j * (10 ** (digit - i))) ** 2 > ab:
            sqrt_ab += (j - 1) * (10 ** (digit - i))
            break
        elif j == 9:
            sqrt_ab += j * (10 ** (digit - i))
            break
if 2 * sqrt_ab < right:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

rab = math.sqrt(a*b)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

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

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


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

Submission status: Wrong Answer

Solution code:
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 = list(map(int,input().split()))

import math

def fl(x):
    digits = 10
    form = '%.'+str(digits-1)+'e'
    return float((form % x))

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

Submission status: Wrong Answer

Solution code:
import math

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

sa = a ** 0.5
sb = b ** 0.5
sc = c ** 0.5


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

Submission status: Wrong Answer

Solution code:
import math

def nroot(a, n, x=1.0, eps=1e-4):
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x


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

sa = nroot(a, 2)
sb = nroot(b, 2)
sc = nroot(c, 2)

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 1000000000000
a, b, c = map(int, input().split())
ab = a * b
rab = Decimal(math.sqrt(ab))
rab1 = math.floor(rab)

print(rab)

ans = a + b - c

if ans > 0:
    print('No')
elif ans < 0:
    ans1 = abs(ans)
    if ans1 <= rab1:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,input().split())
x = math.sqrt(a)
y = math.sqrt(b)
z = math.sqrt(c)
if x+y<z:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import math

a,b,c= map(int, input().split())
print(a**2)
a1=math.sqrt(a)
b1=math.sqrt(b)
#c1=math.sqrt(c)
#a2=format(a1,'.10f')
#b2=format(b1,'.10f')
#c2=format(c1,'.10f')

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

Submission status: Wrong Answer

Solution code:
in_list = list(map(float,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
if (4*a*b) < (c*c - 2*c*a - 2*c*b + a*a + 2*a*b + b*b):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

def sqrt(a, x=1.0, eps=1e-10):
  while abs(a - x ** 2) > eps:
    x = (x + a / x) / 2
  return x

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

Submission status: Wrong Answer

Solution code:

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
a,b,c=map(int,input().split())
a1=math.sqrt(a)
b1=math.sqrt(b)
c1=math.sqrt(c)
d=math.sqrt(a*b)

if (a+b+2*d)<c:
    print("Yes")

else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

import math

# 標準入力 <int><int>
a, b, c = map(int, input().split())

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

AB = (A+B)**2

ans = "No"

if AB < C ** 2:
    ans = "Yes"

print(ans)

Submission status: Wrong Answer

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

if c>=a+b:
    if int(int(c-a-b)*(c-a-b))>int(4*int(a)*int(b)):
        print('Yes')
    else:
        print('No')
else:
    if int(int(a+b-c)*int(a+b-c))>int(4*int(a)*int(b)):
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

ra = np.sqrt(a)
rb = np.sqrt(b)
rc = np.sqrt(c)

rarb = ra + rb

if rarb < rc:
    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) < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if a+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: Wrong Answer

Solution code:
import math
import decimal

decimal.getcontext().prec = 112

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

if decimal.Decimal(math.sqrt(a)) + decimal.Decimal(math.sqrt(b)) < decimal.Decimal(math.sqrt(c)):
    ans = 'Yes'
else:
    ans = 'No'

'''
print(decimal.Decimal(math.sqrt(a)))
print(math.sqrt(b))
print(math.sqrt(c))
print(math.sqrt(a) + math.sqrt(b))
'''
'''
left_cal = a + b + 2 * math.sqrt(a * b)

if left_cal < c:
    ans = 'Yes'
else:
    ans = 'No'
'''
print(ans)