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

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


#mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np


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







if __name__ == "__main__":
	main()

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 = (int(i) for i in 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:

H, W = map(int, input().split())

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    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())
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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from copy import deepcopy
from math import factorial, ceil, floor, gamma, log
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = float('INF')
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7


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

Submission status: Accepted

Solution code:
inpl = lambda: list(map(int,input().split()))
N, M = inpl()
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:
import sys
def input(): return 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:
def main():
    a,b = map(int, input().split())

    if a == b:
        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:
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:
  ans='Yes'
else:
  ans='No'
print(ans)

Submission status: Accepted

Solution code:
import sys

n, m = map(int, sys.stdin.readline().split())

def main():
    return 'Yes' if n == m else ' No'

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

Submission status: Accepted

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

Submission status: Accepted

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

if N == M:
    print(ans)
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:
# coding: utf-8
import re
import math
#import numpy as np

mod=int(10**9+7)

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #n = int(stdin.readline()[:-1])   
    #r = stdin.readline()[:-1]
    #n = int(stdin.readline()[:-1])   
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]
    #a = list(map(int, r.split()))
    a, b = map(int, input().split())
    #a = [int(s[i]) for i in range(1, n+1)]
    #a = [list(map(int, r.split())) for i in range(1,n+1)]

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

    #'Yes', 'No', 'YES', 'NO', ':(', 'Yay!'
    #res = 0
    #a, b = map(int, r.split())
    #print()

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:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys

sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




def main(): #startline--------------------------------------------
   n,m = map(int,input().split())
   print("Yes" if n == m else "No")
    
if __name__ == "__main__":
    main() #endline===============================================

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().strip().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]=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 == 0 else "No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left



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

Submission status: Accepted

Solution code:
# coding: utf-8
a,b = [int(x) for x in input().split(" ")]
if 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:
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:
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 M >= N:
    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 = map(int,input().split())
if M >= N:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
words = lambda t : list(map(t, input().split()))
a,b = words(int)
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:
import sys
def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Accepted

Solution code:

import sys


def solve(inp):
    (N, M) = map(int, inp.readline().strip().split(' '))

    if N == M:
        return "Yes"
    else:
        return "No"


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


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

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

Submission status: Accepted

Solution code:
import sys
N, M = [int(v) for v in input().split()]
if N == M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]


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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

N, M = map(int, read().split())

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

Submission status: Accepted

Solution code:
a,b = [list(map(int, s.split())) for s in open(0)][0]
ans = 'Yes' if a == b else 'No'
print(ans)

Submission status: Accepted

Solution code:
n, m = map(str, 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 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 math
import numpy as np
from fractions import gcd
import fractions
import statistics
import collections
from functools import reduce
import itertools
from collections import defaultdict
import bisect
from fractions import Fraction
 
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 = 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 = [int(n) for n 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 = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import deque
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:
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(["No","Yes"][N==M])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, M):
    return 'Yes' if N == M else 'No'


def main():
    N, M = read_int_n()
    print(slv(N, M))


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

from collections import deque, defaultdict
import itertools as ite
import sys
import math
from decimal import *

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

N, M = map(int, raw_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:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


def MI(): return map(int, input().split())


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


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


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding:utf-8

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:
import sys
n, m = [int(i) for i in sys.stdin.readline().split()]
if n == m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print "Yes" if len(set(raw_input().split()))==1 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:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    n, m = rli()
    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())

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:
from operator import itemgetter
from math import log,ceil

def main():

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

n,m = get_nums_l()

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:
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 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 = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

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

Submission status: Accepted

Solution code:
def examA():
    N, M = LI()
    if N==M:
        print("Yes")
    else:
        print("No")
    return

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

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

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

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

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

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

if __name__ == '__main__':
    examA()

"""

"""

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
ans = "Yes"
if n != m:
    ans = "No"
print(ans)

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 sys

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

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

Submission status: Accepted

Solution code:
inputs = input().split(" ")
n = int(inputs[0])
m = int(inputs[1])
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:
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 math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return map(int, input().split()) #整数map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離

N,M = imn()

if N == M:
    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:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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())
#A =list(map(int,input().split()))
#L = [list(map(str,input().split())) for i in range(N)]

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

ans = 'Yes' if N == M else 'No'

print(ans)

Submission status: Accepted

Solution code:
N,M = [int(n) for n in 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:
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:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

# fact(int)
def fact(n):
  if(n == 1):
    return 1
  else:
    return (n * fact(n - 1))

# gcd(int,int)
def gcd(a,b):
  if a == 0:
    return b
  elif b == 0:
    return a
  else:
    return gcd(b,a % b)

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

# qsort(array[])
def qsort(seq):
  if len(seq) < 2:
    return seq
  else:
    beg, end = 0, len(seq) - 1
    mid = (beg + end) // 2
    smaller = [c for c in seq if seq[mid] > c]
    equal = [c for c in seq if seq[mid] == c]
    larger = [c for c in seq if seq[mid] < c]
    return (qsort(smaller) + equal + qsort(larger)) 

# = map(int, input().split())
# = int(input())
# = raw_input().split()
# = list(int(i) for i in input().split())

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

Submission status: Accepted

Solution code:
import sys


# N, M = map(int, input().split())
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]


def main():
    N, M = map(int, input().split())
    if M >= N:
        ans = 'Yes'
    else:
        ans = 'No'

    print(ans)


if __name__ == '__main__':
    main()