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

Submission status: Accepted

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

ans = 'Yes' if M == N else '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:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


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


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


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


def LIR(n):
	return [LI() for i in range(n)]


def SR(n):
	return [S() for i in range(n)]


def LSR(n):
	return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
	n, m = LI()
	if n == m:
		print('Yes')
	else:
		print('No')
	return


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

Submission status: Accepted

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

    N, M = list(map(int, sys.stdin.buffer.readline().split()))
    print('Yes' if N == M else '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:
n, m = map(int,input().split())

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

Submission status: Accepted

Solution code:
#152_A
n, m = input().split()
print('Yes' if n == m else '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 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:
	answer = "Yes"
else:
	answer = "No"
    
print(answer)

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:
t = input().split()
N = int(t[0])
M = int(t[1])

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if not a - b:
    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:
# coding: utf-8

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n, m = get_ints()
print('Yes' if n == m else '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:
# -*- coding:utf-8 -*-

def solve():
    N, M = list(map(int, input().split()))
    if N == M:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

N, M = map(int, input().split())
# print(N, M)

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

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:
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 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())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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


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

Submission status: Accepted

Solution code:
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]

if Line[0] == Line[1]:
    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:
ii=lambda:int(input())
miis=lambda:map(int,input().split())
lmiis=lambda:list(map(int,input().split()))

n,m=miis()
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')
    

main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np

n,m = map(int, input().split())
# h = int(input())
# h = list(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())
print(["No", "Yes"][n == m])

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def judgement(n, m):
    if n == m:
        return 'Yes'
    else:
        return 'No'

if __name__ == "__main__":
    n, m = input().split(' ')
    print(judgement(n, m))

Submission status: Accepted

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

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, M: int):
    return YES if N == M else NO


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    print(solve(N, M))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("Yes" if eval(input().replace(" ","==")) 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())
if N == M:
		print('Yes')
else:
		print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

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

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

Submission status: Accepted

Solution code:
import math
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=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 = 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())
print("Yes" if m ==n else "No")

Submission status: Accepted

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

print(solve())

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A - AC or WA
n,m=list(map(int,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 M == N:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N ,M= map(int,input().split())
#S = int(input())
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:
a, b = map(int, input().split())

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

Submission status: Accepted

Solution code:
a,b = [int(x) for x in 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 = 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:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

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

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

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 = raw_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:
a,b = 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())

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:
h,n = map(int,input().split())
#li = [int(x) for x in input().split()]

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

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

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 = [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 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 = "Yes" if n == m else "No"
print(ans)

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
ans='Yes'
if N!=M:
  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:
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:
H,A = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import math
# from fractions import gcd

import numpy as np
# import scipy as scp

# 入力の受け取り
n,m = map(int,input().split())

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

print(ans)

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

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
from itertools import permutations, combinations, accumulate
from collections import deque
from heapq import heappush, heappop, heapify
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
MOD = 10**9 + 7

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:
l = input().split()
N = l[0]
M = l[1]
if N == M:
  print("Yes")

else:
  print("No")

Submission status: Accepted

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

def a(b,c):
  if N == M:
    print('Yes')
  else:
    print('No')
  return
 
a(N,M)

Submission status: Accepted

Solution code:
num1, num2 = [ int(i) for i in input().split(" ") ]

if num1 == num2: 
  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=input().split()
print("YNeos"[a!=b::2])

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

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

Submission status: Accepted

Solution code:
N,M=list(map(int,input().split()))
print(["No","Yes"][N==M])

Submission status: Accepted

Solution code:
a,b = input().split()
print('Yes' if a!=0 and a==b 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:
n,m=map(int,input().split())
print("Yes") if n==m else print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
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 = 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 m==n else"No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,m=INTM()
    if n==m:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
N = input().split()
if N[0] == N[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=[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:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import math

#############
# Constants #
#############

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

#############
# Functions #
#############

kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

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

Submission status: Accepted

Solution code:
import sys

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

N, M = 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:
s = input()
a = s.split()
if len(a) != 2:
  print("No")
if a[0] == a[1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys

N, M = sys.stdin.readline().split()
if N == M:
    print("Yes")
else:
    print("No")