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= 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 = sorted(int(z) for z in input().split())
if 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("No")

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [i for i in input().split()]
print('Yes' if len(set(a)) == 1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
def input():
    return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst=[int(x) for x in input().split()]
if lst[0]==lst[1]==lst[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
m=len(set(l))
if(m==1):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if min(a) == max(a):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  A,B,C=map(int,pin().split())
  if A==B and B==C:
    print("Yes")
    return 
  print("No")
  return 

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
print("Yes" if len(set(l))==1 else "No")

Submission status: Accepted

Solution code:
#エクサウィザーズ 2019 a
a,b,c=map(int,input().split())
if a==b==c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if len(set(abc)) == 1: print('Yes')
else: print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
L = list(map(int,input().split()))
if all([L[0] == L[i] for i in range(3)]):
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print('Yes') if len(set([a, b, c])) == 1 else print('No')

Submission status: Accepted

Solution code:
if len(set(list(map(int, input().split())))) == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if a.count(a[0]) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 1
ans = 0
inf = float("inf")

a,b,c = I()
if a == b == c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print(['No','Yes'][len(set(input().split()))==1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a==b==c:
    print('Yes')

else:
    print('No')

Submission status: Accepted

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

if len(a) == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if len(set(a))==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
print("NYoe s"[eval(input().replace(" ","=="))::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

res = 1 <= n[0] <= 100 and n[0] == n[1] == n[2]

if res:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
inp = [int(n) for n in input().split(" ")]
res = inp[0] == inp[1] and inp[0] == inp[2] and 1 <= inp[0] <= 100

if res:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:




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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

A, B, C = MAP()
print("Yes" if A == B == C else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
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

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############
A,B,C = IL()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B,C=[int(i) for i in input().split(" ")]
print("Yes" if A==B==C else "No")

Submission status: Accepted

Solution code:
x, y, z = map(int,input().split())

if x == y == z:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_input = input().split(" ")
_A = int(_input[0])
_B = int(_input[1])
_C = int(_input[2])

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B, C = map(int, readline().split())
    if A==B==C:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div
# endregion
A, B, C = ri_()
print('Yes' if A == B and B == C else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
lst = list(map(int, input().split()))
s = set(lst)

if len(s) == 1:
  print ('Yes')
else:
  print ('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    if A == B == C:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print('NYoe s'[a==b==c::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b,c=map(int, input().split())
    if a==b==c:
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    a,b,c=map(int,input().split())
    if a==b and b==c: print('Yes')
    else: print('No')
    
resolve()

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    if len(set(list(map(int, input().split())))) == 1:
        print('Yes')
    else:
        print('No')
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    l = set(list(map(int, input().split())))
    if len(l) == 1:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if len(set(l)) == 1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

# A - Regular Triangle
A, B, C = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

if __name__ == '__main__':
    A, B, C = map(int, input().split())
    if A == B and B == C:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
# 1
# https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_a
if False:
    N,K=map(int,input().split())
    print('YES' if N-K-(K-1)>=0 else 'NO')

# 2
# https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_b
if False:
    N=int(input())
    S=input()
    print('Yes' if S.count('R')>S.count('B') else 'No')

# 3
# https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_a
if True:
    print('Yes' if len(set(input().split()))==1 else 'No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a,b,c=map(int,input().split())
    if a==b and b==c:print("Yes")
    else:print("No")

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# エクサウィザーズ 2019: A – Regular Triangle
a, b, c = map(int, input().split())
print('Yes' if a == b == c else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
hen=set(list(map(int,input().split())))
if len(hen)==1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    if a[0] == a[1] and a[1] ==a[2]:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

A = set(iil())
if len(A) == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if len(set(input().split())) == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if len(set(A)) == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
if len(set(l)) == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = set([int(i) for i in input().split()])
if len(li)==1:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    print("Yes" if len(set(list(map(int, input().split())))) == 1 else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if a == b == c:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
print("Yes" if (len(set(list(map(int,input().split()))))==1) else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
A, B, C = [int(_) for _ in stdin.readline().rstrip().split()]
if A == B == C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

    return  A == B == C

print('Yes' if main() else 'No')