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:
#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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




main()

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print("YNeos"[not(A==B)::2])

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())
print("Yes" if A==B else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 152 A

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

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

N, M = MAP()

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
 


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 collections
import math
import operator as op
from functools import reduce
import numpy as np
import math
import bisect
import heapq


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


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


def get_inputs(cast_func=None):
    if cast_func is None:
        return input().split()
    else:
        return list(map(cast_func, input().split()))


def get_input(cast_func=None):
    if cast_func is None:
        return input()
    else:
        return cast_func(input())


def is_prime(n):
    if n == 1:
        return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return False
    return True


def main():
    N, M = get_inputs(int)
    if N == M:
        print('Yes')
    else:
        print("No")

    return


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

N,M = two_int()

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:
import math
import itertools
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())

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


if __name__ == '__main__':
    main()

# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

Submission status: Accepted

Solution code:
n, h = map(int, input().split())
if n == h:
  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:
import sys
import math
input = sys.stdin.readline


N, M = (int(i) for i in input().split())  
#a = [int(i) for i in input().split()] 
#e = [[int(i) for i in input().split()] for i in range(n)] 

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

n,m = LI()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

b, c = map(int, input().split())
if(b==c):
    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 -*-

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Submission status: Accepted

Solution code:
# coding: utf-8
N,M=map(int,input().split())

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

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	N, M = getlist()
	if N == M:
		print("Yes")
	else:
		print("No")


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

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


main()

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
print("Yes") if x == y 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()))
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:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n,m = LI()

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return [list(map(int, input().split())) for _ in range(n)]


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

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

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0): # 四捨五入
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def round_up(a): # 切り上げ
    return int(a + 0.9)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

if N == M:
  print("Yes")
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 = (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:
    ans = 'Yes'
else:
    ans = 'No'
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:
def main():
    N, M = (int(i) for i in input().split())
    if N == M:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n,m = inpl()
print('Yes' if n==m else '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 sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop

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

N, M = MAP()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

n,m=MAP()

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

else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, raw_input().split())
    if a == b:
        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:
import sys
import fractions
import math
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

Solution code:
# ABC152a


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

    sys.setrecursionlimit(10 ** 6)
    n, m = map(int, input().split())
    if n == m:
        print('Yes')
        exit(0)
    print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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 defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[] for _ in range(num)]
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

N,M = II()
if M==N:
    print('Yes')
else:
    print('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()
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:
from sys import stdin

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

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

Submission status: Accepted

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

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N,M=MI()
    if N==M:
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

# main()
print(main())

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


N, M = list(map(int, sys.stdin.buffer.readline().split()))
ok = N == M
if ok:
    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:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(N: int, M: int):
    if N == M:
        yes()
    else:
        no()
    return


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=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: Runtime Error

Solution code:
N,M=map(int,input())
if(N==M):
  print("AC")
else:
  print("WA")

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
if(n==m):
    print(yes)
else:
    print(no)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
/*
	Created by : imay_10
	" It won't be EASY, but I'll make it "
*/

#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;

// Utility for fast exponentiation
ll mpow(ll a,ll b,ll m){
    ll res=1;
    //a%=m;
    while(b){
    	if(b%2) res=res*a%m;
		a=a*a%m;
		b/=2;
	}
	return res;
}

// Utility for modular inverse
ll inv(ll a,ll m){
	return mpow(a,m-2,m);
}

// Utility for GCD Calculation
ll gcd(ll a,ll b){
	if(b==0) return a;
	return gcd(b,a%b);
}

// Utility for binomial coefficient
ll ncr(ll n,ll k)
{
    if(n<k)
        return 0;
    ll C[n + 1][k + 1];
    ll i,j;
    for(i=0;i<=n;i++){
        for(j=0;j<=min(i,k);j++){
            if (j==0 || j==i)
                C[i][j]=1;
            else
                C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
        }
    }
    return C[n][k];
}

void solve(){
	//code
	int n,m;
	cin>>n>>m;
	if(n==m) cout<<"Yes";
	else cout<<"No";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	
	solve();
 	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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