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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

    print(ans)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


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


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


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = 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 = 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:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

H, M = map(int, next(sys.stdin.buffer).split())
print('Yes' if H == 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=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:
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:
#template
def inputlist(): return [int(j) for j in input().split()]
#template
N,M = inputlist()
if N== M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n,m = inpm()

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

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

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

Submission status: Accepted

Solution code:
N, M = [int(s) for s in input().split()]
print('Yes' if N==M else '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:
a,b = input().split(' ')
print('Yes' if a == b else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, M: int):
    return [NO, YES][N == M]


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    print(f'{solve(N, M)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# AC or WA
N, M = map(int, input().split())
print(['No', 'Yes'][N == M])

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

Submission status: Accepted

Solution code:
"""
input(): 入力を文字列として1行取ってくる
"文字列".split(): 文字列をパースする（空白などで分割する）
    例："2 3 4 5"　をsplitしたら、[2, 3, 4, 5] に分割する
map(型, list): list の中身をそれぞれ指定した型で変数に入れる
"""
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:
a, b = map(int, input().split())

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

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

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

Submission status: Accepted

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

if '__main__' == __name__:
    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 = map(int, input().split())

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

Submission status: Accepted

Solution code:
A,B=map(int, input().split())
print("Yes") if A==B else 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=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:
def solve():
    N,M = [int(i) for i in 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())
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:
def main():

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = 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 = 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:
# -*- coding: utf-8 -*-

def main():

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

    if N == M:
        ans = 'Yes'

    else:
        ans = 'No'

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def ac_or_wa():
    # 入力
    N, M = map(int, input().split())
    # 処理
    if N == M:
        return 'Yes'
    else:
        return 'No'

result = ac_or_wa()
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = (int(x) for x in input().split())

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

Submission status: Accepted

Solution code:
n,m=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:
tmp = input().split(" ")

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Submission status: Accepted

Solution code:
# !/usr/nbin/python3

"""
https://atcoder.jp/contests/abc152/tasks/abc152_a
AC or WA.
"""

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

if __name__ == "__main__":
    n, m = list(map(int, input().split()))

    solve(n, m)

Submission status: Accepted

Solution code:
# abc152_a.py
# https://atcoder.jp/contests/abc152/tasks/abc152_a

# A - AC or WA /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 高橋君は、プログラミングコンテスト AXC001 に参加しており、問題 A にコードを提出しました。
# この問題には N個のテストケースがあり、すべてのテストケースに正解した場合のみ提出は AC となります。
# 高橋君の提出は、N 個のテストケースのうち M個のテストケースに正解しました。
# 高橋君の提出が AC となるか判定してください。

# 制約
#     1≤N≤100
#     0≤M≤N
#     入力はすべて整数である。

# 入力
# 入力は以下の形式で標準入力から与えられる。
# N M

# 出力
# 高橋君の提出が AC となる場合は Yes, そうでない場合は No と出力せよ。

# 入力例 1
# 3 3

# 出力例 1
# Yes

# 3つのテストケースすべてに正解したので、AC となります。

# 入力例 2
# 3 2

# 出力例 2
# No

# 3つのテストケース中 2つしか正解できなかったので、AC となりません。

# 入力例 3
# 1 1

# 出力例 3
# Yes


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    if N == M:
        result = 'Yes'
    else:
        result = 'No'

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['3 3']
        lines_export = ['Yes']
    if pattern == 2:
        lines_input = ['3 2']
        lines_export = ['No']
    if pattern == 3:
        lines_input = ['1 1']
        lines_export = ['Yes']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
INPUT = list(input().split())
a = int(INPUT[0])
b = int(INPUT[1])

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:
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))


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

Submission status: Accepted

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

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

elif n > m:
    print('No')

Submission status: Accepted

Solution code:
N,M=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 = 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:
#!/usr/bin/env python3
import collections as cl
import sys


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


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    n, m = MI()

    print("Yes" if n == m 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 = 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=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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n,m = map(int, input().split())

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

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())
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=input().split();print('NYoe s'[n==m::2])

Submission status: Accepted

Solution code:
print('NYoe s'[len(set(map(int,input().split())))==1::2])

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 bisect,collections,copy,heapq,itertools,math,string
import numpy as np
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# N =I()
N,M= LI()
#AB = [LI() for _ in range(N)]
#A,B = zip(*AB)
#Ap = np.array(A)
#C = np.zeros(N + 1)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if not ( 1 <= N <= 100 and 0 <= M <= N ): sys.exit()
print('Yes') if N == M else print('No')

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc155/tasks/abc152_a

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n , m = 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( 'No' if M < N else 'Yes')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N,M=input().split()
print('NYoe s'[N==M::2])

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:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


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