Problem:


Score : 100 points

Problem Statement

You are given three integers A, B and C.

Determine if there exists an equilateral triangle whose sides have lengths A, B and C.

Constraints

All values in input are integers.

1 \leq A,B,C \leq 100

Input

Input is given from Standard Input in the following format:

A B C

Output

If there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.

Sample Input 1

2 2 2

Sample Output 1

Yes

There exists an equilateral triangle whose sides have lengths 2, 2 and 2.

Sample Input 2

3 4 5

Sample Output 2

No

There is no equilateral triangle whose sides have lengths 3, 4 and 5.



Sample input:
2 2 2


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
a=input().split()
if set(a)==a:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
A.sort()
if (A[0]+A[1]) > A[2]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a=input()
t=a.replace(" ",",")
u=list(t)
if u[0]==u[1] and u[1]==u[2]:
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
a=input()
t=a.replace(" ","")
u=list(t)
if u[0]==u[1] and u[1]==u[2]:
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
a=input()
t=a.replace(" ","")
u=list(t)
if u[0]==u[1]==u[2]:
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
a=input()
t=a.replace(" ","")
u=list(t)
if u[0]==u[1]==u[2]:
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a + b > c or b + c > a or c + a > b:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
inp = [int(n) for n in input().split(" ")]

print(inp[0] == inp[1] and inp[0] == inp[2] and 1 <= inp[0] <= 100)

Submission status: Wrong Answer

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

_A = _input[0] * _input[0]
_B = _input[1] * _input[1]
_C = _input[2] * _input[2]

if _A + _B == _C:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
i = input()
if i.count('R') >= i.count('B'):
	print('Yes')
else :
	print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
print('YES' if A == B == C else 'NO')

Submission status: Wrong Answer

Solution code:
if len(set(list(input()))):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
ABC = [A,B,C]
ABC.sort(reverse=False)
if ABC[0]+ABC[1]>ABC[2]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
hen=list(map(int,input().split()))
if max(hen)<sum(hen)-max(hen):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
hen=list(map(int,input().split()))
if max(hen)>sum(hen)-max(hen):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
print('NYoes'[len(set(input().split()))==1::2])

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
print("Yes" if sum([a,b,c])>2*max([a,b,c]) else "No")

Submission status: Wrong Answer

Solution code:
import sys
 
input = sys.stdin.readlines()

print(input[0])

Submission status: Wrong Answer

Solution code:
def main():
    a,b,c = map(int,input().split())
    if (a+b>c and b+c>a and c+a>b):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    a,b,c = map(int,input().split())
    if (a+b<c and b+c<a and c+a<b):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
print('Yes' if A<B+C and B<C+A and C<A+B else 'No')

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
li=[a,b,c]
li=sorted(li)

if li[2]<li[0]+li[1]:
	ans="Yes"
else:
	ans="No"
print(ans)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
li=[a,b,c]
li=sorted(li)

if li[2]<=li[0]+li[1]:
	ans="Yes"
else:
	ans="No"
print(ans)

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
if A[0] + A[1] >= A[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
if A[0] + A[1] > A[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())

if A+B+C - max(A,B,C) > max(A,B,C):
  print ("Yes")
else:
  print ("No")

Submission status: Wrong Answer

Solution code:

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

if A+B+C - max(A,B,C) >= max(A,B,C):
  print ("Yes")
else:
  print ("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, input().split())
if a == b == c:
  print('Yse')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())

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

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
print("Yes" if max(A)<sum(A)-max(A) else "No")

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
print("Yes" if max(A)>sum(A)-max(A) else "No")

Submission status: Wrong Answer

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque


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








if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
abc = list(map(int, input().split()))
abc.sort()
if abc[2] >= abc[0] + abc[1]:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

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

print("YES" if a == b == c else "NO")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a == b and a == c:
  print('Yes')
print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = sorted(list(input()))
T = sorted(list('yahoo'))
if S==T:
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
a.sort()
if a[0]+a[1]<a[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
a.sort()
if a[0]>a[1]+a[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
a.sort()
if a[0]+a[1]>a[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
print("YNEOS"[len(set(map(int,input().split())))>1::2])

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
if A<B+C and B<A+C and C<A+B:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
List = [A,B,C]
List.sort()
if List[0] < List[1] + List[2]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
# A - Regular Triangle
sides = list(map(int, input().split()))
sides.sort()
sides.reverse()
#print(sides)
if sides[0]/2 < sum(sides[1:]):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
# A - Regular Triangle
sides = list(map(int, input().split()))
sides.sort()
sides.reverse()
#print(sides)
if sides[0]/2 <= sum(sides[1:]):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

cor_lst = sorted(lst)

#print(cor_lst)

if int(cor_lst[0])+int(cor_lst[1]) > int(cor_lst[2]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int,input().split())
if a == b and b == c:
  print('Yes')
print('No')

Submission status: Wrong Answer

Solution code:
i = input().split()
if (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
i = input().split()
if int (float(i[0]) ==float(i[1])) and (float(i[0]) ==float(i[2])):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
i = input().split()
if (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
i = input().split()
if (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):
  print('YES')
else:
  print('NO')
print(i[0])

Submission status: Wrong Answer

Solution code:
i = input().split()
if int (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
i = input().split()
if int (int(i[0]) ==int(i[1])) and (int(i[0]) ==int(i[2])):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
def sankaku(a,b,c):
    if a == b == c:
        return 'Yes'
    else:
        return 'No'

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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

if A == B and B == C:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
from sys import stdin
##  input functions for me
def ria(sep = ''):
    if sep == '' :
        return list(map(int, input().split())) 
    else: return list(map(int, input().split(sep)))
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()
##

## main ##
A, B, C = map(int, input().split())
print("Yes" if (A == B and B == C) else "NO")

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
# encoding:utf-8
import copy
import numpy as np
import random
import bisect #bisect_left　これで二部探索の大小検索が行える


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

if (a==b and b ==c):
    print("Yse")

else:
    print("No")

Submission status: Wrong Answer

Solution code:
lst=list(map(int,input().split()))
def abs(j,k):
  if j>=k:
    return j-k
  else:
    return k-j
m=max(lst)
if lst.count(m)==1:
  i=lst.index(m)
  l=abs(lst[(i+1)%3],lst[(i+2)%3])
  n=lst[(i+1)%3]+lst[(i+2)%3]
  if l<m and m<n:
    print('Yes')
  else:
    print('No')
elif lst.count(m)==2:
  n=min(lst)
  if abs(m,n)<m:
    print('Yes')
  else:
    print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
lst=list(map(int,input().split()))
def abs(j,k):
  if j>=k:
    return j-k
  else:
    return k-j
m=max(lst)
if lst.count(m)==1:
  i=lst.index(m)
  l=abs(lst[(i+1)%3],lst[(i+2)%3])
  n=lst[(i+1)%3]+lst[(i+2)%3]
  if l<m and m<n:
    print('Yes')
  else:
    print('No')
else:
  print('Yes')

Submission status: Wrong Answer

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

ABC.sort()

print(["No", "Yes"][ABC[0]+ABC[1] > ABC[2]])

Submission status: Wrong Answer

Solution code:
def trya(a):
  if sum(a)/2>max(a):
    return "Yes"
  else:
    return "No"

a=list(map(int,input().split()))
print(trya(a))

Submission status: Wrong Answer

Solution code:
def trya(a):
  if sum(a)/2>max(a):
    return "Yes"
  else:
    return "No"

Submission status: Wrong Answer

Solution code:
a = "2 2 2".split()
if int(a[0]) == int(a[1]) and int(a[1]) == int(a[2]):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=input().split();print("YNeos"[a!=b and b!=c::2])

Submission status: Wrong Answer

Solution code:
a, b, c = sorted(list(map(int, input().split())), reverse=True)
print('Yes' if b - c < a and a < b + c else 'No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
print('Yes') if abs(A-B)<C and A+B>C and A+B/C*2 == 1 else print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
print('Yes') if A+B/C*2 == 1 else print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
print('Yes') if abs(A-B)<C and A+B>C else print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
print('Yes') if A+B>C and C+B>A and A+C>B else print('No')

Submission status: Wrong Answer

Solution code:
s = {map(int, input().split())}
if len(s) == 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#エクサウィザーズ2019

a,b,c = map(int,input().split())
li = [a,b,c]
d = max(li)

if d >= (sum(li)-d):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
arr=list(map(int,input().split()))
if(arr.count(arr[0])==3):
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
if A[0]==A[1] and A[1]==A[2] and A[0]>0:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
if a[0]==a[1] and a[1]==a[2]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
s = input()
if s[0] == s[2] == s[4]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
blank = str(input().replace(' ',''))

if blank == '111' or blank == '222' or blank == '333' or blank == '444' or blank == '555' or blank == '666' or blank == '777' or blank == '888' or blank == '999':
	print('Yes')

else:
    print('No')

Submission status: Wrong Answer

Solution code:
anohito  = input
binohito = input
sinohito = input

if anohito == binohito == sinohito :
  print("Yes")

else :
  print('No')

Submission status: Wrong Answer

Solution code:
l = []
l= list(map(int,input().split()))
ls = sorted(l)
a = ls[0]
b = ls[1]
c = ls[2]

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

Submission status: Wrong Answer

Solution code:
l = []
l= list(map(int,input().split()))
ls = sorted(l)
a = ls[0]
b = ls[1]
c = ls[2]

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

Submission status: Wrong Answer

Solution code:
l = []
l= list(map(int,input().split()))
ls = sorted(l)
a = ls[0]
b = ls[1]
c = ls[2]

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

Submission status: Wrong Answer

Solution code:
anohito = 3
binohito =4
sinohito =5



if anohito == binohito == sinohito :
  print("Yes")

else :
  print('No')

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
ans = "No"
if a==b==c:
    ans = "yes"
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

A, B, C = input().split()
a = int(A)
b = int(B)
c = int(C)

if a == b:
    if a == c:
        print('YES')
        sys.exit()

print('NO')

Submission status: Wrong Answer

Solution code:
a = input()
b = a.split()
if b[0] == b[1]:
    if b[1] == b[2]:
        print('yes')
    else:
        print('no')
else:
    print('no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
A, B, C = map(int, input().split(" "))
lst = np.array([A, B, C])
M = np.max(lst)
lst = np.delete(lst, np.where(M))
m1 = lst[0]
m2 = lst[1]
print(m1, m2, M)
if m1 + m2 > M:
    sys.stdout.write("Yes")
    sys.stdout.flush()
else:
    sys.stdout.write("No")
    sys.stdout.flush()

Submission status: Wrong Answer

Solution code:
import sys

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

if A == B:
    if A == C:
        print('YES')
        sys.exit()

print('NO')

Submission status: Wrong Answer

Solution code:
def regtri(a, b, c):
    if a == b and b == c:
        return 'Yes'
    else:
        return 'No'
 
a, b, c = (int(i) for i in input().split())
regtri(a, b, c)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
A, B, C = map(int, input().split(" "))
lst = np.array([A, B, C])
M = np.max(lst)
lst = np.delete(lst, np.where(M))
m1 = lst[0]
m2 = lst[1]
print(m1, m2, M)
if m1 + m2 > M:
    sys.stdout.write("Yes")
    sys.stdout.flush()
else:
    sys.stdout.write("Yes")
    sys.stdout.flush()

Submission status: Wrong Answer

Solution code:
import numpy as np
A, B, C = map(int, input().split(" "))
lst = np.array([A, B, C])
M = np.max(lst)
lst = np.delete(lst, np.where(M))
m1 = lst[0]
m2 = lst[1]
print(m1, m2, M)
if m1 + m2 > M:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c = input().split()
print(["No", "Yes"][(a == b and b == c)::2])

Submission status: Wrong Answer

Solution code:
a, b, c = input().split()
print("YNeos"[(a != b and b != c)::2])

Submission status: Wrong Answer

Solution code:
import sys

def solve(a, b, c):
    max_value = max(a, b, c)
    all = [a, b, c]
    all.pop(all.index(max_value))
    if sum(all) > max_value:
        return "Yes"
    else:
        return "No"

if __name__ == '__main__':

    a, b, c = sys.stdin.readline().strip().split(" ")
    ans = solve(int(a), int(b), int(c))
    print ans

Submission status: Wrong Answer

Solution code:
a, b, c = input().split()
print("YNeos"[(a == b and b == c)::2])

Submission status: Wrong Answer

Solution code:
ABC = list(map(int, input().split()))
ABC.sort()
if ABC[0] + ABC[1] > ABC[2]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input().split(' ')
maxNum = max(s)
s.remove(maxNum)
if(float(s[0])**2 + float(s[1])**2 == float(maxNum)**2):
   print('Yes')
else:
   print('No')

Submission status: Wrong Answer

Solution code:
input_number = input().rstrip().split(' ')
if (input_number[0] == input_number[1])and (input_number[1] == input_number[2]):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
ABC = list(map(int, input().split()))
if ABC[0] + ABC[1] < ABC[2] or ABC[1] + ABC[2] < ABC[0] or ABC[0] + ABC[2] < ABC[1]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
A ,B ,C =map(int,input().split())
if A==B and B==C:
     print('YES')
else :
     print('NO')

Submission status: Wrong Answer

Solution code:
import sys

A, B, C = input().split()
a = int(A)
b = int(B)
c = int(C)

if a == b:
    if a == c:
        print('YES')
        sys.exit()
        
print('NO')

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if a==b and b==c and c==a:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:

i = input().split()

if i[0]==i[1] and i[1]==i[2]:
    print("YES")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
if A==B and B==C:
     print('YES')
else :
     print('NO')

Submission status: Wrong Answer

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

if str[0] == str[1] and str[1] == str[2]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
if A+B>C and B+C>A and C+A>B:
     print('YES')
else :
     print('NO')

Submission status: Wrong Answer

Solution code:
s = input().split(' ')
maxNum = max(s)
s.remove(maxNum)
if(int(s[0])**2 + int(s[1])**2 == int(maxNum)**2):
   print('Yes')
else:
   print('No')

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
if A+B>=C and B+C>=A and C+A>=B:
     print('YES')
else :
     print('NO')

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split( ))
if A == B:
    if B==C:
        print('Yes')
    else: 
        print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# # # coding=utf-8
# # # Author: lee215

get = lambda: int(raw_input().strip())
getl = lambda: raw_input().strip()
gets = lambda: map(int, raw_input().strip().split())
getss = lambda n: [gets() for _ in xrange(n)]

# 2019-03-30 20:14

A, B, C = gets()


def solve(A, B, C):
    if len(set([A, B, C])) < 3:
        print 'Yes'
    else:
        print 'No'

solve(A, B, C)

Submission status: Wrong Answer

Solution code:
an = sorted(list(map(int, input().split())), reverse = True)
if an[0] < an[1] + an[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
hen_list=list(map(int,input().split()))
print(['No','Yes'][sum(hen_list)-2*max(hen_list)>0])

Submission status: Wrong Answer

Solution code:
# # # coding=utf-8
# # # Author: lee215

get = lambda: int(raw_input().strip())
getl = lambda: raw_input().strip()
gets = lambda: map(int, raw_input().strip().split())
getss = lambda n: [gets() for _ in xrange(n)]

# 2019-03-30 20:14

A, B, C = gets()


def solve(A, B, C):
    if A == B == C:
        print 'Yes'
    else:
        print 'N0'

solve(A, B, C)

Submission status: Wrong Answer

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

if a == b == c:
    print("yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from sys import stdin

def load():
    n = stdin.readline()
    return n

def calc(n):
    return n.count("2")

n = load()
a,b,c = [ int(x) for x in n.split(' ')]

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
if A == B and B == C and C == A:
    print("Yes")
print("No")

Submission status: Wrong Answer

Solution code:
length = list(map(int, input().split()))
if length[0] == length[1] and length[1] == length[2]:
    print(True)
else:
    print(False)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C = map (int,input().split())
list = [A,B,C]
list.sort()

if list[2] < list[0] + list[1]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C = map (int,input().split())
list = [A,B,C]
list.sort()

if list[2] > list[0] + list[1]:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split(" "))

if A + B <= C:
  print('No')
elif A + C <= B:
  print('No')
elif B + C <= A:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
# N = int(input())
N = list(map(int, input().split()))
# N = input().split()
# N = input()

N.sort()
ans = 'No'
if N[0]**2 + N[1]**2 >= N[2]**2:
    ans = 'Yes'

print(ans)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
is1 = a + b > c
is2 = b + c > a
is3 = c + a > b
ans = "Yes" if is1 & is2 & is3 else "No"
print(ans)

Submission status: Wrong Answer

Solution code:
li = list(map(int,input().split()))
a = li[0]
b = li[1]
c = li[2]
if a + b > c and a + c > b and b + c > a:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if a == b and b == c:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
print('a')

Submission status: Wrong Answer

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

if (a == b)  & (b == c) &(c == a):
    print('yes')
else :
    print( 'no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# N = int(input())
N = list(map(int, input().split()))
# N = input().split()
# N = input()

N.sort()
ans = 'No'
if N[0]**2 + N[1]**2 > N[2]**2:
    ans = 'Yes'

print(ans)

Submission status: Wrong Answer

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

A.sort()

if (A[0] + A[1]) > A[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if a==b and b==c:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

if A == B == C:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().strip().split(' '))
if a==b and b==c:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

numbers = [A, B, C]
numbers.sort()

if numbers[0] + numbers[1] > numbers[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

if(a==b):
    if(a==b):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
if A == B and B == C:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())

print(A,B,C)

if A == B and B == C:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A=[int(x) for x in input().split()]

A=sorted(A)

if A[0]+A[1]>A[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A , B , C = map(int,input().split())
sum_ABC = A + B + C
max_ABC = max(A,B,C)
if sum_ABC - max_ABC > max_ABC:
 print("Yes")
else:
 print("No")

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split(' '))

if A**2 + B**2 == C**2:
    print('Yes')
elif B**2 + C**2 == A**2:
    print('Yes')
elif C**2 + A**2 == B**2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=input().split(" ")
a=int(x[0])
b=int(x[1])
c=int(x[2])
if a==b and a==c and b==c:
    print("Yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
A,B,C = list(map(int, input().split()))
if A==B and B==C:
	print("yes")
else:
	print("No")

Submission status: Wrong Answer

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

if (a == b)  & (b == c) :
    print('yes')
else :
    print( 'no')

Submission status: Wrong Answer

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

if(a+b > c and a+c > b and b+c > a):
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
a, b, c = map(str, input().strip().split(' '))
if a+b>c and b+c>a and c+a>b:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!venv/bin/python

import math
import numpy as np
import random
import copy
import statistics 
import bisect
import heapq
from collections import defaultdict 

A, B, C = [int(x) for x in input().split()]

if A == B and B == C:
    print ("Yes")
else:
    print ("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int,input("test").split(" "))
if A == B == C:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def solve():
 a = list(int(i) for i in input().split())
 a.sort()
 if a[0]+a[1] < a[2]:
    return 'Yes'
 else: 
  return 'No'
print(solve())

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split(' '))

if A**2 + B**2 == C**2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

A, B, C = inpl()
if A==B==C:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys

def main():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())

    if A + B > C and B + C > A and C + A > B:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
if a == b == c:
    print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a = na()
a.sort()

if a[0]+a[1] > a[2]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
list_n = list(map(int,input().split()))
list_n.sort(reverse=True)
if list_n[0]**2 == list_n[1]**2+list_n[2]**2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
x=input().split(" ")
a=int(x[0])
b=int(x[1])
c=int(x[2])
if a==b and a==c:
    print("Yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
if A-B==2*C:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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