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


yes = 'Yes'
no = 'No'

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:
# -*- coding: utf-8 -*-

def solve():
    if len(set(map(int, input().split()))) == 1:
        return "Yes"
    else:
        return "No"
        

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
a, b, c = list(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:
list_n = list(map(int,input().split()))
list_n.sort(reverse=True)
if list_n[0] == list_n[1] and list_n[1] == list_n[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A, B, C = [int(_) for _ in 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 = input().split()
print("Yes" if a==b==c else "No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if len(set([a,b,c]))==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:
def regular_triangle(A: int, B: int, C: int)->bool:
    return A == B and B == C


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

if A == B and B == C:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
ans='No'

tri = list(map(int, input().split(" ")))
if tri[0] == tri[1] and tri[1] == tri[2]:
    ans = 'Yes'

print(ans)

Submission status: Accepted

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

from collections import deque
import heapq
import math
import bisect


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, raw_input().split())
print "Yes" if A==B==C else "No"

Submission status: Accepted

Solution code:
a,b,c=[int(x) for x in 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())
if A ==B and B == C:
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

if X[0] == X[1] and X[1] == X[2]:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
a, b, c = [int(item) for item in 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()]

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

print(ans)

Submission status: Accepted

Solution code:
s = input().split(" ")

if s[0] == s[1] and s[1] == s[2] :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a, b, c = (int(i) for i in 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 inpl():
    return list(map(int, input().split()))


a, b, c = inpl()

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

Submission status: Accepted

Solution code:
nums = [int(i) for i in input().split()]

if nums[0] > 0 and nums[1] > 0 and nums[2] > 0 and nums[0] == nums[1] and nums[1] == nums[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math

import array
import bisect
import collections
from collections import Counter, defaultdict
import fractions
import heapq
import re

sys.setrecursionlimit(1000000)


def array2d(dim1, dim2, init=None):
    return [[init for _ in range(dim2)] for _ in range(dim1)]

def argsort(l, reverse=False):
    return sorted(range(len(l)), key=lambda i: l[i], reverse=reverse)

def argmin(l):
    return l.index(min(l))

def YESNO(ans, yes="YES", no="NO"):
    print([no, yes][ans])

II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()


def main():
    a, b, c = MI()
    return a == b == c


if __name__ == "__main__":
    YESNO(main(), "Yes", "No")

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

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

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def main():
    A = LI()
    
    return 'Yes' if len(set(A)) == 1 else 'No'


print(main())

Submission status: Accepted

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

if (A == B):
    if (C == B):
        print("Yes")
        exit()
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:
#!/usr/bin/env python3

a, b, c = [int(x) for x in input().split(" ")]
print("Yes" if a == b and b == c else "No")

Submission status: Accepted

Solution code:
inp = [int(i) for i in input().split()]
if inp[0] == inp[1]:
    if inp[1] == inp[2]:
        print('Yes')

    else:
        print('No')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import sys


def solve(a,b,c):
  if a==b and b==c:
    return True
  else:
    return False

a,b,c = map(int, sys.stdin.readline().rstrip().split())
if solve(a,b,c):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(each) for each in input().split()]
if a[0] == a[1] == a[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    A, B, C = [int(x) for x in stdin.readline().rstrip().split()]
    if A == B and B == C:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main ()

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())

A, B, C = tuple(li())
if A == 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:
# coding: utf-8

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

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

Submission status: Accepted

Solution code:
# A
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(x) for x in input().split()]

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

if a[2] == a[0] and a[0] == a[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 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 a == c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

N = [int(i) for i in input().split()]


def ans(N):
    if len(set(N)) != 1:
        print("No")
    else:
        print("Yes")

ans(N)

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:
import sys

stdin = sys.stdin

ni = lambda: int(ns()) #int
na = lambda: list(map(int, stdin.readline().split())) #int,list
ns = lambda: stdin.readline().rstrip()  # str

a,b,c = na()
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:
a = list(map(int, input().split()))
if a[0]==a[1]==a[2] and max(a) < sum(a)-max(a):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Solution code:
# coding: utf-8
# Your code here!

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e7))
from collections import deque
def inpl(): return list(map(int, input().split()))

A, B, C = sorted(inpl())
if A != B or B != C or C != A:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
def gcd_core(a,b):
    if b == 0:
        return a
    else:
        return gcd_core(b,a%b)

def gcd(arr):
    g = gcd_core(arr[0],arr[1])
    for i in range(2,len(arr)):
        g = gcd_core(g,arr[i])
    return g

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

if a[0]==a[1] and a[1]==a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = list(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 c == a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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: 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 = list(map(int,input().split()))
print('Yes' if a == b and a == c else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L=sorted([int(x) for x in input().split()])
if L[0]==L[1] and L[1]==L[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:
import atexit
import io
import sys

buff = io.BytesIO()
sys.stdout = buff


@atexit.register
def write():
    sys.__stdout__.write(buff.getvalue())

l = map(int, raw_input().split())
l.sort()
if l[0] == l[2]:
	print 'Yes'
else:
	print 'No'

Submission status: Accepted

Solution code:
A, B, C = (int(i) for i in 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")
exit(0)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    a,b,c = LI()
    if a == b and b == c:
        print("Yes")
    else:
        print("No")
    return

#B
def B():
    n = I()
    s = S()
    r = s.count("R")
    if r > n//2:
        print("Yes")
    else:
        print("No")
    return

#C
def C():
    n,q = LI()
    s = S()

    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

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

if a == b:
  if b == c:
    print('Yes')
  else:
    print('No')
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:
a,b,c = [int(_) for _ in input().split()]

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c = LI()
    if a == b and b == c:
        print("Yes")
    else:
        print("No")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

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:
from sys import stdin, stdout
from collections import deque

rr = lambda: stdin.readline().strip()
rri = lambda: int(rr())
rrm = lambda: list(map(int, rr().split()))

a, b, c = rrm()
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 == C:
    print("Yes")
else:
    print("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:

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

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

Submission status: Accepted

Solution code:
#coding: utf-8
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=[int(s) for s in input().split()]
print("Yes" if a == b and b == c else "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:
# -*- coding: utf-8 -*-

a = input().split()

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

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

Submission status: Accepted

Solution code:
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq
import itertools
import operator


inf = float('inf')


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types):
    if len(types) == 1:
        return [types[0](input()) for _ in range(n)]
    return zip(*(
        [t(x) for t, x in zip(types, input().split())]
        for _ in range(n)
    ))


# inputs
A, B, C = 0, 0, 0


def set_inputs():
    global A, B, C
    A, B, C = get_li()
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    if A == B and B == C:
        print("Yes")
    else:
        print("No")
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if ls[0] == ls[1] == ls[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:
#coding:utf-8
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:
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math
import collections

A,B,C= map(int, sys.stdin.readline().rstrip().split(" "))
print("Yes" if (A==B and B==C) else "No")
exit(0)

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:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in 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:
print("Yes" if len(set(map(int, input().split()))) == 1 else "No")

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
print("Yes" if A[2]==A[0] and A[1]==A[0] 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:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

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, raw_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())
print('Yes' if (A==B) and (B==C) else 'No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(ABC):
    if ABC[0] == ABC[1] == ABC[2]:
        return 'Yes'
    return 'No'


def main():
    ABC = read_int_n()
    print(slv(ABC))


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:
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# 
# s = input()


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 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:
A, B, C = (int(i) for i in 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 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 = set(map(int,input().split()))
if len(a) == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

f = 'No'

if (A==B)and(C==A):
    f = 'Yes'

print(f)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())

if A == B & B == C:
    print('Yes')
else:
    print('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 and B == C and C == 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:
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 = list(map(int, input().split()))
if a==b==c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
ls = [int(i) for i in input().split()]
if all([i == ls[0] for i in ls]):
  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 -*-
 
a, b,c = map(int,input().split())
 
if a == b == c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = input().split(" ")
a = int(l[0])
b = int(l[1])
c = int(l[2])
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:
#!/usr/bin/python3

import math
import sys


def inp():
    return sys.stdin.readline().rstrip()


def main():
    a, b, c = [int(e) for e in inp().split()]
    print('Yes' if a == b and b == c else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import exit
A,B,C = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
# exit()
print("Yes" if A == B and B == C else "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, B, C = map(int, input().split())
if A == B and C == A:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a=sorted([int(i) for i in input().split()])
print("Yes" if a[0]==a[1]==a[2] else "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問題
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
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [A, B, C] = [int(input_raw[0]), int(input_raw[1]), int(input_raw[2])]
    if A == B and B == C and A == C:
        print "Yes"
    else:
        print "No"

if __name__ == '__main__':
    main()

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

print(ans)

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 re
A, B, C = [int(item) for item in re.split(r"\s", input())]

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

Submission status: Accepted

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