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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import collections
#sys.setrecursionlimit(100000)

#n=int(input())
tmp = input().split()
a,b = list(map(lambda a: int(a), tmp))

if(a==b):
	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:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

#n,m = [int(i) for i in readline().split()]
#d = [int(i) for i in readline().split()]

#n = int(input())
n,m = [int(i) for i in readline().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
input = sys.stdin.readline
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 (m == n):
   print('Yes')
else:
   print('No')

Submission status: Accepted

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

if n == m:
    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:
#!/usr/bin/env python3
import sys

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


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


# 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
    solve(N, M)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

### TESTCASE
test = ""
#test = \
"""
1 1
"""
############
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
####### MAIN

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

Submission status: Accepted

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

[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:
# -*- coding: utf-8 -*-
# abc152/abc152_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

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(item) for item 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())
print("Yes" if n==m 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()
nas = lambda: stdin.readline().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

ABC152A()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
from collections import deque
import numpy as np
import heapq
from heapq import heappush, heappop


#read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

N, M = map(int, input().split())
a = N - M
if N - M > 0:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

Submission status: Accepted

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

n, m = [int(i) for i in input().split()]

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

cond()

Submission status: Accepted

Solution code:
def solve(n, m):
    if n == m:
        return "Yes"
    else:
        return "No"


def main():
    n, m = map(int, input().split())
    res = solve(n, m)
    print(res)


def test():
    assert solve(3, 3) == "Yes"
    assert solve(3, 2) == "No"
    assert solve(1, 1) == "Yes"


if __name__ == "__main__":
    test()
    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=(int(x) for x in input().split())
if n==m:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
import sys
import math

N, M = map(int, sys.stdin.readline().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:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
N, M = [int(i) for i in stdin.readline().rstrip().split()]
if N == M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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):
    print(YES if N == M else NO)


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
    solve(N, M)


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

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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 = 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=list(map(int,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:
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:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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



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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nm = list(map(int, input().split()))
if nm[0]==nm[1]:
  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:
N, M = input().split()
if N==M:
  	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:
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:
if __name__ == '__main__':
    n, m = list(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:
h,w=map(int, input().split())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n, m = LI()
    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:
n, m = [int(el) for el in input().split(" ")]
if n == m:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

#map(int, input().split())

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

    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 = [int(i) for i in input().split()]
if N == M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc149/tasks/abc149_a

# 文字列に分割するならSTR使うだけでOK
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:
x,y=map(int,input().split())
if x<=y:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if nm[0] == nm[1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt
from fractions import gcd

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

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas



N, M = mulinputs()

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Submission status: Accepted

Solution code:
# 2020/01/19
# AtCoder Beginner Contest 152 - A

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

# Calc
if c == d:
    ans = "Yes"
else:
    ans = "No"

# Output
print(ans)

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:
import math
import calendar
import fractions
import itertools

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

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 = input()    
m = n.split()
p = [int(i) for i in m]
if p[0] == p[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:
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from fractions import gcd
import numpy as np
from sys import stdin, stderr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def main():
    N, M = [int(x) for x in input().split()]
    ret = "Yes" if N == M else "No"
    return ret


if __name__ == "__main__":
    print(main())

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:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N,M = inputMap()

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



if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
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 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 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:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline

n, m = [int(item) for item 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:
# ABC 152 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
snm = lambda: map(str, input().split())
nl = lambda: list(map(int, input().split()))
n,m=nm()
if m/n==1.0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

    print(ans)

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
if x==y:
    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 = (int(i) for i in 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:
# -*- coding: utf-8 -*-
n, m = map(int, input().split())
if n == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import bisect

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

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:
#!/usr/bin/env python3
N, M = list(map(int, input().split()))
ans = "Yes" if N == M else "No"

print(ans)

Submission status: Accepted

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

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


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Submission status: Accepted

Solution code:
import sys, re
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,copy
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 LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    n, m = MAP()
    if n > m:
        print('No')
    else:
        print('Yes')


if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
def func():
    return

# n = int(input())
# s = input()
n, m = map(int, input().split())
# a = list(map(int, input().split()))
# a = 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 - AC or WA
N,M = map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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


main()

Submission status: Accepted

Solution code:
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:
    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())
if N is M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    # S = [x for x in sys.stdin.readline().split()][0]  # 文字列 一つ
    # N = [int(x) for x in sys.stdin.readline().split()][0]  # int 一つ
    N, M = [int(x) for x in sys.stdin.readline().split()]  # 複数int
    # grid = [list(sys.stdin.readline().split()[0]) for _ in range(N)]  # 文字列grid
    # grid = [[int(x) for x in sys.stdin.readline().split()]
    #         for _ in range(N)]  # int grid

    logger.debug('{}'.format([]))

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


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3 3"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """3 2"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1 1"""
        output = """Yes"""
        self.assertIO(input, output)