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: Runtime Error

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

Submission status: Runtime Error

Solution code:
import fractions
a = list(map(int, input().split()))
ans = a[0]
for i in a:
    ans = fractions.gcd(ans, i)

A = a[0]//ans
B = a[1]//ans
C = a[2]//ans

def bisearch(f, n):
    l = 0
    r = n
    fl = f(l)
    fr = f(r)
    while l <= r:
        m = (l + r) // 2
        fm = f(m)
        #print l,m,r,fl,fm,fr,n
        if fm == n:
            return m
        elif fm > n:
            r = m - 1
            fr = f(r)
        else:
            l = m + 1
            fl = f(l)

def try_square_root(n2):
    return bisearch(lambda n:n*n, n2)

if try_square_root(A) + try_square_root(B) == try_square_root(C):
  print("No")
elif sqrt(A) +sqrt(B) < sqrt(C):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

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)**2:
    return 'Yes'
  aaaa

# main()
print(main())

Submission status: Runtime Error

Solution code:
from decimal import *
import math
a,b,c=map(int,input().split())
r=decimal(math.sqrt(a*b))*2

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

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
def newton_root(n):
    x = n/2.
    f = lambda x: x**2 - n
    f_prime = lambda x: 2*x
    while abs(f(x)) > 1e-4:
        x -= f(x)/f_prime(x)
                        % x = (x+n/x)/2
    return x
print(newton_root(1004))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
from decimal import *
s = input().rstrip().split(' ')
a = math.sqrt(int(s[0]))
b = math.sqrt(int(s[1]))
c = math.sqrt(int(s[2]))
d = Decimal(a).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
e = Decimal(b).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
f = Decimal(c).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
if d + e < f:
	print("Yes")
elif d + c == f:
	print("No")
else:
	print("No")

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

Solution code:
import math
from decimal import *
s = input().rstrip().split(' ')
a = math.sqrt(int(s[0]))
b = math.sqrt(int(s[1]))
c = math.sqrt(int(s[2]))
d = Decimal(a).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
e = Decimal(b).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
f = Decimal(c).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
if d + e < f:
	print("Yes")
elif d + c = f:
	print("No")
else:
	print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

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

	if a >= c or b >= c:
		print("No")
		sys.exit()

	if max(len(str(a)),len(str(b)),len(str(c))) > 8:
		if math.sqrt(a) + math.sqrt(b)  > math.sqrt(c):
			print("Yes")
		else:
			print("No")
	else
		if math.sqrt(a) + math.sqrt(b)  < math.sqrt(c):
			print("Yes")
		else:
			print("No")


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Runtime Error

Solution code:
import math

a = []
for i in input().split(" "):
    a.append(int(i))

b = round(float(a[0] + a[1] - a[2],20))
c = round(math.sqrt(a[0]) * math.sqrt( a[1]),20)
if b < -2*c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import strutils, math, sequtils
import macros
macro unpack(s:seq, n:static[int]): auto =
  let t = genSym()
  result = quote do:(let `t` = `s`;())
  when NimMajor == 0 and NimMinor <= 17:
    for i in 0..<n: result[0][1].add(quote do:(`t`[`i`]))
  else:
    for i in 0..<n: result[1].add(quote do:(`t`[`i`]))

let (a, b, c) = stdin.readline.split.map(parseInt).unpack(3)

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

Submission status: Runtime Error

Solution code:
A,B,C = (int(x) for x in input().split())
import math
ab = math.sqrt(A*B)
if 2 * a * b < C - A - B:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

double func(double a) {
    double b = a;
    for(int i = 0; i < 1000; i++) {
        b = (b * b + a) / (2 * b);
    }
    return b;
}

int main(void){
    int l, i=0, g[10];
    while(cin>>l){
        g[i] = l;
        i++;
    }
  float a,b,c=0;
  
  a = func(g[0]);
  b = func(g[1]);
  c = func(g[2]);
  printf("%f,%f,%f\n",a,b,c);
  
  if(a+b < c){
    printf("Yes");
  }
    else{
    printf("No");
    }
  
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;

int main(){
	unsigned long long a, b, c;
	cin >> a >> b >> c;
	long long x = a * a + b * b + c * c + (a * b + b * c + c * a) * (-2);
	if(c - a - b < 0){
		x *= -1;
	}
	if(x > 0){
		cout << "Yes" << endl;
	}
	else{
		cout << "No" << endl;
	}
	return 0;
}

Submission status: Runtime Error

Solution code:
import math
from decimal import Decimal

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

a = Decimal(str(a))
b = Decimal(str(b))
c = Decimal(str(c))
ab = Decimal(str(math.sqrt(a * b)))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
a, b, c = map(int, input().split())
for (a % 2 == 0 and b % 2 == 0 and c % 2 == 0):
  if (a == 2 or b == 2 or c == 2):
    break
  a /= 2
  b /= 2
  c /= 2
left = a * b
right = (c - (a + b)) / 2
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
H, W = map(int, input().split())

ans = 0
if H == 1 or W == 1:
    ans = 1
elif H % 2 == 0:
    ans = (W * H) // 2
else:
    ans = (W * (H - 1)) // 2 + (W + 1) // 2

print(ans)

Submission status: Runtime Error

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

a = int(a)
b = int(b)
c = int(c)

import math

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import math

a = []
for i in input().split(" "):
    a.append(int(i))

b = round(float(a[0] + a[1] - a[2],20))
c = round(math.sqrt(a[0]) * math.sqrt( a[1]),20)
if b < c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
def input_int():
    return map(int, input().split())

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

def one_str():
    return input()

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

import fractions

import math

A, B, C = input_int()

max_num = int(math.sqrt(max(a))+1)

a=[A,B,C]
ans = A
for i in range(1, len(a)):
    ans = fractions.gcd(ans, a[i])

A //= ans
B //= ans
C //= ans

if ( A**(1/2) + B**(1/2) ) < C**(1/2):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math

a,b,c = (float(x) for x in input().split()):
if math.sqrt(a) + math.sqrt(b) - math.sqrt(c) < 1e-10:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
from math import sqrt,isclose

sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    a,b,c=map(int,input().split())
    if sqrt(a)+sqrt(b)<sqrt(c):
        if isclose(sqrt(a)+sqrt(b), sqrt(c), abs_tol=1e-06):
            print('No')
        else:
            print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import math

a, b, c = input().split()
a = math.sqrt(int(a))
b = math.sqrt(int(b))
c = math.sqrt(int(c))
d = a + b - c

if d < 0:
    if math.isclose(d, 0.0):
        print('No')
    else:
        print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
#include <math.h>
using namespace std;

int main(void){
    long long a, b, c;
    cin >> a >> b >> c;
    long long d = c - (a + b);
    long long left = 4 * a * b;
    if (left < d*d){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
    return 0;
}

Submission status: Runtime Error

Solution code:
import math

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

compare_num = math.sqrt(a) + math.sqrt(b) - math.sqr(c)

if compare_num < 0:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
aimport math

a,b,c = list(map(int,input().split()))
print(math.sqrt(1))
print('Yes' if round(math.sqrt(a),10) + round(math.sqrt(b),10) < round(math.sqrt(c),10) else 'No')

Submission status: Runtime Error

Solution code:
import math

a,b,c = (float(x) for x in input().split())
if math.isclose(math.sqrt(a) + math.sqrt(b), math.sqrt(c)):
  if math.sqrt(a) + math.sqrt(b) - math.sqrt(c) < 1e-10:
    print("Yes")
  else:
    print("No")
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math
def main(a,b,c):
    temp = math.sqrt(a) + math.sqrt(b)
    return "Yes" if math.sqrt(c) > temp else "No"

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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


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

Submission status: Runtime Error

Solution code:
import math 
  
# Recursive function that returns square root 
# of a number with precision upto 5 decimal places 
def Square(n, i, j): 
  
    mid = (i + j) / 2; 
    mul = mid * mid; 
  
    # If mid itself is the square root, 
    # return mid 
    if ((mul == n) or (abs(mul - n) < 0.00000000000001)): 
        return mid; 
  
    # If mul is less than n, recur second half 
    elif (mul < n): 
        return Square(n, mid, j); 
  
    # Else recur first half 
    else: 
        return Square(n, i, mid); 
  
# Function to find the square root of n 
def findSqrt(n): 
    i = 1; 
  
    # While the square root is not found 
    found = False; 
    while (found == False): 
  
        # If n is a perfect square 
        if (i * i == n): 
            return i; 
            found = True; 
          
        elif (i * i > n): 
  
            # Square root will lie in the 
            # interval i-1 and i 
            res = Square(n, i - 1, i); 
            return res  
            found = True
        i += 1; 



a,b,c=map(int,input().split())
j=findSqrt(a)
k=findSqrt(b)
l=findSqrt(c)
if j+k<l:
    print("Yes")
else :
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

def nroot(a, n, x=1.0, eps=1e-15):
    x = np.sqrt(a)
    while abs(a - x**n) > eps:
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x
a,b,c = map(int, input().split())


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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
s = input().rstrip().split(' ')
a = Decimal(math.sqrt(int(s[0]).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
b = Decimal(math.sqrt(int(s[1]).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
c = Decimal(math.sqrt(int(s[2]).quantize(Decimal('0.01'), rounding=ROUND_HALF_UP)
d = a + b
if d < c:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math 
  
# Recursive function that returns square root 
# of a number with precision upto 5 decimal places 
def Square(n, i, j): 
  
    mid = (i + j) / 2; 
    mul = mid * mid; 
  
    # If mid itself is the square root, 
    # return mid 
    if ((mul == n) or (abs(mul - n) < 0.0000000000000000000000000000001)): 
        return mid; 
  
    # If mul is less than n, recur second half 
    elif (mul < n): 
        return Square(n, mid, j); 
  
    # Else recur first half 
    else: 
        return Square(n, i, mid); 
  
# Function to find the square root of n 
def findSqrt(n): 
    i = 1; 
  
    # While the square root is not found 
    found = False; 
    while (found == False): 
  
        # If n is a perfect square 
        if (i * i == n): 
            return i; 
            found = True; 
          
        elif (i * i > n): 
  
            # Square root will lie in the 
            # interval i-1 and i 
            res = Square(n, i - 1, i); 
            return res  
            found = True
        i += 1; 



a,b,c=map(int,input().split())
j=findSqrt(a)
k=findSqrt(b)
l=findSqrt(c)
if j+k<l:
    print("Yes")
else :
    print("No")

Submission status: Runtime Error

Solution code:
from math import sqrt
from decimal import Decimal, getcontext


getcontext().prec = 1
getcontext().rounding
a, b, c = map(int, input().split())
if round(sqrt(a), 2) + round(sqrt(b), 2) < round(sqrt(c), 2)
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from mpmath import *

mp.dps=50
mp.pretty = True

a,b,c = (int(x) for x in input().split())
if a+b+2*(mp.sqrt(a*b)) < c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
a, b, c = map(float, input().split())
sqa = math.sqrt(a)
sqb = math.sqrt(b)
sqc = math.sqrt(c)
s = sqa + sqb
t = sqc
if s < t:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

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

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

    return arr


import math

A, B, C = input_int()

migi = math.sqrt(C)

migi -=  math.sqrt(A)
migi -=  math.sqrt(B)



if 0 < migi:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
#スペース区切りの整数の入力
A, B, C = map(int, input().split())

from math import sqrt
A_ = math.sqrt(A)
B_ = math.sqrt(B)
C_ = math.sqrt(C)

if(A_+B_<C_):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import numpy
i = input().split()
f1 = numpy.sqrt(int(i[0])) + numpt.sqrt(int(i[1]))
f2 = numpy.sqrt(int(i[2]))
if f1 < f2:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np

Data = list(map(int,input().split()))
a= Data [0]*100
b=Data[1]*100
c= Data[2]*100
ab=np.sqrt(a*b)
left = np.sqrt(a)+np.sqrt(b)
right = np.sqrt(c)

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

Submission status: Runtime Error

Solution code:
import math

a,b,c= map(int, input().split())
a1 =double(math.sqrt(a))
b1 =double(math.sqrt(b))
c1 =double(math.sqrt(c))

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

Submission status: Runtime Error

Solution code:
inport math

num = [int(i) for i in input().split(' ')]

AB = math.sqrt(num[0]) + math.sqrt(num[1])
C = math.sqrt(num[2])

if AB < C:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	aa,bb,cc = inputMap()

	#a = Decimal(aa)
	#b = Decimal(bb)
	#c = Decimal(cc)

	#print(math.sqrt(a))

	if fl(math.sqrt(a)) + fl(math.sqrt(b))  < fl(math.sqrt(c)):
	#if math.isclose(math.sqrt(a) + math.sqrt(b), math.sqrt(c), abs_tol=1e-10):
		print("Yes")
	else:
		print("No")


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def fl(x):
    digits = 5
    form = '%.'+str(digits-1)+'e'
    return float((form % x))
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Runtime Error

Solution code:
import numpy
def main():
    a, b, c = map(int, input().split())
    k = numpy.sqrt(a/c)
    l = numpy.sqrt(b/c)
    if 1 > k + l:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import Decimal
numbers = list(map(int, input().split()))
if(Decimal(numbers[0]).sqrt() + Decimal(numbers[1]).sqrt() < Decimal(numbers[2]).sqrt()):
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
import math

a,b,c= map(int, input().split())
a1 =double(math.sqrt(a))
b1 =double(math.sqrt(b))
c1 =double(math.sqrt(c))
print(a1)

if a1+ b1 ,c1:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a, b, c = list(map(int, input().split(' ')))
a_m = a%10**9
b_m = b%10**9
c_m = c%10**9
sub = (c_m - a_m - b_m)&mod10**9

if 4*a_m*b_m < sub*sub:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import math
i = input().split()
f1 = float(math.sqrt(int(i[0])) + math.sqrt(int(i[1]))
f2 = math.sqrt(int(i[2]))
if f1 < f2:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from decimal import *
num1, num2, num3 = map(int, input().split())
num1 = Decimal(num1)
num2 = Decimal(num2)
num3 = Decimal(num3)
if (num.sqrt() + num2.sqrt() < num3.sqrt()):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import math
a, b, c = raw_input().split()
a = int(a)
b = int(b)
c = int(c)
print('Yes' if math.sqrt(a) + math.sqrt(b) < math.sqrt(c) else 'No')

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
print(a, b, c)
x = a * a + b * b + c * c - 2 * a * c - 2 * b * c - 2 * a * b
if x > 0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

N = c- a - b

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
    long double a, b, c;
    cin >> a >> b >> c;
    if (sqrt(a) + sqrt(b) < sqrt(c))
        cout << "Yes";
    else
        cout << "No";
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

Solution code:
import decimal 



def resolve():
    a,b,c = [decimal.Decimal(i) for i in input().split()]

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

if __name__ == "__main__":
    unittest.main()

Submission status: Runtime Error

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