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 = (int(z) for z 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 and b == c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


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

a, b, c = map(int, sys.stdin.readline().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, raw_input().strip().split())
if [a, b, c] != [a, a, a]: print "No"
else: print "Yes"

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:
s = set(input().split())
ans = "No"
if len(s) == 1:
    ans = "Yes"

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:
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:
abc = list(map(int, input().split()))
a = abc[0]
b = abc[1]
c = abc[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 and B == C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019/03/30
# エクサウィザーズ 2019 - A

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

# Output
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:
hen = list(map(int,input().split()))
if len(set(hen))==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 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")
	exit()
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 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 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:
A, B, C = map(int,  input().split())
if A == B and B == C:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def getN():
    return int(input())

def getlist():
    return [int(x) for x in input().split()]

nums = getlist()

if nums[0] == nums[1] and nums[1] == nums[2]:
    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 and 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:
def int_raw():
    return int(raw_input())

def ss_raw():
    return raw_input().split()

def ints_raw():
    return map(int, ss_raw())

INF = 1 << 29

a,b,c =ints_raw()
def ans():
    if a==b and b==c:
        return "Yes"
    else:
        return "No"


print ans()

Submission status: Accepted

Solution code:
a,b,c = input().split(" ")
if a == b and c == b and a == 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:
#!/usr/bin/env python
from __future__ import division, print_function

import io
import os
import sys

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from cStringIO import StringIO
    from future_builtins import ascii, filter, hex, map, oct, zip
else:
    from io import BytesIO as StringIO

sys.stdout, stream = io.IOBase(), StringIO()
sys.stdout.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)
sys.stdout.write = stream.write if sys.version_info[0] < 3 else lambda s: stream.write(s.encode())

input, flush = sys.stdin.readline, sys.stdout.flush
input = StringIO(os.read(0, os.fstat(0).st_size)).readline


def main():
    a, b, c = map(int, input().split())
    print('Yes' if a == b == c else '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 =  input().rstrip().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 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 == 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 = list(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:
p = input().split()
if p[0]==p[1]==p[2]:print("Yes")
else:print("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:
# -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache

# 1整数
# n = int(input())

# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce

# N個整数
a, b, c = list(map(int, input().split()))

# 1整数
# n = int(input())

# 空白区切りリスト整数
# b = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys

input = sys.stdin.readline
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 = (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 A == C:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from sys import stdin

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

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

input = lambda: stdin.readline()
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 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:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a,b,c = IL()
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:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = s_inpl()   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = inpl()	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import math
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right
# import numpy as np

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

A, B, C = s_inpl()

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

Submission status: Accepted

Solution code:
# -*- encoding: utf-8 -*-
import sys
import re
import random
import numpy as np
from math import sqrt,log
from fractions import gcd  # python<=3.4
from collections import Counter, defaultdict

MOD=1000000007

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

def read_int():
  return int(raw_input())
# N = read_int()

def read_ints():
  return map(int,raw_input().split())
# a,b,c,d=read_ints()

def read_field():
  return raw_input()

def read_fields():
  return raw_input().split()

def print_array(ar):
  n = len(ar)
  for i in range(n-1):
    print ar[i],
  print ar[-1]

def say_bool(val, strs=['Yes','No']):
  print strs[int(val)]

def solve(N):
   return True

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
# import numpy as np

s_in = lambda: stdin.readline()[:-1]  # s = s_in()
d_in = lambda: int(stdin.readline())  # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split()))  # List = ds_in()


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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()));a.sort();print("Yes"if a[0]==a[2]else"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 = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
# encoding: utf-8
import sys
input = sys.stdin.readline

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())

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

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

Submission status: Accepted

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

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:
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 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:
    re = 'Yes'
else:
    re = 'No'
    
print(re)

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, raw_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:
#!/usr/bin/env python3
import os
import sys
from io import BytesIO, IOBase

sys.stdout, stream = IOBase(), BytesIO()
sys.stdout.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)
sys.stdout.write = lambda s: stream.write(s.encode())

input = BytesIO(os.read(0, os.fstat(0).st_size)).readline


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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
A, B, C = tuple(map(int, input().split(" ")))
print("Yes" if A==B and B==C and A==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, raw_input().split())
if A==B==C:
  print "Yes"
else:
  print "No"

Submission status: Accepted

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

a,b,c = map(int,input().split())
if a == b:
    if b == c:
        print('Yes')
        exit()
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:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

A, B, C = 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 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:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
from operator import itemgetter
#以下てんぷら
def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())
def printrow(a):
    for i in range(len(a)):
        print(a[i])
#n = ip()                                     #入力整数1つ
a,b,c= (int(i) for i in input().split())       #入力整数横2つ以上
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)
#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
#こっから本文
if a == b and b==c:j(1)
j(0)

Submission status: Accepted

Solution code:
#exawizards2019-A
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
a,b,c=IL()
if a==b and b==c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

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

Submission status: Accepted

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

print(solve())

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 math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    a = sorted(LI())
    if a[-1] == a[0]:
        return 'Yes'

    return 'No'


print(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:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18


A,B,C=rl()
yn(A==B and B==C)

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:
#!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()

    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())
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: Judge Not Available

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

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = int(input())

s = list(input())

r = s.count('R')
b = s.count('B')

if r > b:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
s=input()
r=s.count("R")
b=s.count("B")
if r>b:print("Yes")
else:print("No")

Submission status: Runtime Error

Solution code:
def cmb(n, r):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

mod = 10**9+7 #出力の制限
N = 2*10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

for i in range( 2, N + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )

b,w=map(int,input().split())
x=0
y=0
for i in range(1,b+w+1):
  x=(x*2+cmb(i-2,b-1))%mod
  y=(y*2+cmb(i-2,w-1))%mod
  print((mod+pow(2,i-1,mod)-x+y)*pow(pow(2,i,mod),mod-2,mod)%mod)

Submission status: Runtime Error

Solution code:
n, q = map(int, input().split())
s = input()
t = [None] * q
d = [None] * q
for i in range(q):
    t[i], d[i] = input().split()
l, r = 0, n + 1
while r - l > 1:
    m = (l + r) // 2
    c = m - 1
    for i in range(q):
        if s[c] == t[i]:
            if d[i] == 'L':
                c -= 1
            else:
                c += 1
        if c < 0:
            l = m
            break
    else:
        r = m
a = l
l, r = 0, n + 1
while r - l > 1:
    m = (l + r) // 2
    c = m - 1
    for i in range(q):
        if s[c] == t[i]:
            if d[i] == 'L':
                c -= 1
            else:
                c += 1
        if c >= n:
            r = m
            break
    else:
        l = m
b = n - l
print(max(0, n - a - b))

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
P = S.replace("B","")
if N%2 == 1:
  k = N//2+1
else:
  k = N//2
if len(P)>k:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import numpy as np
#n = int(input())
#s = input()
n,x = map(int,input().split())
da = list(map(int,input().split()))
m = 100010
mod = 1000000007

dp = [0]*m
da.sort()
da.reverse()
dp[x] = 1
for i in range(n):
    for j in range(m):
        if j >= da[i]:
            dp[j%da[i]] += dp[j]
            dp[j] *= n-i-1
            if dp[j] >= mod: dp[j] %= mod
            if dp[j%da[i]] >= mod: dp[j] %= mod
        else:
            dp[j] *= n-i
            if dp[j] >= mod: dp[j]%=mod
ans = 0
for i in range(m):
    ans += dp[i] * i
    if ans >= mod: ans %= mod
print(ans)

Submission status: Runtime Error

Solution code:
from sys import stdin

sides = stdin.read().split()

if sides[0] == sides[1] == sides[2]:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

num = input("")
RorB = input("")
Rnum = 0

for char in RorB:
    if char == "R":
        Rnum += 1

if int(Rnum) > int(num) - int(Rnum):
    print("Yes")

else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys
input_list = sys.stdin.readlines() 
N, s = map(str.strip, input_list)
red_hat_counter = 0
for s_str in s:
  if s_str == "R":
    red_hat_counter += 1

if red_hat_counter > (int(N)%2):
  print "Yes"
else:
  print "No"

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print_val = "False"

A,B,C = map(int, input().split())
if A == B and B == C:
  print_val = "True"
print print_val

Submission status: Runtime Error

Solution code:
def is_value_validated(number):
  is_validated = False

  if type(number) !== "number":
    return retrun_value
  retrun_value = True
  return retrun_value

def is_triangle_exist(A, B, C):
  printed_value = "No"
  if is_value_validated(A) or \
    is_value_validated(B) or \
    is_value_validated(C):
    print printed_value
    return -1

  if A==B and B==C:
    printed_value = "Yes"
  print printed_value

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(input())
r, b = 0, 0

for i in range(n):
  if s[i] == "R": r++
  if s[i] == "B": b++
    
if r > b: print("Yes")
if r < b: print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, Q = map(int, input().split())
S = input()
TX = [list(input().split()) for _ in range(Q)]
def checkl(i):
    for t, x in TX:
        if S[i] == t:
            i += 1 if x == 'R' else -1
        if i < 0:
            return False
        if i == N:
            i = N - 1
    return True
def checkr(i):
    for t, x in TX:
        if S[i] == t:
            i += 1 if x == 'R' else -1
        if i > N - 1:
            return False
        if i == -1:
            i = 0
    return True

ok = N
ng = -1
while abs(ok - ng) > 1:
    med = (ok + ng)//2
    if checkl(med):
        ok = med
    else:
        ng = med
L = ok
ok = -1
ng = N
while abs(ok - ng) > 1:
    med = (ok + ng)//2
    if checkr(med):
        ok = med
    else:
        ng = med
R = ok
print(max(0, R - L + 1))