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
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:
[a,b,c]=[int(inp) for inp in input().split()]
#if a*a+b*b+c*c -2*(a*b+b*c+c*a) > 0:
if a(a-2*b)+b*(b-2*c)+c*(c-2*a)> 0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
from math import sqrt, isclose

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

if isclose(sqrt(c) - (sqrt(a) + sqrt(b)), 0):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
mi = lambda : map(int,input().split())

import math

a,b,c = mi()

# if a+b-c/2 >= math.sqrt(a*b):
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c)
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import math as m
a,b,c = map(int,input().split())
if (c - a - b)**2 < 10**9:
	print("Yes" if 4*a*b < (c - a - b)**2 else "No")
else:
	print("Yes" if m.log(4*a*b) < 2*m.log((c - a - b)) else "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)

hidari = math.sqrt(A) + math.sqrt(B)

if hidari < migi:
    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:
	p=(a*b)**(1/2)
	if 2*p<(c-a-b):
    	print("Yes")
    else:
    	print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

if float(a[0] + 2*math.sqrt(a[1]*a[0]).as_integer_ratio() + a[1]) < float(a[2]):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math as m
a,b,c = map(int,input().split())
if (c - a - b)**2 < 10**9:
	print("Yes" if 4*a*b < (c - a - b)**2 else "No")
else:
	print("Yes" if m.log(4*a*b) < 2*log((c - a - b)) else "No")

Submission status: Runtime Error

Solution code:
a = input()
b = input()
c = input()
if a * a + b * b + c * c - 2 * a * c - 2 * b * c - 2 * a * b > 0:
  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\n")
else:
    print("No\n")

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):
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Runtime Error

Solution code:
from math import sqrt
nums = [float(e) for e in input().split()]
if(sqrt(nums[0])+sqrt(nums[1])<sqrt(nums[2])):
>---print("Yes")
else:
>---print("No")

Submission status: Runtime Error

Solution code:
import math
a, b, c = list(map(int, input().split()))
# xのn乗根を得る
def nroot(a, n, x=1.0, eps=1e-7):
    while abs(a - x**n) > eps:
#         print(abs(a - x**n))
        x = ( (n-1)*x + a/(x**(n-1)) ) / n
    return x
def sq(a):
    aa = np.sqrt(a)
    return nroot(a, 2, aa)
if (sq(a) + sq(b)) < sq(c):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
File Edit Options Buffers Tools Python Help                                                                            
import numpy as np

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

if b > a:
    temp = a
    a = b
    b = temp

res = c - a
res = res - b
temp = 4*a*b

if res**2 > temp:
    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:
  	p=(a*b)**(1/2)
	if 2*p<(c-a-b):
    	print("Yes")
    else:
    	print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
import math
from fractions import gcd
import sys
#input = sys.stdin.readline


#N=int(input())

#A=list(map(int,input().split()))
#XY=[list(map(int,input().split())) for i in range(N)]

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

if math.isclose(c**.5,a**.5+b**.5):
    print("No")

elif c**.5-a**.5-b**.5>0.0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math
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 sympy
a, b, c = map(int, input().split())

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

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
ans = math.sqrt(a) + math.sqrt(b) < math.sqrt(c)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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:
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
  ll a,b,c;
  cin >> a >> b >> c;
  ll  res;
  res = (c-a-b)*(c-a-b)-4*a*b;
  if (res>0) cout << "Yes"<<endl;
  else cout << "No"<<endl;
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
def listint():
    a = input().split()
    for i in range(len(a)):
        a[i] = int(a[i])
    return a
 
a,b,c = listint()
if a+b+2*math.sqrt(a*b) < c:
    print('Yes')
else:
    print('No')
import math
def listint():
    a = input().split()
    for i in range(len(a)):
        a[i] = int(a[i])
    return a

a,b,c = listint()
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())
G = math.sqrt(c)-(math.sqrt(a) + math.sqrt(b))
if G != 0 and math.ceil(G) >= 1:
  print('Yes')
  sys.exit(0)
print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3 ## -*- python -*-
import math

t = input().split()
a = int(t[0])
b = int(t[1])
c = int(t[2])

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

Submission status: Runtime Error

Solution code:
using System;
using System.Linq;

namespace Panasonic2020C
{
    class MainClass
    {
        public static void Main(string[] args)
        {
            long[] abc = Console.ReadLine().Split().Select(long.Parse).ToArray();
            double a = abc[0];
            double b = abc[1];
            double c = abc[2];
            double ab = Math.Sqrt(a * b);
            Console.WriteLine(a + b+ 2*ab < c ? "Yes" : "No");
        }
    }
}

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <limits>
#include <list>
#include <string>
#include <queue>
#include <deque>
#include <tuple>
#include <map>
#include <sstream>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a; i<(int)(b); i++)
#define ALL(x) (x).begin(),(x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0 ,sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const long double PI  = acos(-1.0L);
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
#define chmax(a,b) a = (((a)<(b))?(b):(a))
#define chmin(a,b) a = (((a)>(b))?(b):(a))

__attribute__((constructor))
void initial(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(15);
}

signed main(){
	ll a,b,c; cin>>a>>b>>c;
	cerr << 4*a*b SP pow(c-a-b,2) << endl;
	if(c-a-b<=0) cout<<"No";
	else if(4*a*b<pow(c-a-b,2)) cout << "Yes";
	else cout << "No";

  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.io.*;

class CNN {

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[64]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

	public static void main(String[] args) throws IOException {
		Reader input = new Reader();
		long a = input.nextLong();
		long b = input.nextLong();
		long c = input.nextLong();
		if((double)((double)Math.sqrt(a) + (double)Math.sqrt(b)) < (double)Math.sqrt(c)) {
			System.out.println("Yes");
		}
		else {
			System.out.println("No");
		}
	}
}

Submission status: Runtime Error

Solution code:
import math
a = int(input())
b = int(input())
c = int(input())
if (sqrt(a)+sqrt(b)) < sqrt(c):
  print('yes')
else:
  print('no')

Submission status: Runtime Error

Solution code:
A=int(ABC[0])
B=int(ABC[1])
C=int(ABC[2])
AB=math.sqrt(A*B)
if A+B+AB<C :
    print ("Yes")
else :
    print ("No")

Submission status: Runtime Error

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



typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
typedef vector< vector< vector<ll> > > vvvint;
typedef vector<string> vstring;
typedef vector< vector<string> > vvstring;
typedef vector<char> vchar;
typedef vector< vector<char> > vvchar;
typedef vector<long double> vdouble;
typedef vector< vector<long double> > vvdouble;
typedef vector< vector< vector<long double> > > vvvdouble;
typedef pair<ll,ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;

#define rep(i,n) for(ll i=0;i<n;i++)
#define repf(i,f,n) for(ll i=f;i<n;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define MOD 1000000007
// #define MOD 998244353
// #define MOD LLONG_MAX
const double PI=3.14159265358979323846;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }




int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0,};

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}

  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;






void printv(vint &V){
  for(auto e:V)cout<<e<<" ";
  cout<<endl;
}

vector< bool > prime_table(int n) {
  vector< bool > prime(n + 1, true);
  if(n >= 0) prime[0] = false;
  if(n >= 1) prime[1] = false;
  for(int i = 2; i * i <= n; i++) {
    if(!prime[i]) continue;
    for(int j = i + i; j <= n; j += i) {
      prime[j] = false;
    }
  }
  return prime;
}

vector< int > prime_numbers;






int main() {


  cout<<fixed<<setprecision(10);

  long double a,b,c; cin>>a>>b>>c;

  if(sqrt(a) + sqrt(b) < sqrt(c)) puts("Yes");
  else puts("No");

}

//

Submission status: Runtime Error

Solution code:
import math

a, b, c = [x for x in 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 = int(input().split())
n = math.sqrt(a)+math.sqrt(b)
k = math.sqrt(c)
if n<k:
  print("Yes")
  
else:
  print("No")

Submission status: Runtime Error

Solution code:
ABC=input().split()

A=int(ABC[0])
B=int(ABC[1])
C=int(ABC[2])
AB=math.sqrt(AB)
if A+B+AB<C :
    print ("Yes")
else :
    print ("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B = map(int,input().split())
print(int((A * B + 1) / 2))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

A_r = math.sqrt(A)
B_r = math.sqrt(B)
C_r = math.sqrt(C)

if A_r + B_r < C_r:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
in_list = list(input().split())
a = in_list[0]
b = in_list[1]
c = in_list[2]
if (math.sqrt(a) + math.sqrt(b)) < math.sqrt(c):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
in_list = list(input().split())
a = int(in_list[0])
b = int(in_list[1])
c = int(in_list[2])
if (math.sqrt(a) + math.sqrt(b)) < math.sqrt(c):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a, b, c = input(), input(), input()
if a * a + b * b + 2 * a * b < c * c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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


import math

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

g = math.gcd(math.gcd(a,b), c)
a //= g
b //= g
c //= g

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

Submission status: Runtime Error

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

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")
elif np.sqrt(a)+np.sqrt(b)>=p.sqrt(c):
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readlinH, W = [int(x) for x in input().split()]

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

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

Submission status: Runtime Error

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

A = a ** (1/2)
B = b ** (1/2)
C = c ** (1/2)

if A + B < 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

import numpy as np

##### リストの 二分木検索 #####
# 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**0.5 + b**0.5 < c**0.5:
		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:
a, b, c = [int(x) for x in input().split(" ")]

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

Submission status: Runtime Error

Solution code:
import numpy as np
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: Runtime Error

Solution code:
from math import sqrt


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


main()

Submission status: Runtime Error

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

A = a+b+2*math.sqrt(a*b)

if A < c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
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:
a,b,c = map(int, input().split())
import.math

A = a+b+2*sqrt(a*b)

if A < 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)<math.(c)):
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define all(obj) obj.begin(), obj.end()
#define db(x) cerr << #x << ":" << x << " "
#define dbl(x) cerr << #x << ":" << x << "\n"
#define dbv(vec) cerr << #vec << ":"; for (auto e : vec) cerr << e << " "; cout << "\n"
#define dbvv(vv) cerr << #vv << ":\n"; for (auto vec : vv) { for (auto e : vec) cerr << e << " "; cerr << endl; }
#define YN(f) cout << (f ? "YES" : "NO") << endl
#define Yn(f) cout << (f ? "Yes" : "No") << endl
#define yn(f) cout << (f ? "yes" : "no") << endl
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;

int main() {
	ll a, b, c; cin >> a >> b >> c;
	bool f = (4 * a * b < (c - a - b) * (c - a - b) && c - a - b > 0);
	Yn(f);	
}

Submission status: Runtime Error

Solution code:
#%%
A = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K = int(input())

print(A[K - 1])

#%%
from decimal import *
getcontext().prec = 20

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

sqrt_ab = Decimal(a).sqrt() + Decimal(b).sqrt()
sqrt_c = Decimal(c).sqrt()

if sqrt_ab < sqrt_c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
def main():
    import fractions
    a, b, c = map(int, input().split())
    a = fractions.sqrt(a)
    b = fractions.sqrt(b)
    c = fractions.sqrt(c)

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


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
h, w = map(int, input().split())
if h == 1 or w == 1: print(1)
else: print((h * w + 1) // 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

resolve()

Submission status: Runtime Error

Solution code:
print "Yes"

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = "2,3" 
print "No"

Submission status: Runtime Error

Solution code:
import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(100000)


def read_values():
    return map(int, input().split())


def read_index():
    return map(lambda x: x - 1, map(int, input().split()))


def read_list():
    return list(read_values())


def read_lists(N):
    return [read_list() for n in range(N)]


def functional(N, mod):
    F = [1] * (N + 1)
    for i in range(N):
        F[i + 1] = (i + 1) * F[i] % mod
    return F


def main():
    a, b, c = read_values()
    print("Yes" if c - a - b> 2 * (a * b) ** 0.5) else "No")


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
from math import sqrt

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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