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

int main() {
    cout << fixed << setprecision(10);
    
    // long double a, b, c; cin >> a >> b >> c;
    ll a, b, c; cin >> a >> b >> c;
    // if (sqrtl(a) + sqrtl(b) < sqrtl(c)) {
    if (sqrt(double(a)) + sqrt(double(b)) < sqrt(double(c))) {
    // if (a+b+2*sqrt(a*b) < c) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
    return 0;
}

Submission status: Runtime Error

Solution code:
i = list(map(int, input().split()))
a=i[0]
b=i[1]
c=i[2]
import math

if a**0.5+b**0.5>c**0.5:
    print('No')
elif(math.isclose(a**0.5+b**0.5,c**0.5)):
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

Solution code:
import sys
import math

a = int(sys.argv[1])
b = int(sys.argv[2])
c = int(sys.argv[3])

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

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
# x = a * a  +  b * b  +  c * c
# y = 2 * (a * b  +  b * c  +  c * a)
# print('Yes' if x > y else'No')
print('Yes' if a + b + pow(2 * a * b) < c else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

import numpy as np

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

ruto_a = numpy.around(np.sqrt(a), decimals = 100)
ruto_b = numpy.around(np.sqrt(b), decimals = 100)
ruto_c = numpy.around(np.sqrt(c), decimals = 100)

if ruto_a + ruto_b < ruto_c:
    print("Yes")

else:
    print("No")

Submission status: Runtime Error

Solution code:
# Python3 program to demonstrate the 
# sqrt() method 

# import the math module 
import math 

# print the square root of 0 
a,b,c = input().split() 
t=(math.sqrt(a)) 

# print the square root of 4 
p=(math.sqrt(b)) 
q=(math.sqrt(c))
if t+p < q:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import math
from decimal import *

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

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


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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
from collections import deque, defaultdict
import bisect
from math import factorial, sqrt, log2


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

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

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


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x,y) CPP_CAT_I(x,y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x,y) x ## y

using i8  = int8_t;
using u8  = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;

using f32 = float;
using f64 = double;

#define FOR(i, start, end) for(i64 i = (start), CPP_CAT(i,xxxx_end)=(end); i < CPP_CAT(i,xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for(i64 i = 1; i <= n; ++i)
#define RREP(i, n) for(i64 i = n - 1; i >= 0 ; --i)
#define RREPS(i, n) for(i64 i = n; i >= 1; --i)

#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(std::begin(cccc), std::end(cccc), ## __VA_ARGS__); })(c))

#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

#define pb push_back
#define mp make_pair
#define F first
#define S second

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; }

template<typename C>
i64 SIZE(const C& c) { return static_cast<i64>(c.size()); }

template<typename T, size_t N>
i64 SIZE(const T (&)[N]) { return static_cast<i64>(N); }


struct ProconInit {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;

    ProconInit() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(IOS_PREC);
        if(AUTOFLUSH)
            cout << unitbuf;
    }
} PROCON_INIT;


int main() {
    i64 a, b, c;
    cin >> a >> b >> c;

    i64 x = 4 * a * b;
    i64 y = (c - a - b) * (c - a - b);
    if (x < y) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}

Submission status: Runtime Error

Solution code:
a, b, c = [int(_) for _ 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
from decimal import Decimal
a,b,c = (int(x) for x  in input().split())
aa = str(math.sqrt(a))
bb = str(math.sqrt(b))
cc = str(math.sqrt(c))
if Decimal(math.sqrt(aa)) + Decimal(math.sqrt(bb)) < Decimal(math.sqrt(cc)):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

if(H == 1 or W == 1):
    print(1)

else:
    if(H%2 == 0):
        i = H//2
    if(H%2 != 0):
        i = H//2+1
    
    j = H-i

    if(W%2 == 0):
        sum = i*(W//2) + j*(W//2)

    if(W%2 != 0):
        sum = i*(W/2+1) + j*(W/2)
    

    print(sum)

Submission status: Runtime Error

Solution code:
#include<cmath>
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
#include<set>
#include<vector>
#include<bitset>
#define int long long
using namespace std;
const int Maxn=100005,L=100005;
const double PI = acos(-1.0);  
string a,b,c;
inline int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')
			f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return x*f;
}
inline void write(int a)
{
	if(a<0)
	{
		putchar('-');
		write(-a);
	}
	else
	{
		if(a>=10)
			write(a/10);
		putchar(a%10+'0');
	}
}

string sub(string a,string b)//只限大的非负整数减小的非负整数
{
	string ans;
	int na[L]= {0},nb[L]= {0};
	int la=a.size(),lb=b.size();
	for(int i=0; i<la; i++) na[la-1-i]=a[i]-'0';
	for(int i=0; i<lb; i++) nb[lb-1-i]=b[i]-'0';
	int lmax=la>lb?la:lb;
	for(int i=0; i<lmax; i++)
	{
		na[i]-=nb[i];
		if(na[i]<0) na[i]+=10,na[i+1]--;
	}
	while(!na[--lmax]&&lmax>0)  ;
	lmax++;
	for(int i=lmax-1; i>=0; i--) ans+=na[i]+'0';
	return ans;
}
string add(string a,string b)//只限两个非负整数相加
{
	string ans;
	int na[L]= {0},nb[L]= {0};
	int la=a.size(),lb=b.size();
	for(int i=0; i<la; i++) na[la-1-i]=a[i]-'0';
	for(int i=0; i<lb; i++) nb[lb-1-i]=b[i]-'0';
	int lmax=la>lb?la:lb;
	for(int i=0; i<lmax; i++) na[i]+=nb[i],na[i+1]+=na[i]/10,na[i]%=10;
	if(na[lmax]) lmax++;
	for(int i=lmax-1; i>=0; i--) ans+=na[i]+'0';
	return ans;
}
int cmp(string str1,string str2)
{
	if(str1.size() != str2.size()) return str1.size() - str2.size();
	int i;
	for(i = 0; i < str1.size(); ++i)
		if(str1[i] != str2[i]) break;
	if(i < str1.size()) return (str1[i] - str2[i]);
	else return 0;
}
signed main()
{
/*
	cin>>a>>b>>c;
	string ans1,ans2="4";
	if(cmp(add(a,b),c)>0)
		ans1=sub(add(a,b),c);
	else
		ans1=sub(c,add(a,b));
	ans1=mul(ans1,ans1);
	ans2=mul(ans2,mul(a,b));
//	cout<<ans1<<' '<<ans2;
	if(cmp(ans2,ans1)<0)
		puts("Yes");
	else
		puts("No");
	*/
	int a=read(),b=read(),c=read();
	if(sqrt(a)+sqrt(b)<sqrt(c))
	puts("Yes");
	else
		puts("No");
	return 0;
}

Submission status: Runtime Error

Solution code:
a = int(input("\n"))
b = int(input("\n"))
c = int(input("\n"))

x = c - b - a

if 4 * a * b < x * x:
  print("Yes")
else: 
  print("No")

Submission status: Runtime Error

Solution code:
import math

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

k = a + b + 2 * math.sqrt(a * b)) / c - 1

if k < 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)
tmp = (c**2 - (a + b)**2)/(c + (a + b))
if  tmp > 0:
    print('Yes')
elif not math.isclose(tmp, 0):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import sys
import math

a = int(sys.argv[1])
b = int(sys.argv[2])
c = int(sys.argv[3])

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

Submission status: Runtime Error

Solution code:
import sympy

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

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
from collections import deque, defaultdict
import bisect
from math import factorial, sqrt, log2


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

    right = log2(c - a - b)
    left = 1 + 0.5 * (log2(a) + log2(b))

    if right > left:
        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 4*a*b < (c-a-b)**2):
    print("Yes")
else:
    print("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 4*a*b< (round(abs(c - a - b)),0)**2:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

typedef long double ld;
const ld eps = 1.0e-18; // 許容される誤差

ld mysqrtl(ld x)
{
  ld a = sqrt((double)x); // 近似値
  do {
    a = (a + x/a) / 2.0L;
  } while (fabsl(x - a*a) > eps);
  return a;
}

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

  ld aa = mysqrtl(a);
  ld bb = mysqrtl(b);
  ld cc = mysqrtl(c);

  if( aa + bb < cc){printf("Yes");}
  else{printf("No");}

  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
if 4 * a * b < ( c - a - b ) * ( c - a - b ):
	print( "Yes"  ) 
else :
print("No")

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
  print('a')
elif N == 2:
  print('aa')
  print('ab')
elif N == 3:
  print('aaa')
  print('aab')
  print('aba')
  print('abb')
  print('abc')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
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 math
a,b,c = list(map(int,input().split()))
A = math.sqrt(a)
B = math.sqrt(b)
C = math.sqrt(c)
AB = Decimal(A+B)
if AB < C:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
# coding: utf-8
import sympy

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

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

Submission status: Runtime Error

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

ma, mb, mc = math.sqrt(a), math.sqrt(b), math.sqrt(c)
if round(ma + mb, 10) < round(mc,10):
    print('Yes')
    
else:
    print('No')

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
print( "Yes" if 4*a*b<(c-a-b)*(c-a-b) else "No")

Submission status: Runtime Error

Solution code:
import math

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

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

if math.isclose(math.sqrt(a) + math.sqrt(b), math.sqrt(c)):
    ans = 'Yes'

print(ans)

Submission status: Runtime Error

Solution code:
import math
a,b,c = map(int, input())
summ = math.sqrt(a)+math.sqrt(b)
out = math.sqrt(c)

if summ < out:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
ABC=input().rstrip('\n').split()

A=int(ABC[0])
B=int(ABC[1])
C=int(ABC[2])

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

Submission status: Runtime Error

Solution code:
import math
a,b,c = map(float,input().split())
print("Yes" if a**0.5+b**0.5 < c**0.5 and math.isclose(a**0.5+b**0.5 , c**0.5)==False else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if m <= 0:
 　print('No')

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(a: int, b: int, c: int):
    from math import sqrt, log10
    from fractions import Fraction

    fa = Fraction(sqrt(a)+sqrt(b), 20)
    fc = Fraction(sqrt(c), 20)
    if round(sqrt(a)+sqrt(b), 10) < round(sqrt(c), 10):
    # if fa < fc:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
in_num = input('')

all_num = in_num.split()
a = all_num[0]
b = all_num[1]
c = all_num[2]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h> 
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace std;
using namespace __gnu_pbds;  
#define ordered_set tree<ll, null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update> 
#define ll long long
#define ull unsigned long long
#define pb push_back
#define inf 1e18
#define mk make_pair
#define ld long double
#define mod 1000000007
#define fi first
#define se second
#define fastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test ll t; cin>>t; while(t--)
#define setbits __builtin_popcount
#define endl '\n'
#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i));}
sim, class b dor(pair < b, c > d) {
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
ll power(ll a,ll n)
{
    ll p;
    if(n==0)
    {
        return 1;
    }
    p=power(a,n/2);
    p=((p%mod)*(p%mod))%mod;
    if(n%2==1)
    {
        p=(p%mod)*(a%mod);
    }
    return p;
}
int main()
{
    fastIO;
    ll a,b,c;
    cin>>a>>b>>c;
    ld val,val1;
    val=c-a-b;
    val1=2*sqrt(a*b);
    if(val>val1)
    {
        cout<<"Yes\n";
    }
    else
    {
        cout<<"No\n";
    }
}

Submission status: Runtime Error

Solution code:
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define ve vector
const int INF = 1000000007;
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
// *max_element(all(d));
int solve(){ 
  long double a,b,c;
  cin >> a >> b >> c;
  if(sqrt((long double)a) + sqrt((long double)b) < sqrt((long double)c)){
    cout << "Yes" << endl;
  }
  else{
    cout << "No" << endl;
  }
  return 0; 
}
int main(){
  // ios::sync_with_stdio(false);cin.tie(nullptr);
  // cout << fixed;cout << setprecision(16) << endl; 
  solve();
  return 0;
}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sympy

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

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h> 
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace std;
using namespace __gnu_pbds;  
#define ordered_set tree<ll, null_type , less<ll> , rb_tree_tag , tree_order_statistics_node_update> 
#define ll long long
#define ull unsigned long long
#define pb push_back
#define inf 1e18
#define mk make_pair
#define ld long double
#define mod 1000000007
#define fi first
#define se second
#define fastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test ll t; cin>>t; while(t--)
#define setbits __builtin_popcount
#define endl '\n'
#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i));}
sim, class b dor(pair < b, c > d) {
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
ll power(ll a,ll n)
{
    ll p;
    if(n==0)
    {
        return 1;
    }
    p=power(a,n/2);
    p=((p%mod)*(p%mod))%mod;
    if(n%2==1)
    {
        p=(p%mod)*(a%mod);
    }
    return p;
}
int main()
{
    fastIO;
    ld a,b,c;
    cin>>a>>b>>c;
    ld val,val1;
    val=c-a-b;
    val1=2*sqrt(a*b);
    if(val>val1)
    {
        cout<<"Yes\n";
    }
    else
    {
        cout<<"No\n";
    }
}

Submission status: Runtime Error

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

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:
a,b,c=input().split();
a=sqrt(int(a));
b=sqrt(int(b));
c=sqrt(int(c));
sum=a+b
if(sum < c ):
  print("Yes")
else:
  print("No");

Submission status: Runtime Error

Solution code:
def main():
    n = int(input())

    ans = []

    def fanc(i, s):
        if len(s) == n:
            ans.append(s)
        else:
            for x in range(i + 2):
                # print(x,i,s)
                fanc(max([x, i]), s + chr(97 + x))
                # fanc(x + 1, s + chr(97 + x))

    fanc(0, "a")
    ans.sort()
    for i in ans:
        print(i)

    # print(len(ans))
main()

Submission status: Runtime Error

Solution code:
2 3 10

Submission status: Runtime Error

Solution code:
require 'bigdecimal'

a, b, c = gets.split.map(&:to_i)

puts BigDecimal(a).sqrt(100) + BigDecimal(b).sqrt(100) < BigDecimal(c).sqrt(100) ? 'Yes' : 'No'

Submission status: Runtime Error

Solution code:
from math import sqrt


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

Submission status: Runtime Error

Solution code:
a,b,c=[int(x) for x in input().split()]
if c<=a or c<=b: print("No")
elif 2(a*b+b*c+c*a)<a**2+b**2+c**2: print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
from decimal import Decimal

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


A = Decimal(a) ** (1 / 2) + Decimal(b) ** (1 / 2)
C = Decimal(c) ** (1 / 2)
if A < C:
    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).as_integer_ratio() > (math.sqrt(a*b)).as_interger_ratio():
    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)<0:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import math
a, b, c = map(int, input().split())
for i in range(1, 9):
while (a % i == 0 and b % i == 0 and c % i == 0):
  if (a == i or b == i or c == i):
    break
  a /= i
  b /= i
  c /= i
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:
%%time
a,b,c = map(int,input().split())
import math
if (math.sqrt(a)+math.sqrt(b)) ** 2 < (numpy.sqrt(c) ** 2):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a,b,c=[int(x) for x in input().split()]
if c<=a or c<=b: print("No")
else if 2(a*b+b*c+c*a)<a**2+b**2+c**2: print("Yes")
else: print("No")

Submission status: Runtime Error

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

ma, mb, mc = math.sqrt(a), math.sqrt(b), math.sqrt(c)
if ma + mb < mc:
    print('Yes')
    
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c = map(float,input().split())
if a>=1 and b >= 1 and c>= 1 and a>=1000000000 and b >= 1000000000 and c>= 1000000000:
    a = sqrt(a)
    b = sqrt(b)
    c = sqrt(c)
    if a + b < c:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Runtime Error

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

ma, mb, mc = math.sqrt(a), math.sqrt(b), math.sqrt(c)
if ma + mb < mc:
    print('Yes')
    
else:
    print('No')

Submission status: Runtime Error

Solution code:
import math
s = input().split()
a = double(s[0])
b = double(s[1])
c = double(s[2])
if c-a-b-2*math.sqrt(a*b)>0:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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


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

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

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

Submission status: Runtime Error

Solution code:
x=int(input())
y=int(input())
z=int(input())

w=(x**.5) +(y**.5)
if w<z**.5:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

Solution code:
import math

def main():
    a,b,c = list(map(int, input().split(' ')))
    angle_c = math.acos((a**2 + b**2 - c**2)/2*c*a)
    if(angle_c >= 90):
        print('Yes')
    else:
        print('No')
main()

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 len(max(a,b,c) - min(a,b,c)) < 1:
		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,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 math.sqrt(a) + math.sqrt(b) - math.sqrt(c) < 0
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

s = 4*a*b
t = (c-a-b)**2

if s < t:
    print('Yes')
else:
    print('No')
mac:panasonic ryonakay

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:
import math
a,b,c=map(int,input().split())
a=math.sqrt(a)
b=math.sqrt(b)
c=math.sqrt(c)
s=a+b
if s<＝c:
    print('Yes')
else :
    print('No')