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

Solution code:
def factorization(n) -> list:
    arr = []
    temp = n
    for i in range(2, int(- (- n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])
        if temp != 1:
            arr.append([temp, 1])
        if arr == []:
            arr.append([n, 1])
        return arr
      
print(factrization(24))

Submission status: Runtime Error

Solution code:
print 'yes' if input()==input() else 'no'

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

dic = {}
for i in range(1,10):
  for j in range(1,10):
    dic[(str(i),str(j))] = 0

for i in range(N):
  nstr = str(i)
  pre = nstr[0]
  suf = nstr[-1]
  if suf == '0':
    continue
  dic[(pre, suf)] =dic[(pre, suf)] + 1

cnt = 0 
for i in range(1,10):
  for j in range(1,10):
    cnt += dic[(str(i),str(j))] * dic[(str(j),str(i))]

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H, A = map(int, input().split())

if (H % A) == 0:
    print(H // A)
else:
    print(H // A + 1)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N,M=int(input())

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

Submission status: Runtime Error

Solution code:

test_passed = int(input())
test_all_cnt = int(input())


print("Yes" if test_passed == test_all_cnt else "No")

Submission status: Runtime Error

Solution code:
import sys
 
if sys.argv[1] == sys.argv[2]:
  return "Yes"
 
return "No"

Submission status: Runtime Error

Solution code:
import os

if os.argv[1] == os.argv[2]:
  return "Yes"

return "No"

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

N = int(input())
AB = [list(map(int, input().split)) for _ in range(N - 1)]

graph = [[] for _ in range(N + 1)]
for a, b in AB:
    graph[a].append(b)
    graph[b].append(a)
  
def make_tree(graph, root) -> (list, list, list):
    INF = 10 ** 15
    dist = [INF] * len(graph)
    parent = [-1] * len(graph)
    stack = [root]
    dist[root] = 0
    order = []
    parent[root] = root
    while stack:
        s = stack.pop()
        order.append(s)
        for g in graph[s]:
            if dist[g] > dist[s] + 1:
                dist[g] = dist[s] + 1
                parent[g] = s
                stack.append(g)
    return dist, parent, order
  
def lca(u, v, dist, parent):
    distu, distv = dist[u], dist[v]
    if distu > distv:
        for _ in range(distu - distv):
            u = parent[u]
    if distv > distu:
        for _ in range(distv - distu):
            v = parent[v]
    while u != v:
        u, v = parent[u], parent[v]
    return u

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

n = args[1]
m = args[2]

if n == m:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

n = args[1]
m = args[2]

if n == m:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
from fractions import gcd

l = a[0]
for i in range(1,n):
  l = l*a[i]//gcd(l,a[i])

ans = 0
for i in range(n):
  ans += l//a[i]

print(ans%mod)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
from fractions import gcd
def lcm(x,y):
  return (x*y)//gcd(x,y)
l = 1
mod = 10**9+7
for i in range(n):
  l = lcm(l, a[i])
ans = 0
for i in range(n):
  ans += l // a[i]
print(ans%mod)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
from fractions import gcd
def lcm(x,y):
  return (x*y)//gcd(x,y)
l = 1
mod = 10**9+7
for i in range(n):
  l = lcm(l, a[i])
ans = 0
for i in range(n):
  ans += l // a[i]
  ans %= mod
print(ans)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
from fractions import gcd
def lcm(x,y):
  return (x*y)//gcd(x,y)
l = 1
mod = 10**9+7
for i in range(n):
  l = lcm(l, a[i])
l %= mod
ans = 0
for i in range(n):
  ans += l // a[i]
  ans %= mod
print(ans)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
from fractions import gcd
def lcm(x,y):
  return (x*y)//gcd(x,y)
l = 1
mod = 10**9+7
for i in range(n):
  l = lcm(l, a) % mod
ans = 0
for i in range(n):
  ans += l // a[i]
  ans %= mod
print(ans)

Submission status: Runtime Error

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

cnt = 1
min_p = p[0]

if n == 1:
    print(n)
else:
    for i in range(1, n):
        if p[i] < min_p:
            min_p = p[i]
            cnt += 1
    print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n ,m = int(input())

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

Submission status: Runtime Error

Solution code:
import sys
readline = sys.stdin.buffer.readline
N=int(readline().strip())
n=[str(i) for i in range(1,N+1)]
cnt=0
for i in n:
  for j in n:
    if i[0]==j[-1] and i[-1]==j[0]:
      cnt+=1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

c = 0
for i in range(N):
    flag = 1
    for j in range(i):
        if P[j] < P[i]: 
            flag = 0 
            break
    if flag > 0:
        c += 1

print(c)

Submission status: Runtime Error

Solution code:
N = int(input())
M = int(input())

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

Submission status: Runtime Error

Solution code:
N = input();
M = input();

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

Submission status: Runtime Error

Solution code:
N=int(input())
permu = list(map(int,input().split()))
cnt=0
for index,num in enumerate(permu):
    if num <= min(permu[:index+1]):
        cnt+=1
    
    else:
        continue
print(cnt)

Submission status: Runtime Error

Solution code:

a,b = map(int,input().split())

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

Submission status: Runtime Error

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

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:
a, b=input().split()
 
print(min(a＊(int(b)),b＊(int(a) ) )

Submission status: Runtime Error

Solution code:
a, b=input().split()
 
print(min(a*(int(b)),b*(int(a) ) )

Submission status: Runtime Error

Solution code:
a,b=input().split()
 
print(min(a*int(b),b*(int(a) ) )

Submission status: Runtime Error

Solution code:
a,b=input().split()
print(min(a*int(b),b*(int(a)))

Submission status: Runtime Error

Solution code:
def main(length_num,num_list):
    count_num = 0
    for i in range(0,length_num):
        flag_tag = True
        for j in range(0 , i ):
          if int(num_list[i]) >= int(num_list[j]):
              flag_tag = False
              break
        if flag_tag != False:
            count_num += 1
    return count_num


    
if __name__ == "__main__":
    input_length_num = int(input())
    input_num2 = input()
    input_num_list = input_num2.split()
    print(main(length_num,num_list))

Submission status: Runtime Error

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

m=2*(10**5)+1
count = 0
for i in range(0, n):
  if p[i] <= m:
    m = p[i]
    count = count + 1

print(count)

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:
def AC(N,M):
  if N = M:
    return ('Yes')
  else:
    return ('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>

using namespace std;


int main() {
	int n, m;
	cin >> n >> m;
	if (n == m)
		cout << "Yes";
	else
		cout << "No";
	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
def main(test_case,clear_case):
    if test_case <= clear_case:
      return "Yes"
    else:
      return "No"
    
if __name__ == "__main__":
    input_num = input()
    int(num1) = input_num.split()[0]
    int(num2) = input_num.split()[1]
    print(main(num1,num2))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin
n,m = map(int,stdin.readline().split()
print("Yes" if n==m else "No")

Submission status: Runtime Error

Solution code:
input_num = input()
numbers = input_num.sprit(" ")
if(numbers[0] == numbers[1]):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
def ac(m,n):
  if m==n:
    return 'YES'
  else:
    return 'NO'
  
m,n=map(int,imput().split())
ac(m,n)

Submission status: Runtime Error

Solution code:
from fractions import gcd
from functools import reduce


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

N=int(input())
A=list(map(int,input().split()))

l=reduce(lcm,A)
    
ans=0
for i in range(N):
    ans+=l//A[i]

print(ans%(10**9+7))

Submission status: Runtime Error

Solution code:
x = input().split()
n = 0
for i in range(1,int(x[0])+1):
    l = 0
    for j in range(1,i+1):
               if x[i] <= x[j]:
                    l += 1
    if l == i:
        n += 1
print(n)

Submission status: Runtime Error

Solution code:
import sys
from io import StringIO
import unittest

def resolve():
    N = int(input())
    P = list(map(int, input().split()))
    m = P[0];
    cnt = 0;
    for p in P:
        if(p <= m) :
            m = p
            cnt = cnt + 1

    print(cnt)
    
resolve()

Submission status: Runtime Error

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

Min=P[0]
ans=1

for i in range(1,N):
    if Min>=P[i]:
        ans+=1
        Min=P[i]
    
print(ans)

Submission status: Runtime Error

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

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:
from functools import reduce
from fractions import gcd

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

def lcm_list(l):
    lcm = l[0]
    for i in range(len(l)):
        lcm = lcm*l[i] // gcd(lcm, l[i])
    return lcm

mod = 10**9 + 7
n = int(input())
As = list(map(int, input().split()))

lcm = lcm_list(As)
b = [lcm//As[i] for i in range(n)]

print(sum(b) % mod)

Submission status: Runtime Error

Solution code:
def resolve():
    import fractions
    n=int(input())
    a=[int(i) for i in input().split()]
    g=1
    dx=fractions.gcd
    for i in a:
        g*=i//dx(g,i)
    suml=0
    mod=10**9+7
    for i in a:
        suml+=g*pow(i,mod-2,mod)
        suml%=mod
    print(suml)
resolve()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
list = [int(i) for i in input().split()]
a = 0

for i in range(N):
  if min(list[:i+1]) >= list[i]:
    a += 1
    
print(a)

Submission status: Runtime Error

Solution code:
[N]=list(map(int, input().split()))
A=list(map(int, input().split()))
c=0
for i in range (0,N):
    B=sorted(A[0:i+1],reverse=True)
    if B[i] == A[i]:
        c=c+1
print(c)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

cnt = 0
for i in range(N):
    Flg = True
    for j in range(i):
        if P[j] < P[i]:
            Flg = False
            break
    if Flg:
        cnt += 1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Cor = N-M
if Cor == 0:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

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

Cor = N-M
if Cor == N:
    print("yes")
else:
    print("no")

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:
i = input()
a,b = list(map(int, i.split()))

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

Submission status: Runtime Error

Solution code:
a = input()

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

Submission status: Runtime Error

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

if M == N:
  print(Yes)

else:
  print(No)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

#整数値入力 1文字の入力
def input_one_number():
    return int(input())

#整数値龍力　複数の入力
def input_multiple_number():
    return map(int, input().split())

#整数値龍力　複数の入力(配列)
def input_multiple_number_as_list():
    return list(map(int, input().split()))



#複数の最小公倍数
def calc_lcm_list(l):
    lcm = l[0]
    for i in range(1, N):
        lcm = lcm * l[i] // fractions.gcd(lcm, l[i])
    return lcm


import fractions
N = input_one_number()
lstA = input_multiple_number_as_list()

gcd = calc_lcm_list(lstA)

ans = 0
for a in lstA:
    ans += (gcd // a)

print(ans % 1000000007)

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    cout << ((n == m)?"Yes":"No") << endl;
}

Submission status: Runtime Error

Solution code:
graph = [[] for _ in range(N + 1)]
for a, b in AB:
  graph[a].append(b)
  graph[b].append(a)
  
def make_tree(graph, root) -> (list, list):
  INF = 10 ** 15
  dist = [INF] * len(graph)
  parent = [-1] * len(graph)
  stack = [root]
  dist[root] = 0
  parent[root] = root
  while stack:
    s = stack.pop()
    for g in graph[s]:
      if dist[g] > dist[s] + 1:
        dist[g] = dist[s] + 1
        parent[g] = s
        stack.append(g)
  return dist, parent
 
def lca(u, v, dist, parent):
  distu, distv = dist[u], dist[v]
  if distu > distv:
    for _ in range(distu - distv):
      u = parent[u]
  if distv > distu:
    for _ in range(distv - distu):
      v = parent[v]
  while u != v:
    u, v = parent[u], parent[v]
  return u

#root = 1
#dist, parent = make_tree(graph, root)
#print("dist:", dist[1:])
#print("parent:", parent[1:])

Submission status: Runtime Error

Solution code:
graph = [[] for _ in range(N + 1)]
for a, b in AB:
  graph[a].append(b)
  graph[b].append(a)
  
def make_tree(graph, root) -> (list, list):
  INF = 10 ** 15
  dist = [INF] * len(graph)
  parent = [-1] * len(graph)
  stack = [root]
  dist[root] = 0
  parent[root] = root
  while stack:
    s = stack.pop()
    for g in graph[s]:
      if dist[g] > dist[s] + 1:
        dist[g] = dist[s] + 1
        parent[g] = s
        stack.append(g)
  return dist, parent
 
def lca(u, v, dist, parent):
  distu, distv = dist[u], dist[v]
  if distu > distv:
    for _ in range(distu - distv):
      u = parent[u]
  if distv > distu:
    for _ in range(distv - distu):
      v = parent[v]
  while u != v:
    u, v = parent[u], parent[v]
  return u

# root = 1
# dist, parent = make_tree(graph, root)
# print("dist:", dist[1:])
# print("parent:", parent[1:])

Submission status: Runtime Error

Solution code:
graph = [[] for _ in range(N + 1)]
for a, b in AB:
  graph[a].append(b)
  graph[b].append(a)
  
def make_tree(graph, root) -> list, list:
  INF = 10 ** 15
  dist = [INF] * len(graph)
  parent = [-1] * len(graph)
  stack = [root]
  dist[root] = 0
  parent[root] = root
  while stack:
    s = stack.pop()
    for g in graph[s]:
      if dist[g] > dist[s] + 1:
        dist[g] = dist[s] + 1
        parent[g] = s
        stack.append(g)
  return dist, parent
 
def lca(u, v, dist, parent):
  distu, distv = dist[u], dist[v]
  if distu > distv:
    for _ in range(distu - distv):
      u = parent[u]
  if distv > distu:
    for _ in range(distv - distu):
      v = parent[v]
  while u != v:
    u, v = parent[u], parent[v]
  return u

# root = 1
# dist, parent = make_tree(graph, root)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
num1, num2 = [int(i) for i in input().split()]
if num1 == num2
    print('Yes')
else
    print('No')

Submission status: Runtime Error

Solution code:
import sys

num1, num2 = [int(i) for i in input().split()]
if (num1 = num2){
    print('Yes')
}else{
    print('No')
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

j = p[0]
count = 0
for i in range(n):
    if p[i] <= j:
        count += 1
        j = p[i]
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
p = input().split()

j = p[0]
count = 1
for i in range(n):
    if p[i] <= j:
        count += 1
        j = p[i]
print(count)

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 = int(input())
P = list(map(int, input().split()))
a=1
i=0
b=P[0]
while i != N:
    if P[i] <= b:
        a+=1
        b=P[i]
    i+=1
print(a)

Submission status: Runtime Error

Solution code:
N = int(input())
P = list(map(int, input().split()))
a=1
i=0
b=p[0]
while i != N:
    if P[i] <= b:
        a+=1
        b=b[i]
    i+=1
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = [int(i) for i in input().split()]
if a[0] == a[1]:
  print('Yes')
else
  print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
line = list(map(int,input().split()))
a = 0
p = []
for i in line:
    p.append(i)
    m = min(p)
    if m >= i:
       a += 1

print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N M = list(input())
N = int(N)
M = int(M)

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

Submission status: Runtime Error

Solution code:
#E - Flatten
import sys
sys.setrecursionlimit(10**6)
N = int(input())
A = [int(i) for i in input().split()]
def lcm(a):
    from fractions import gcd
    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]) // gcd(x, a[i])
    return x
A_lcm = lcm(A)
cnt = 0
for i in range(N):
    cnt += A_lcm/A[i]
print(int(cnt%(10**9+7)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def read_ints(row):
    return list(map(int, row().split()))
  
row = stdin.readline
N,M = read_ints(row)
print(N == M)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
arr = [0]*100
for num in range(1,N):
  arr[int(str(num)[0]+str(num)[-1])] += 1
print(sum([arr[i*10+j]*arr[j*10+i]  for i in range(10) for j in range(10)]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input().split()
n = s[0]
m = s[1]
if (1<=n && n<=100 && 0<=m && m<=n):
  if (isinstance(n, int) && isinstance(m, int)):
    print(Yes)
  else:
    print(No)
else:
  print(No)

Submission status: Runtime Error

Solution code:
N = int(input())
sta = list(map(int, input().split()))
sta2 = []

count_i = 0
for i in sta:
    sta2.append(i)
    if i <= min(sta2):
        count_i += 1

print(count_i)

Submission status: Runtime Error

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

if a = b:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
P_list=list(map(int, input().split()))
#print(P_list)
count=0
while P_list!=[]:
    minindex=P_list.index(min(P_list))
    P_list=P_list[0:minindex]
    count+=1
    
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from typing import List


class Solution:
    def solve(self, N: int, M: int) -> str:
        if N == M:
            return 'Yes'
        else:
            return 'No'


if __name__ == '__main__':

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

    # solve
    solution = Solution()
    print(solution.solve(N, M))

Submission status: Runtime Error

Solution code:
if M == N
	return 'YES'
else
	return 'NO'

Submission status: Runtime Error

Solution code:
import math
N = int(input())
ans = 0
for i in range(1,10):
    for j in range(1,10):
        c1 = 0
        c2 = 0
        for x in range(1,N+1):
            d = 10 ** int(math.log10(x)) 
        
            if x % 10 == i and x // d == j:
                c1 += 1
            if x % 10 == j and x // d == i:
                c2 += 1
        ans += c1 * c2

print (ans)

Submission status: Runtime Error

Solution code:
n = input()
m = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
/* 
****	
	AUTHOR :- @soham01 
****
*/
#include "bits/stdc++.h"
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	long long int n,m;
  cin>>n>>m;
  if(m==n)cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
	return 0;
}

Submission status: Runtime Error

Solution code:
#include <stdio.h>

int main()
{
  int n, m;
  
  scanf("%d", &n);
  scanf("%d", &m);
  
  if (n == m)
  	printf("Yes\n");
  else
    printf("No\n");
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
if A == B:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
typedef long long llong;
char moji[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
char moji2[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
char moji3[10]={'0','1','2','3','4','5','6','7','8','9'};
#define Sort(a) sort(a.begin(),a.end());
#define Reverse(a) reverse(a.begin(),a.end());
#define print(a) cout << a << endl;
#define MOD llong(1e9+7)
#define MAX int(2 * 1e5 +5)
#define debug(x)  cout << #x << " = " << (x) << endl;
#define pi acos(-1.0)
#define int llong
#define INF llong(1e18 + 3)
template<class T> bool chmax(T &a,  T b) {if(a<b){a=b; return 1;} return 0;}
template<class T> bool chmin(T &a,  T b) {if(a>b){a=b; return 1;} return 0;}
bool Add(int &a,int b){a = (a + b) % MOD;}
void myprint(int* A,int A_num){
   REP(i,A_num) cout << A[i] << " ";
   cout << endl;
}

signed main(){
    int a,b;
    cin >> a >> b;
    if(a == b){
        cout << "Yes" << endl;
    }
    else cout << "No" << endl;

}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = input()
B = input()
if A == B:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
if A == B:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print("{} {}".format( a + b + c, s))

Submission status: Runtime Error

Solution code:
n = int(input())
m = int(input())

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