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:
# Author: cr4zjh0bp
# Created: Sat Mar  7 13:01:23 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

a, b, c = na()

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:
l=list(map(int,input().split()))
l.sort()
if l[2]==l[1]==l[0]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline

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

Submission status: Accepted

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

print("Yes" if len(s) == 1 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, B, C = map(int, input().split())
print("YNeos"[not(A==B==C)::2])

Submission status: Accepted

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

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:
#!/usr/bin/env python3

a = [int(x) for x in input().split()]
print("Yes" if len(set(a)) == 1 else "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:
#!/usr/bin/env python3
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=map(int,input().split())
f=a==b==c
print("Yes" if f==True 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=len(set(map(int,input().split())))
if 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:
def examA():
    ABC =LI(); ABC.sort()
    if ABC[0]==ABC[-1]:
        print("Yes")
    else:
        print("No")
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
def pin(type=int):
    return map(type,input().split())


A =list(pin())
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==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())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
A, B, C = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
 
input = sys.stdin.readlines()
 
a,b,c = input[0].split()

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

Submission status: Accepted

Solution code:
import sys

sides = sys.stdin.readlines()

a, b, c = sides[0].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())

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

Submission status: Accepted

Solution code:
def main():
    ls = [int(x) for x in input().split()]
    ls = set(ls)
    if len(ls)==1:
        print("Yes")
    else:
        print("No")
            
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=set(map(int,input().split()))
print('YNeos'[len(a)>1::2])

Submission status: Accepted

Solution code:
from sys import stdin

a,b,c = [int(x) for x in stdin.readline().rstrip().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())
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:
A,B,C = map(int,input().split())
print("Yes" if A==B and B==C else "No")

Submission status: Accepted

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


if __name__ == "__main__":
    a, b, c = map(int, input().split())

    main(a, b, c)

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] = list(map(int,input().split()))
print("Yes" if(x==y and y==z) 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 = list(map(int,input().split()))
A=a[0]
B=a[1]
C=a[2]

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

Submission status: Accepted

Solution code:
# 2019/12/19

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())
li=[a,b,c]
li=sorted(li)

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

Submission status: Accepted

Solution code:
a,b,c=input().split()
print("Yes"*(a==b==c)or"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())
print("YNeos"[a!=b or b!=c::2])

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())
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 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==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:
#Regular Triangle
A,B,C = map(int, input().split())
if A == B == C:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a, b, c = list(map(int, readline().split()))
    print("Yes" if a == b == c else "No")


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
A,B,C = (int(i) for i in input().split())
ans = 'Yes' if A == B == C else '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:
A, B, C = map(int, input().split())
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())
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 and B == C and C == A 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:
# エクサウィザーズ 2019: A – Regular Triangle
a, b, c = [int(s) for s 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 == 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==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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a, b, c = list(map(int, input().rstrip('\n').split()))
    print("Yes" if a == b == c else "No")


if __name__ == '__main__':
    slove()

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








if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():

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

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

Submission status: Accepted

Solution code:
print_val = "No"
 
A, B, C = map(int, raw_input().split())

if A == B and B == C:
  print_val = "Yes"

print print_val

Submission status: Accepted

Solution code:
#17:39
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('NYoe s'[A==B==C::2])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

# print(A)
# print(B)
# print(C)

# print(A == B and B == C)

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:
abc = list(map(int, input().split()))
abc.sort()
if abc[2] == abc[0]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#エクサウィザーズ2019 A

import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,c = LI()
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 and b==c 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())
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 = list(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 = [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())

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

Submission status: Accepted

Solution code:
a, b, c = sorted(map(int, input().split()))
print("Yes" if a == c else "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:
# exawizards2019A - Regular Triangle
def main():
    E = set(map(int, input().rstrip().split()))
    print("Yes" if len(E) == 1 else "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:
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(v) for v 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())
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=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 and C == A:
    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 = [int(i) for i in input().split()]
if len(set(a)) == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")


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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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:
A,B,C=map(int,input().split())
ans='Yes' if A==B==C else '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:
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())
d = sorted([a,b,c])
if d[0] == d[2]:
    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 print('No')

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
if i[0] == i[1] == i[2]:
    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:
# -*- coding: utf-8 -*-
"""
A - Regular Triangle
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_a

"""
import sys


def solve(A, B, C):
    if A == B and B == C:
        return 'Yes'
    return 'No'


def main(args):
    A, B, C = map(int, input().split())
    ans = solve(A, B, C)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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==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:
if len(set(list(map(int,input().split())))) == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
print("YNeos"[len(set(map(int,input().split())))>1::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:
x = input()
inputs = x.split()
a, b, c = int(inputs[0]), int(inputs[1]), int(inputs[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

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==a*a*a and a+b+c==3*a:
  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())
if A==B and B==C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Regular Triangle
sides = set(map(int, input().split()))
if len(sides) == 1:
	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 == b:
  print('Yes')
else:
  print('No')

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:
lst = input().split()

cor_lst = sorted(lst)

#print(cor_lst)

if int(cor_lst[0]) == int(cor_lst[1]) and int(cor_lst[0]) == int(cor_lst[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:
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    A, B, C = getIntList()
    d.dmp((A, B, C),'A, B, C')
    if A == B and B == C:
        return 'Yes'
    else:
        return 'No'


ans = prob()
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
A = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().strip().split(" "))
if x == y == z:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
# from math import sqrt, pi, acos, gcd, atan2, cos, sin, factorial, log10
# # from matplotlib import mlab
# # from matplotlib import pylab
# # from decimal import Decimal
# # from random import randint
# # import re
# PEPS = 1e-10
# INF = float('inf')
# 
# 
# def sqr(a):
#     return a * a
# 
# 
# def dist(a, b = (0, 0)):
#     return sqrt(sqr(a[0] - b[0]) + sqr(a[1] - b[1]))
# 
# 
# def s_dist(a, b = (0, 0)):
#     return (sqr(a[0] - b[0]) + sqr(a[1] - b[1]))
# 
# 
# def dist3(a, b = (0, 0, 0)):
#     return sqrt(sqr(a[0] - b[0]) + sqr(a[1] - b[1]) + sqr(a[2] - b[2]))
# 
# 
# def s_dist3(a, b = (0, 0, 0)):
#     return (sqr(a[0] - b[0]) + sqr(a[1] - b[1]) + sqr(a[2] - b[2]))
# 
# 
# def trans(p, al):
#     return (p[0] * cos(al) + p[1] * sin(al), - p[0] * sin(al) + p[1] * cos(al))
# 
# 
# def get_angle(a, b, c):
#     cos_al = (sqr(a) + sqr(b) - sqr(c)) / (2 * a * b)
#     return acos(cos_al)
# 
# 
# def write_float(ans):
#     stdout.write(str('%.13f' % ans) + '\n')
# 
# 
# def get_hight(pt1, pt2, pt3):
#     a = (pt2[0] - pt1[0], pt2[1] - pt1[1])
#     b = (pt3[0] - pt1[0], pt3[1] - pt1[1])
#     return abs(a[0] * b[1] - a[1] * b[0]) / dist(pt1, pt2)
# 
# 
# def get_square(pt1, pt2, pt3):
#     a = (pt2[0] - pt1[0], pt2[1] - pt1[1])
#     b = (pt3[0] - pt2[0], pt3[1] - pt2[1])
#     return (a[0] * b[-1] - a[1] * b[0]) / 2
# 
# 
# def sign(v):
#     if v > 0:
#         return 1
#     elif v < 0:
#         return -1
#     else:
#         return 0
# 
# 
# def inn(pt, triangle):
#     signs = set()
#     signs.add(sign(get_square(triangle[0], triangle[1], pt)))
#     signs.add(sign(get_square(triangle[1], triangle[2], pt)))
#     signs.add(sign(get_square(triangle[2], triangle[0], pt)))
#     return len(signs) == 1
# 
# 
# def inter_in(a, b):
#     return dist((a[0], a[1]), (b[0], b[1])) < a[-1] + b[-1]
# 
# 
# def inter_in3(a, b):
#     return dist3(a[:-1], b[:-1]) < a[-1] + b[-1]
# 
# 
# def shift(what, wth):
#     return (what[0] - wth[0], what[1] - wth[1])
# 

a = list(map(int, stdin.readline().split()))
stdout.write(['No', 'Yes'][a[0] == a[1] == a[2]])

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(i) for i in 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 b==c else "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:
arr = [int(x) for x in input().split()]
print("Yes" if arr[0] == arr[1] and arr[1] == arr[2] 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 = raw_input().split(' ')
a = int(a)
b = int(b)
c = int(c)
if (a == b and b == c):
	print "Yes"
else:
	print "No"