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:
# from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
# import heapq
# import math
# from collections import defaultdict, Counter, deque
# from bisect import *
# import itertools
# import fractions
# # import sys
# sys.setrecursionlimit(10 ** 7)
# MOD = 10 ** 9 + 7
# input = sys.stdin.readline


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


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

#     # divisors.sort()
#     return divisors


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


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

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

#     return True


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

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


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


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


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

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

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

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

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

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

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

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

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

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


class manacher:

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

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

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


def main():
    a, b, c = map(int, input().split())
    ab = (a ** 0.5 + b ** 0.5)
    cc= c

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

while a % 100 == 0 and b % 100 == 0 and c % 100 == 0:
    a//= 100
    b//= 100
    c//= 100

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

Submission status: Wrong Answer

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

if (pow(a,0.5)+pow(b,0.5)) < pow(c,0.5):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = list(map(float, input().split()))
ra = a ** 0.5
rb = b ** 0.5
rc = c ** 0.5
print("Yes") if a-b > rc*(ra-rb) else print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
#import numpy as np
from decimal import *
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())

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

if c - ((a+b)+2*math.floor((math.sqrt(a*b))) > Decimal(0)) :
  print ("Yes")
else :
  print ("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
a, b, c = map(float, input().split())

out1 = c-a-b
out2 = int(np.sqrt(4*a*b)+0.5)
#a = float(np.sqrt(a)**2)
#b = float(np.sqrt(b)**2)
#c = float(np.sqrt(c)**2)

#print(a,b,c)
#print((a+b)-float(a+b))

if out1<out2:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
import math

def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m
    
    return f(int(math.sqrt(n) * (1 + 1e-10)))

a, b, c = map(int, input().split())
sqa = int_sqrt2(a)
sqb = int_sqrt2(b)
sqc = int_sqrt2(c)

if sqa + sqb < sqc:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
from math import sqrt
a, b, c = map(int, input().split())
left = a + b + 2 * round(sqrt(a) * sqrt(b), 20)

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

Submission status: Wrong Answer

Solution code:
import numpy as np
a,b,c = list(map(int,input().split(' ')))
     
a = np.array([a],dtype='f16')
b = np.array([b],dtype='f16')
c = np.array([c],dtype='f16')

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import time
from decimal import *
s = time.time()

def int_sqrt(n):
    s = time.time()
    tmp = n**(1/2)
    if tmp**2 > n:
        tmpmax = Decimal(tmp)
        tmpmin = Decimal(tmp-0.000001)
    else:
        tmpmin = Decimal(tmp)
        tmpmax = Decimal(tmp+0.000001)
    while tmpmin < tmpmax:
        tmp = (tmpmin + tmpmax) / 2
        if tmp**2 > n:
            tmpmax = tmp
        else:
            tmpmin = tmp

        if time.time() - s > 0.6:
            break
    return (tmpmax + tmpmin) / 2

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if (int(a)**(1/2) + int(b)**(1/2)) <= (int(c)**(1/2)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

d = float(math.sqrt(a))
e = float(math.sqrt(b))
f = float(math.sqrt(c))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
ABC = list(map(int, input().split()))

tmp = ABC[0] + ABC[1]
if (4 * tmp < (ABC[2] - tmp) ** 2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
a,b,c = map(int,input().split())
print("NYoe s"[math.sqrt(a)+math.sqrt(b)<math.sqrt(c):6:2])

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(A+B,C)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
a, b, c = map(int, input().split())
 
A = (c - (a + b))**2
B = 4 * a * b
C = a + b
 
if C < c:
    if A <= B:
        ans = 'No'
    else:
        ans = 'Yes'
 
elif A<B:
    ans = 'No'
 
elif B<A:
    ans = 'Yes'
 
else:
    ans = 'Yes'
 
 
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
eps = 1e-6

def nroot(a, n, x=1.0, eps=1e-6):
    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 + eps < sc:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from math import sqrt

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

tmp = 2 * (sqrt(a * b))
print("Yes" if a + b + tmp < c and a + b - tmp < c else "No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
# import math
# sqrt = math.sqrt

# def int_sqrt2(n):
#     def f(prev):
#         while True:
#             m = (prev + n / prev) / 2
#             if m >= prev:
#                 return prev
#             prev = m
    
#     return f(int(sqrt(n) * (1 + 1e-20)))

# from decimal import *

# getcontext().prec = 20      # デフォルト28桁のところを20桁にする
# m = int(Decimal(n).sqrt())
# print m ** 2 - n            # -2222221948

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

def gcd(n,m):
    while m:
        n,m = m, n%m
    return n

def lcm(n,m):
    return n*m//gcd(n,m)


def main():
    # N = int(input())
    A,B,C = linput()
    # vA = linput()
    # S = input()
    # mX = [linput() for _ in [0,]*N]

    # res = 0
    # res = -(-N//M)

    # LH = A**.5 + B**.5
    # RH = C**.5

    # rtAB = int(Decimal(A*B).sqrt())
    # rtAB = int_sqrt2(A*B)

    LH = A * B * 4
    RH = (C-A-B)**2

    # LH = A * B * 4
    # RH = abs(C-A-B)
    print(LH,RH, file=sys.stderr)

    res = ("No","Yes")[LH < RH if C-A-B>=0 else LH > -RH]

    print(res)

main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline
 
    a,b,c = map(int,input().split())
 
    s = 2 * ((a*b)** (1/2))
    if a + b + s - c < 1e-30:
        print("Yes")
    else:
        print("No")
 
 
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

  if 4*a*b<(c-a-b)*(c-a-b):
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

d=0
d+=a**2
d-=2*a*b
d+= b**2
d-= 2*b*c
d+= c**2
d-=2*c*a

if d>0.0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
 
input_line = input()
Line = input_line.split()
Line = [float(s) for s in Line]
 
if Line[1]**0.5 + Line[0]**0.5 < Line[2]**0.5:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
 
x,y,z = input().split()
 
x = int(x)
y = int(y)
z = int(z)
 
if x * y < (z - (x + y)) / 2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split(" ")))

import math
a, b, c = list(map(math.sqrt, n))

if a + b < c:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import math
a,b,c = map(int,input().split())
# a + b + 2r(ab) < c
# a + b - c < -2r(ab)
# (a + b - c)**2 < 4ab
if (a + b -c)**2 > 4*a*b:
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-
import math
from decimal import *
getcontext().prec = 28  # 28桁はほとんどの問題解決に十分な大きさ


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

    # 相加相乗平均より、
    if a==b:
        if 2*(a+b) < c:
            print("Yes")
            return
        print("No")
        return

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

    # if 16*a*b > c**2:
    #     print("No")
    #     return

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

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


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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


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


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

#     # divisors.sort()
#     return divisors


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


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

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

#     return True


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

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


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


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


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

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

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

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

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

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

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

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

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

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


class manacher:

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

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

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


def main():
    a, b, c = map(int, input().split())
    ab = (a ** 0.5 + b ** 0.5)
    cc= c

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
a,b,c=map(int, input().split())
def nroot(a_, n, x=1.0, eps=1e-10):
    while abs(a_ - x**n) > eps:
        x = ( (n-1)*x + a_/(x**(n-1)) ) / n
    return x

#if round(math.sqrt(a) + math.sqrt(b),10) < round(math.sqrt(c),10):
if math.sqrt(a) + math.sqrt(b) -math.sqrt(c) < 1e-1000000:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
from bisect import *
from collections import *
from heapq import *
INF = 500000
mod = 10**9+7

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

Submission status: Wrong Answer

Solution code:

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

l = 4 * a * b
r = (c - (a + b))**2

ll = a**2 + b**2 + c**2 - (a*c + b*c + a*b)*2

if ll > 0:
    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:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint,random
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b,c = inpl()
x = round(4 * a * b)
y = round(a**2 + b**2 + c**2 - (a*c-a*b+b*c)*2)
if x-y < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
base = input().split()
a = 1000000000*int(base[0])
b = 1000000000*int(base[1])
c = 1000000000*int(base[2])
import math
key = math.sqrt(a*b)
anskey = key*2
ans = a+b+anskey
if ans<c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

a,b,c=map(int,input().split())
r_ab=Decimal(str(((a*b)**0.5)*2))
r_bc=Decimal(str(((c*b)**0.5)*2))
r_ca=Decimal(str(((a*c)**0.5)*2))

if a+b-c-r_ab<0 or a-c-b+r_bc<0 or b-a-c+r_ca<0:
    print("Yes")
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import decimal

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

Submission status: Wrong Answer

Solution code:
#h,w = list(map(int, input().split()))
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
from decimal import *

getcontext().prec = 50
 
a, b, c = map(int, input().split())
 
ab_root = Decimal(2 * math.sqrt(a * b))
num = Decimal(c - a - b)

#print(ab_root, num)
 
if ab_root < num:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(float,input().split())
from math import sqrt
def fl(x):
    digits = 9
    form = '%.'+str(digits-1)+'e'
    return float((form % x))
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m
    
    return f(int(sqrt(n) * (1 + 1e-10)))
if int_sqrt2(float(fl(a)*fl(b)))<float(fl(fl(c-a)-b))/float(2):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
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:
in_list = list(map(float,input().split()))
a = in_list[0]
b = in_list[1]
c = in_list[2]
if ((a*(a - 2*b) + b*(b - 2*c) + c*(c- 2*a))) > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
 
A,B,C = input().split()
 
A_r = math.sqrt(int(A))
B_r = math.sqrt(int(B))
C_r = math.sqrt(int(C))
 
if A_r + B_r < C_r:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

print('Yes' if a+b+int(2*((a+b)**0.5))<=c else 'No')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
import math
from decimal import *

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

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

Submission status: Wrong Answer

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

if (int(a)**(1/2) + int(b)**(1/2)) < (int(c)**(1/2)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from decimal import Decimal, getcontext

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

getcontext().prec = 2000

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

Submission status: Wrong Answer

Solution code:
import numpy as np
sqrt = np.sqrt

a, b, c = map(int, input().split())
eps = 10 ** 18

if sqrt(a) + sqrt(b) - sqrt(c) < eps:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


import math


def main():
    a, b, c = map(int, input().split())
    # ans = math.sqrt(a) + math.sqrt(b) < math.sqrt(c)
    # ans = (c - a - b) > 2 * math.sqrt(a * b)
    ans = (c - a - b) / 4 * (c - a - b) > a * b
    print("Yes" if ans else "No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
a,b,c=map(int, input().split())
def nroot(a_, n, x=1.0, eps=1e-10):
    while abs(a_ - x**n) > eps:
        x = ( (n-1)*x + a_/(x**(n-1)) ) / n
    return x

#if round(math.sqrt(a) + math.sqrt(b),10) < round(math.sqrt(c),10):
if math.sqrt(a) + math.sqrt(b) -math.sqrt(c) < 1e-10000:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def main():
    a, b, c = map(float, input().split())
    hidari = a*(a-2*b) + b*(b-2*c) + c*(c-2*a)
    if 0 < hidari:
        print("Yes")
    else:
        print("No")
    return 0


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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