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 = [int(x) for x in input().split()]

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

Submission status: Accepted

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

if N==W:
  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:
# import itertools
# import math


def solve(N, M):
    return 'Yes' if N == M else 'No'


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

# P = []
# S = []
# for i in range(N):
#     pp, ss  = map(int, input().split())
#     P.append(pp)
#     S.append(ss)

print(solve(N, M))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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] = list(map(int, input().split()))
if N == M:
  ans = 'Yes'
else:
  ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
n, m = raw_input().split(" ")

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = str(input()).split()

# print(a)

if a[0] == a[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 = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
NM = input().split()

if (int(NM[0]) == int(NM[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 = 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:
ab = list(map(int, input().split()))
a = ab[0]
b = ab[1]

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:
def main():
    N, M = map(int, input().split())

    if N is 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:
m,n = map(int,input().split())
if(m == n):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
l = input().split(" ")
n = int(l[0])
m = int(l[1])

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

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, M = lr()

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:
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
input = sys.stdin.readline
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())
if M == N:
  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 = list(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,k,m
n,m=(int(x) for x in input().split())

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

Submission status: Accepted

Solution code:
import queue
import math
import copy
"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""

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

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

Submission status: Accepted

Solution code:
# Your code here!
def pin(type=int):
    return map(type,input().split())
"""    
入力は以下の形式で標準入力から与えられる。

N  #これいるかなぁ
x1　y1 N=0として。
xN　yN
"""
N,M= pin()
if N==M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
''' 
------------------------
author : iiou16
------------------------
'''

def main():
    N, M = list(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,b=map(int,input().split())
print('Yes' if a==b 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 = input().split()
n = int(n)
m = int(m)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = input().split(" ")
if tmp[0] == tmp[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:
a,b=map(int,input().split())
if a-b==0:
  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 = list(map(int,input().split()))

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

Submission status: Accepted

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

print("Yes" if A==B else "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 = input().split()
print('Yes') if n==m else print('No')

Submission status: Accepted

Solution code:
input_line = list(map(int,input().split()))
result = input_line[0] - input_line[1]
if result == 0:
  print('Yes')
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:
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    n, m = LI()
    if n == m:
        print("Yes")
    else:
        print("No")

    return


# B
def B():
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    A()
    return


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s_list = list(map(int, input().split()))
if s_list[0] == s_list[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:
import sys,queue,copy
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')

n,m = inpl()


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

Submission status: Accepted

Solution code:
list=input().split()
if list[0]==list[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 = map(int, input().split())
if N == M:
  print("Yes")
elif N != M:
  print("No")

Submission status: Accepted

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

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

if N == M:
  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:
#
A,B=map(int,input().split())
#print(A,B)

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

Submission status: Accepted

Solution code:

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

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

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("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:
test = input().split(" ")
if int(test[0])== int(test[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:
a,b = ( int(i) for i in input().split())

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

Submission status: Accepted

Solution code:
# coding: utf-8
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(str,input().split())


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

input = list(map(int, input().split()))
N = input[0]
M = input[1]

if N == M:
    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())
if m== n:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if k == x:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if M == N:
  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:
from sys import stdin


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    print('Yes' if N == M else 'No')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
A,B=int(a.split()[0]),int(a.split()[1])

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
line = input().split(" ")
N = int(line[0])
M = int(line[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n, m = [int(v) for v 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("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b = input().split()
a = int(a)
b = int(b)
if a==b:
    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 = list(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 = 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:
def run():
  N, M = map(int, input().split())
  if N == M:
    print('Yes')
  else:
    print('No')
    

if __name__ == '__main__':
  run()

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

print("Yes" if a==b else "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())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]

def main():
    N,M = LI()
    if N==M:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

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 = list(map(int, input().split()))
if n <= m:print("Yes")
else:print("No")

Submission status: Accepted

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

n = int(S[0])
m = int(S[1])

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

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]
if A[0] == A[1]:
    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:
a, b = map(int, input().split())
if b >= a:
  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:
a,b = map(int,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:
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
from pprint import pprint

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

if __name__ == '__main__':
    n, m = map(int, sys.stdin.readline().strip().split(" "))
    solve(n, m)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc152/tasks/abc152_a
# -*- coding: utf-8 -*-
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 M >= N:
    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(i) for i in input().split())

# N = 3
# M = 2

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:
# -*- coding: utf-8 -*-
N,M = map(int, input().split())
if N == M: print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
from sys import stdin

N, M = stdin.readline().rstrip().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:
n, m = map(int, input().split())
print('YNeos'[n!=m::2])

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, nn = map(int, input().split())
if n == nn:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

a=int(s[0])
b=int(s[1])

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

Submission status: Accepted

Solution code:
def iln(): return list(map(int, input().split()))


def solve(N, M):
  print("Yes" if N == M else "No")
  
  
N, M = iln()
solve(N, M)

Submission status: Accepted

Solution code:
m, n = (int(i) for i in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
print("Yes" if M==N else "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:
from sys import stdin
import math

A, B = [int(x) for x in stdin.readline().rstrip().split()]

if A == B:
    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( ))
s = "No"
if n == m:
    s = "Yes"
print(s)

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

if M<N:
  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 = list(map(int,input().split()))
a = N-M
if a==0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = (int(_) for _ in 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:
def main():
    N, M= [int(x) for x in input().split()]
    if N == M:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

a,b = map(int, input().split(' '))

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

Submission status: Accepted

Solution code:
import math
from collections import deque

s=input().split(" ")
a=int(s[0])
b=int(s[1])
if a==b:
    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
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N,M = inpl()
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:
import numpy as np

NM=np.array(input().split(" "))
N=NM[0]
M=NM[1]

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

Submission status: Accepted

Solution code:
n_m = input().split(" ")
if n_m[0] == n_m[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 n==m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")
#logging.disable(logging.CRITICAL)

def main():
    N, M = map(int, input().split())
    logging.info("Hello!")

    if N == M:
        print("Yes")
    else:
        print("No")
        
if __name__ == "__main__":
    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:
#!/usr/bin/env python3
import numpy as np


DEBUG = True
dprint = print if DEBUG else lambda *x : x

N, M = [int(str) for str in input().strip().split()]

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n,m=MI()
    if n==m:print("Yes")
    else:print("No")
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num_s = list(map(int,input().split()))
if num_s[0] == num_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:
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:
if __name__=="__main__":
    n, m = map(int, input().split())
    if n==m:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy

# 最大公約数
def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z

# 幅優先探索(BFS)でスタート座標(x, y)からの最大距離返す
def bfs(SS, x, y, H, W):#入力(座標系(迷路), x, y, xの端, yの端)
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" #探索した場所は探索できないようにする
    for i in range(4): #このforで上下左右を調べてる
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      #print(tempx, tempy, xytuple[2])
      #print(S)
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" #探索した場所は探索できないようにする
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      #print(q)
  return mlength


#X = str(input()).split()
NM = str(input()).split()
N = int(NM[0])
M = int(NM[1])

# S = [[0 for i in range(W)] for j in range(H)]

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

Submission status: Accepted

Solution code:
def main():
    if eval(input().replace(" ","==")):
        print("Yes")
    else:
        print("No")
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

Solution code:
x = input().split()

N = int(x[0])
M = int(x[1])

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

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 152: A (2020/01/19)
N, M = map(int , input().split())
if M == N:
    print('Yes')
else:
    print('No')