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:
import math
from decimal import *

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

a = Decimal(a)
b = Decimal(b)
c = Decimal(c)

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

Submission status: Runtime Error

Solution code:
from sympy import *
print("Yes")

Submission status: Runtime Error

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

foo = int(math.sqrt(a*b))


if foo**2 < a*b:
    bar = 1
else:
    bar = -1
if a*b > 10**10:
    while True:
        foo += bar
        if foo**2 > ab*bar:
            break

if foo**2 < a*b:
    foo += 0.1
elif foo**2 > a*b:
    foo -= 0.1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if a > 10**6 or b> 10**6 or c> 10**6:
    assert False ,"aa"

import numpy as np
sqa=np.sqrt(a)
sqb=np.sqrt(b)
sqc=np.sqrt(c)




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

Submission status: Runtime Error

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

if a > 10**5 or b> 10**5 or c> 10**5:
    assert False ,"aa"

import numpy as np
sqa=np.sqrt(a)
sqb=np.sqrt(b)
sqc=np.sqrt(c)




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

Submission status: Runtime Error

Solution code:
def mysqrt(x):
    g = 1.0
    while True:
        if abs(g**2 - x) < 0.000000000001:
            return g
        g = (g+x/g)/2 
print('Yes' if mysqrt(a) + mysqrt(b) < mysqrt(c) else 'No')

Submission status: Runtime Error

Solution code:
if len(abc) == 3:
    if type(abc[0]) is int and type(abc[1]) is int and type(abc[2]) is int:
        if abc[0] <= 10**9 and abc[1] <= 10**9 and abc[2] <= 10**9 and \
        1 <= abc[0] and 1 <= abc[1] and 1 <= abc[2]:
          chick = math.sqrt(abc[0]) + math.sqrt(abc[1])
          if chick < math.sqrt(abc[2]):
            print('Yes')
          else:
            print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
// pana1-3
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;

int main(){

    ll a, b, c;
    cin >> a >> b >> c;
    string ans = "No";
    if(a + b >= c){
        cout << "No" << endl;
        return 0;
    }
    ll d = c - a - b;
    if(4 * a * b < d * d)ans = "Yes";
    cout << ans << endl;

    return 0;
}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <string>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <math.h>
#include <algorithm>
#include <numeric>

using namespace std;

// マクロ&定数 ============================================================
typedef unsigned int uint;
typedef long long ll;
//typedef pair<int, int> P;

typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<bool> vbool;
typedef vector<string> vstring;
typedef vector<char> vchar;

typedef vector<pair<int, int>> vpint;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<double, double>> vpdouble;

typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<vector<double>> vvdouble;
typedef vector<vector<bool>> vvbool;

typedef vector<vector<string>> vvstring;

const int c_YET = -1;
const int INF = 1e9 + 1;
const ll LLINF = 1e17 + 1;
const int DX[9] = { 0,0,1,-1, 1, 1, -1, -1, 0 }; // 4;４近傍
const int DY[9] = { 1,-1,0,0, 1, -1, 1, -1, 0 }; // 8:８近傍 9:(0,0)を含む
const ll MOD = 1e9 + 7; //10^9 + 7
const ll MAX = 1e9;
const double PI = 3.14159265358979323846264338327950288;
//========================================================================



int main() {

	//==================================
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(30);
	//==================================


	double A, B, C;
	cin >> A >> B >> C;

	double e = 0.000000000000000001;

	if (C >= 4 * sqrt(A * B))
	{
		cout << "Yes";
		return 0;
	}

	if (C <= A)
	{
		cout << "No";
		return 0;
	}

	if (sqrt(B * C) + sqrt(A * B) < C - A - e)
	{
		cout << "Yes";
		return 0;
	}
	else
	{
		cout << "No";
	}


}

Submission status: Runtime Error

Solution code:
from math import isclose

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

if isclose(((c-a-b) ** 2) - 4 * a * b, 0, abs_tol=1e-10):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

Solution code:
def main():
    import math
    import decimal
    a,b,c = map(int,input().split())
    a = a*10**20
    b = b*10**20
    c = c*10**20
    cr = math.sqrt(c)
    ar = math.sqrt(a)
    br = math.sqrt(b)
    if ar**2 != a:
        ar = decimal.Decimal(round(ar,15))
    if br**2 != b:
        br = decimal.Decimal(round(br,15))
    if cr**2 != c:
        cr = decimal.Decimal(round(cr,15))
        
    if cr - (ar+br) > 0 :
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
 
//#include <vector>
#define ALL(l)  (l).begin(),(l).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
ll mod =  1000000007;
ll maxn = 1000000000;
 
//---------------------------------------------------------------------------------------------------
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vll = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vs = vector<string>; // stringの1次元の型に vs という別名をつける
using pii = pair<int, int>; // これ以降 pii という型名はpair<int, int> と同じ意味で使える
//---------------------------------------------------------------------------------------------------
 
int main(){
  unsigned long long a,b,c;
  cin>>a>>b>>c;
  if(4*a*b<(c-(a+b))*(c-(a+b)))cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <bits/stdc++.h>
#include<queue>
#include <numeric>
using namespace std;
 
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
 
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
 template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define fore(i,a) for(auto &i:a)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
 
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
 
//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
 



int main(){
    long long a,b,c;
    cin >> a >> b >> c;
    long double sum=(long double)sqrt(a)+sqrt(b)-sqrt(c);
    if(sum<0){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}

Submission status: Runtime Error

Solution code:
import bisect,collections,itertools,math,numpy,string,sympy
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
##################################################
def main(a,b,c):
    if sympy.sqrt(a)+sympy.sqrt(b) < sympy.sqrt(c):
        return 'Yes'
    else:
        return 'No'
    
a,b,c = LI()
print(main(a,b,c))

Submission status: Runtime Error

Solution code:
import math
from decimal import Decimal
a, b, c = map(int, input().split())
a = Decimal(str(math.sqrt(a))).as_integer_ratio()
b = Decimal(str(math.sqrt(b))).as_integer_ratio()
c = Decimal(str(math.sqrt(c))).as_integer_ratio()
left = c[1]*(a[0]*b[1] + a[1]*b[0])
right = c[0]*a[1]*b[1]
if left < right:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

if(r>0):
  print("Yes")
elif(r=0):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

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

if math.isclose(A + B, C):
    A = float(math.sqrt(a), "1000000f")
    B = float(math.sqrt(b), "1000000f")
    C = float(math.sqrt(c), "1000000f")
    if A + B < C:
        print("Yes")
    else:
        print("No")
else:
    if A + B < C:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>

#define MOD (1000000007)

using namespace std;

typedef long long int Int;

constexpr Int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n-1); }

int main(void) {
    Int a,b,c;
    cin>>a>>b>>c;
    unsigned long long int abc = abs(c-a-b);
    unsigned long long int A = a,B = b;

    if(4*a*b < abc*abc) {
        cout<<"Yes"<<endl;
    } else {
        cout<<"No"<<endl;
    }

    return 0;
}

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;
#define N 100100
#define SIGMA 26

const string answer[2] = {"No\n", "Yes\n"};

long long a, b, c, x, y, z;
int main()
{
    cin >> a >> b >> c;
    if (c - b - a < 0){
        cout << answer[0];
        return 0;
    }
    if (4 * a * b < (c - b - a) * (c - b - a))
        cout << answer[1];
    else
        cout << answer[0];
    return 0;
}

Submission status: Runtime Error

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
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(math.sqrt(a*b),10)*2+a+b-c
if x < 0 or math.isclose(x,0):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

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

if(temp1 > temp):
	print("Yes")
else :
	print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

firstInputText = input()
inputList = firstInputText.split()
a = int(inputList[0])
b = int(inputList[1])
c = int(inputList[2])
x = math.sqrt(a) + math.sqrt(b)
y = math.sqrt(c)
# print(x)
# print(y)

if math.isclose(x,y):
    print("Yes")
else:
    print("No")

# if x < y:
#     print("Yes")
# else:
#     print("No")

Submission status: Runtime Error

Solution code:
import math
a,b,c = [int(i) for i in input().split()]
if math.fsum(a**0.5 + b**0.5) < c**0.5:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math

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

left = a + b
right = c

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

left = left + 2*a*b


ans = ""

if(left< right):
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Runtime Error

Solution code:
import bisect,collections,itertools,math,numpy,string,sympy
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
##################################################
def main(a,b,c):
    if sympy.sqrt(a)+sympy.sqrt(b)-sympy.sqrt(c) < 0:
        return 'Yes'
    else:
        return 'No'
    
a,b,c = LI()
print(main(a,b,c))

Submission status: Runtime Error

Solution code:
import math
a,b,c = map(int, input().split())
mod=10**9
q=(int(math.sqrt(a)*mod)+int(math.sqrt(b)*mod))//mod
w=math.sqrt(c)

if q<w
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
# coding: utf-8
# 自分の得意な言語で
# Let's チャレンジ！！
import math
input_line = input()
n = input_line.split()
if(int(n[0])+int(n[1])>int(n[2])):
  print('No')
else:
    if((n[0]+n[1]+2*math.sqrt(float(n[0])*float(n[1])))<float(n[2])):
  	  print('Yes')
    else:
      print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import bisect,collections,itertools,math,numpy,string,sympy
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
##################################################
def main(a,b,c):
    if float(sympy.sqrt(a))+float(sympy.sqrt(b))-float(sympy.sqrt(c)) < 0:
        return 'Yes'
    else:
        return 'No'
    
a,b,c = LI()
print(main(a,b,c))

Submission status: Runtime Error

Solution code:
# coding: utf-8
# 自分の得意な言語で
# Let's チャレンジ！！
import math
input_line = input()
n = input_line.split()
if(int(n[0])+int(n[1])>int(n[2])):
  print('No')
else:
    if((n[0]+n[1]+2*math.sqrt(float(n[0])*float(n[1]))<float(n[2])):
  	  print('Yes')
    else:
      print('No')

Submission status: Runtime Error

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

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

A = (c - (a + b))
Ap = A**2
B = 4 * a * b

if 0 <= A:
    if Ap < B:
        ans = 'No'

    else:
        ans = 'Yes'

elif Ap <= B:
    ans = 'No'


elif Ap < B:
    ans = 'Yes'


print(ans)

Submission status: Runtime Error

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

# num = H * W


if H == 0 or W == 0:
    print(int(0))

elif H == 1 or W == 1:
    print(int(1))

elif H % 2 == 0 and W % 2 == 0:
    print(int(H/2 * W))

elif H % 2 == 0:
    print(int(H/2 * W))

elif W % 2 == 0:
    print(int(W/2) * H)

elif H % 2 != 0 and W % 2 != 0:
    key = W // 2
    ans = H * key
    print(int(ans + (H-H//2)))
    # else:
    #     num = H // 2
    #     ans = num * W
    #     print(int(ans + (H-(num))))

Submission status: Runtime Error

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

import math
if math.log((c-a-b)/2) - math.log(a*b)/2 > 0:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import sys
import sqrt from numpy

args = sys.stdin.readline().split()
a = int(args[0])
b = int(args[1])
c = int(args[2])

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

Submission status: Runtime Error

Solution code:
import numpy
li = list(map(float,input().split()))
a = li[0]
b = li[1]
c = li[2]
a = numpy.sqrt(a)
b = numpy.sqrt(b)
c = numpy.squt(c)
if a + b < c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
from decimal import *
from math import *

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

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

Submission status: Runtime Error

Solution code:
if (inp[0]<8000000000):
    if (inp[0]+inp[1]-inp[2] < -2 * (inp[0]*inp[1])**0.5):
        print("Yes")
    else:
        print("No")
else:
    if(inp[0]**2+inp[1]**2+inp[2]**2-2*(inp[0]*inp[1]+inp[1]*inp[2]+inp[0]*inp[1])<0):
        print("No")
    else:
        print("Yes")

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

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

Submission status: Runtime Error

Solution code:
import math

x = int(input().strip())
y = int(input().strip())
z = int(input().strip())
a = math.sqrt(x)
b = math.sqrt(y)
c = math.sqrt(z)
if(a+b<c):
  print("yes")
else:
  print("None")

Submission status: Runtime Error

Solution code:
from decimal import *

getcontext().prec = 1000000000
a,b,c =map(int,input().split())
d=math.sqrt(a)
e=math.sqrt(b)
f=math.sqrt(c)
h= d+e
if h<f:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
import math

a = math.sqrt(input().strip())
b = math.sqrt(input().strip())
c = math.sqrt(input().strip())
if(a+b<c):
  print("yes")
else:
  print("None")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

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

Submission status: Runtime Error

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())


    if c - a - b < 0:
        if left < right:
            print("No")
        else:
            print("Yes")
        exit()
 

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


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c = input().split()
 
import math
 
a = int(a)
b = int(b)
c = int(c)
 
if math.isclose(math.sqrt(c) - math.sqrt(b) - math.sqrt(a), 0, abs_tol=1e-10):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import math

import numpy as np

input_line = input()
Line = input_line.split()
Line = [long(s) for s in Line]
 
if np.sqrt(Line[0]) + np.sqrt(Line[1]) < np.sqrt(Line[2]):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
div=2
ac=1
bc=1
cc=1
for i in range(2,10**4):
    if a%(i**2)==0:
        a=a//(i**2)
    ac*=i

for i in range(2,10**4):
    if b%(i**2)==0:
        b=b//(i**2)
    bc*=i

for i in range(2,10**4):
    if c%(i**2)==0:
        c=c//(i**2)
    cc*=i

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import math
a, b, c = map(int, input().split())
flag = 0
if a**(1 / 2) + b**(1 / 2) < c**(1 / 2):
    flag = 1
elif a**(1 / 2) + b**(1 / 2) > c**(1 / 2)
    flag = 0
else:
    flag = 1
    

if flag == 1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math

a = math.sqrt(input())
b = math.sqrt(input())
c = math.sqrt(input())
if(a+b<c):
  print("yes")
else:
  print("None")

Submission status: Runtime Error

Solution code:
H,W =map(int,input().split())
if H==1 or W==1:
  print(1)
elif H%2==0:
      print(W*H//2)
else:
  if W%2==1:
    print(W*(H//2)+W//2+1)
  else:
    print(W*(H//2)+W//2)

Submission status: Runtime Error

Solution code:
import sqrt from numpy

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

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
from sympy import sqrt

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

a, b, c = map(int, input().split())
a = math.sqrt(a)
b = math.sqrt(b)
c = math.sqrt(c)
tmp = (c**2 - (a + b)**2)/(c + (a + b)) + 1.0

if  tmp > 1:
    print('Yes')
elif math.isclose(tmp, 1):
    print('No')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import sympy

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

r_ab=sympy.sqrt(a*b)

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

Submission status: Runtime Error

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

import math
 
a = int(a)
b = int(b)
c = int(c)
 
if math.isclose(math.sqrt(c) - math.sqrt(b) - math.sqrt(a), 0, abs_tol=1e-10):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
#n = int(input())
a,b,c = map(float,input().split())
#a_L = list(map(int,input().split()))
import numpy as np
import math
 
a = np.array([a])
b = np.array([b])
c = np.array([c])

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

Submission status: Runtime Error

Solution code:
import cmath
a=input().split(' ')
a=[int(x) for x in a]
if cmath.sqrt(a[0])+cmath.sqrt(a[1])<cmath.sqrt(a[2]):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a,b,c = list(map(int,input().split()))
from decimal import Decimal
a,b,c = list(map(Decimal,[a,b,c]))

ret = "No"
if a**0.5+b**0.5<c**0.5:
    ret="Yes"
print(ret)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
    /*
    double a, b, c;
    cin >> a >> b >> c;

    a = sqrt(a);
    b = sqrt(b);
    c = sqrt(c);

    cout << (a + b < c ? "Yes" : "No") << endl;
    */

    long long a, b, c;
    cin >> a >> b >> c;
    int m = max(a, b);
    int n = min(a, b);
    double e = (double)m;
    double f = (double)n;
    double g = (double)c;
    //long long d = (long long)(sqrt((double)c) * (sqrt((double)m) - sqrt((double)n)));
    double d = sqrt(g) * (sqrt(e) - sqrt(f)) - 1.0;
    cout << (((e - f) < d) ? "Yes" : "No") << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
import numpy
ry = input().split(" ");
a = int(ary[0])
b = int(ary[1])
c = int(ary[2])
left = numpy.sqrt(a * b * 4)
right = (c - b - a)
if left < right:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math

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

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

if math.isclose(math.sqrt(c) - math.sqrt(b) - math.sqrt(a), 0, abs_tol=1e-10):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import math

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

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