Problem:


Score : 100 points

Problem Statement

Takahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.

The problem has N test cases, all of which must be passed to get an AC verdict.

Takahashi's submission has passed M cases out of the N test cases.

Determine whether Takahashi's submission gets an AC.

Constraints

1 \leq N \leq 100

0 \leq M \leq N

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M

Output

If Takahashi's submission gets an AC, print Yes; otherwise, print No.

Sample Input 1

3 3

Sample Output 1

Yes

All three test cases have been passed, so his submission gets an AC.

Sample Input 2

3 2

Sample Output 2

No

Only two out of the three test cases have been passed, so his submission does not get an AC.

Sample Input 3

1 1

Sample Output 3

Yes



Sample input:
3 3


Sample output:
Yes

Submission status: Accepted

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

ans = 'No'

if M == N:
  ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
print('Yes') if n == m else print('No')

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n, m = map(int,input().split())

if n == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n,m=map(int,input('').split(' '))
if m>=n:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n,m = map(int, input().split())

if n == m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n, m = map(int,input().split())
if n == m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n, m = input().split()
print('Yes') if n == m else print('No')

Submission status: Accepted

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

if (n == m):
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

if n == m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
print("YNeos"[N!=M::2])

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
 
print("Yes") if N==M else print("No")

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
print("Yes"if n == m else"No")

Submission status: Accepted

Solution code:
N,M=map(int, input().split())
print('Yes' if N==M else 'No')

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n == m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
m, n = map(int, input().split())
if m == n:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N, M = map(int,input().split())
if N == M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

N,M=list(map(int,input().split()))

print('Yes' if N == M else 'No')

Submission status: Accepted

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

if N==M:
    print('Yes')

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if n[0] == n[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
# from collections import OrderedDict
# d = OrderedDict()
# a = list(input().split())
# b = list(map(int, input().split()))
# print(r + max(0, 100*(10-n)))
# print("Yes" if 500*n >= k else "No") 
# s = input()
# a = int(input())
# b = int(input())
# c = int(input())
print("Yes" if n == k else "No")

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if n==m:
  print("Yes")
else :
  print("No")

Submission status: Accepted

Solution code:
n,m = map(int, input().split(' '))

if m==n:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if N == M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N, M = [int(x) for x in input().split()]

if N == M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def main():
  N,M = map(int, input().split())
  
  if N == M:
    print('Yes')
  else:
    print('No')
  
  
main()

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
if N==M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N,M = map(int, input().split())
if N==M:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

n, m = map(int, input().split())

if n == m: print("Yes")
else: print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

N, M = LI()
if N == M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n, m = input().split()
print("Yes" if n==m else "No")

Submission status: Accepted

Solution code:
N,M=map(int, input().split())
if N == M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n,m = map(int, input().split())
print("Yes") if n == m else print("No")

Submission status: Accepted

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

import io
import sys
import math

def solve():
    # implement process
    pass

def main():
    # input
    m, n = map(int, input().split())
    
    # process
    ans = "Yes" if m == n else "No"
    
    # output
    print(ans)
    return ans
        
### DEBUG I/O ###
_DEB = 0   # 1:ON / 0:OFF

_INPUT = """\
2 3
"""
_EXPECTED = """\
Yes
"""

def logd(str):
    """usage:
    if _DEB: logd(f"{str}")
    """
    if _DEB: print(f"[deb] {str}")

### MAIN ###
if __name__ == "__main__":
    if _DEB:
        sys.stdin = io.StringIO(_INPUT)
        print("!! Debug Mode !!")

    ans = main()

    if _DEB:
        print()
        if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
        else: print(f"!! Failed... !!\nANSWER:   {ans}\nExpected: {_EXPECTED}")

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
if n == m: print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

print('Yes') if n == m else print('No')

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


n,m = map(int, input().split())
if n==m:
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Accepted

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

if(N == M):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, M = map(int, readline().split())
    
    if N == M:
        print('Yes')
    else:
        print('No')
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
if N == M:
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M = (int(x) for x in input().split())
if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    import sys
    sys.setrecursionlimit(10**9)
    input = sys.stdin.readline

    n, m = map(int, input().split())
    if n==m:
        print("Yes")
    else:
        print("No")

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
if N==M: print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    #n = int(stdin.readline().rstrip())
    n,m = map(int, stdin.readline().rstrip().split())
    #l = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    if n==m:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print("YNeos"[eval(input().replace(" ",">"))::2])

Submission status: Accepted

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

if N == M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(int,input().split())

if n==m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = input().split(' ')
m = lst[0]
n = lst[1]

if n==m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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



if x==y:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
(N,M) = map(int,input().split())
if N == M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

n, m = map(int, input().split())

if n == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print("Yes") if N == M else print("No")

Submission status: Accepted

Solution code:
n,m = map(int, input().split())
print("Yes") if n-m==0 else print("No")

Submission status: Accepted

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

if N == M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
from fractions import gcd
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7

ans = 'Yes'
n, m = map(int, input().split())
if n != m:
    ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
N,M =input().split()

N = int(N)

M = int(M)

if N == M:
    print ("Yes")
    
else:
    print ("No")

Submission status: Accepted

Solution code:
n,m=map(int, input().split())

if n==m:
    print('Yes')

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if n==m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
if(N==M):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print('Yes') if N == M else print('No')

Submission status: Accepted

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

if M == N:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n, m = [int(i) for i in input("").split(" ")]
if n == m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print('Yes' if N <= M else 'No')

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
print('Yes' if n==m else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
if M >= N:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
if m >= n:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

print('Yes' if N == M else 'No')

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
if (n == m): print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
n,m = list(map(int, input().split())) 
if n == m :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n, m=map(int, input().split())
if n==m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n,m = map(int, input().split())

fax = m == n

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
 
if n==m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N, M = input().split()
print("Yes" if N == M else "No")

Submission status: Accepted

Solution code:
N,M = input().split()

if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n,m = map(int,input().split())

if n == m:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    N, M = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    if N==M:print('Yes')
    else:print('No')





if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# 152 A

n, m = map(int, input().split())

if n == m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
if M==N:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N,M=input().split()
print('Yes' if int(M)==int(N) else 'No')

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n , m = (int(a) for a in input().split())
if n == m :
    print("Yes")
else : print("No")

Submission status: Accepted

Solution code:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, readline().split())
if N == M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
print('Yes' if n==m else 'No')

Submission status: Accepted

Solution code:
n, m = map(int,input().split())

if n > m:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
n,m = map(int,input().split())

if(n == m):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n == m :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N,M = (int(x) for x in input().split())
if N==M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n <= m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N,M = map(int, input().split())
if N == M:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n,m = input().split()
if n==m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if N <= M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

def fun():
    A = input("")
    return A

N = str(fun()).split(" ")
if (N[0] == N[1]):
    print("Yes")
    
else:
    print("No")

Submission status: Accepted

Solution code:
def solve():
    n, m = map(int, input().split())
    print('YNeos'[n!=m::2])

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n==m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N,M=[int(i) for i in input().split()]
print("Yes" if N<=M else "No")

Submission status: Accepted

Solution code:
n,m = map(int, input().split())
print('Yes') if m == n else print('No')

Submission status: Accepted

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

if N > M:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#<ABC152>
#<A>
N, M = map(int,input().split())
if N == M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = input().split()
if n == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

N,M=nm()
print('Yes' if N==M else 'No')

Submission status: Accepted

Solution code:
n,m = map(int, input().split())

if m == n:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if N==M:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if N == M:
    print("Yes")

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = input().split()
print("Yes" if n == m else "No")

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
print("YNeos"[n != m::2])

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
print('Yes' if N == M else 'No')

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n > m:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
n , m = map(int,input().split())

if n == m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

print('Yes') if N == M else print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print((lambda x:'Yes' if x[0] == x[1] else 'No')(input().split()))

Submission status: Accepted

Solution code:
from sys import stdin

n,m = [int(x) for x in stdin.readline().rstrip().split()]

if n == m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n, m = map(int,input().split())

if n == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
print("Yes" if N == M else "No")

Submission status: Accepted

Solution code:
N,M = map(int, input().split())
if N==M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

print("Yes" if n == m else "No")

Submission status: Accepted

Solution code:
n,m=map(int,input().split());print('YNeos'[n!=m::2])

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    n, m = map(int, input().split())
    if n == m:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
if N==M:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

ans = "No"
if n == m: ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
if N == M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print("Yes" if N==M else "No")

Submission status: Accepted

Solution code:
def main():
    n, m = map(int, input().split())

    if n == m:
        print("Yes")
    else:
        print("No")
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

n, m = list(map(int, input().split()))

if n == m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
print('Yes' if n==m else 'No')

Submission status: Accepted

Solution code:
n, m = map(int,input().split())

if n == m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    N, M = map(int, input().split())

    if N == M:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

if n == m:
	print('Yes')
else:
  	print('No')

Submission status: Accepted

Solution code:
n,m = input().split()

if n == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N, M = map(int, input().split())
    if N == M:
        print("Yes")
        exit(0)
    print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n, m = input().split()
if n == m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n,m = map(int,input().split())

if n==m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if N == M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if n==m:
  print('Yes')
  
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

if n == m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n, m = input().split()
if n == m:
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
N,M=input().split()
N=int(N); M=int(M);
if(N==M):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n, m= map(int, input().split())
if n == m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys
import decimal # 10進法に変換，正確な計算

def input():
    return sys.stdin.readline().strip()

def main():
    n, m = map(int, input().split())
    if n == m:
        print("Yes")
        return
    print("No")
    

main()

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n ==m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

print('Yes' if N == M else 'No')

Submission status: Accepted

Solution code:
l = input().split()
n, m = int(l[0]), int(l[1])
if n==m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
if N == M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, m = map(int, input().split())
if n ==  m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  if num[0]==num[1]:
    print("Yes")
  else:
    print("No")

main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#A
N,M=map(int,input().split())
if N==M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N, M = (int(x) for x in input().split())

print('Yes' if N == M else 'No')

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
if N!=M:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
N,M=input().split()
if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

if n <= m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n,m = map(int, input().split())
if n==m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x, y = input().split()
print('Yes' if x == y else 'No')

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
if N == M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = map(int,input().split())

print('Yes' if n == m else 'No')

Submission status: Accepted

Solution code:
N,M = (int(x) for x in open(0).read().split())
if N != M:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
N,M = map(int, input().split())
print('Yes' if N==M else 'No')

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
if n <= m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

if n==m:
    print("Yes")
else:
    print('No')

Submission status: Accepted

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

if N==M:print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
n, m = input().split()
print('Yes' if n == m else 'No')

Submission status: Accepted

Solution code:
def resolve():
    n, m = list(map(int, input().split()))

    print('Yes' if n == m else 'No')
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print("{}".format("Yes" if N == M else "No"))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    N, M = map(int, readline().split())
    if N == M:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,m = input().split()
print('Yes' if n==m else 'No')

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if n==m:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
if N==M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print('Yes') if N == M else print('No')