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:
import sys
import itertools
import functools
from math import gcd


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


def lcm(x):
    return functools.reduce(lcm2, x)


def resolve(in_):
    N = int(next(in_))
    A = tuple(map(int, next(in_).split()))
    a_lcm = lcm(A)

    mod = 10 ** 9 + 7

    ans = 0
    for a in A:
        ans += a_lcm // a
        ans %= mod
            
    return ans


def main():
    answer = resolve(sys.stdin.buffer)
    print(answer)


if __name__ == '__main__':
    main()

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:
N=int(input("enter 1st number:"))
M=int(input("enter 2nd number:"))
if N==M:
    print("Yes\n")
else:
    print("No\n")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
if(n==m):
	print("Yes")
else:
	pritn("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:
n, m = map(int(), 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:
a,b=list(map(int,input().splilt()))
if a==b:
  print('Yes')
else :
  print('No')

Submission status: Runtime Error

Solution code:
a,b=lits(map(int,input().splilt()))
if a==b:
  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 sys import stdin
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: 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(""))
lista=input("").split(" ")
listso=[]
def prime(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
listso+=prime(int(lista[0]))
for i in range(1,n):
    a=int(lista[i])
    for k in listso:
        if(a%k==0):
            a/=k
    listso+=prime(a)
   
c=1
for i in listso:
    c*=i
    c%=(10**9+7)

s=0
for i in lista:
    s+=c/int(i)
    s%=(10**9+7)
print(int(s))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, m = int(input())
if n == m:
  print("Yes")
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:
from collections import defaultdict
import copy


mod = 10 ** 9 + 7
primes = []
for i in range(2,1002):
  for prime in primes:
    if not i % prime:
      break
  else:
    primes.append(i)

def factorize(n):
  now = n
  fct = defaultdict(int)
  for prime in primes:
    cnt = 0
    if prime ** 2 > n:
      break
    while not now % prime:
      now //= prime
      cnt += 1
    if cnt:
      fct[prime] = cnt
  if now > 1:
    fct[now] = 1
  return fct


n = int(input())
a = list(map(int, input().split()))
fct_a = list()
for i in a:
  fct_a.append(factorize(i))
lcm = defaultdict(int)
for i in fct_a:
  for k,v in i.items():
    lcm[k] = max(lcm[k], v)
ans = 0
for i in fct_a:
  b = 1
  for k,v in lcm.items():
    b *= k**(v-i[k])
    b %= mod
  ans += b
ans %= mod
print(ans)

Submission status: Runtime Error

Solution code:
x,y,z=input().split()
x=int(x)
y=int(y)



if x==y:
    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:
print('Yes') if N == M else print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#

import sys
input=sys.stdin.readline

kl=set()

def pf(n):
    ret={}
    for i in range(2,int((n)**0.5)+1):
        if n%i==0:
            cnt=0
            while(n%i==0):
                n/=i
                cnt+=1
            ret[i]=cnt
            kl.add(i)
    if n!=1:
        ret[int(n)]=1
        kl.add(int(n))
    return ret
            
def main():
    N=int(input())
    A=list(map(int,input().split()))
    if N==1:
        print(1)
        exit()
    p=[{} for i in range(N)]
    for i in range(N):
        p[i]=(pf(A[i]))
    lcm=1
    for i in kl:
        maxipow=0
        for j in range(N):
            maxipow=max(maxipow,p[j].get(i,0))
        lcm*=i**maxipow
    MOD=10**9+7
    lcm%=MOD
    ans=0
    for i in range(N):
        ans+=lcm*pow(A[i],MOD-2,MOD)
        ans%=MOD
    print(ans)
    
    
    
if __name__=="__main__":
    main()

Submission status: Runtime Error

Solution code:
N = int(input())
D = {i: 0 for i in range(100)}
for i in range(1, N+1):
    if i % 10 != 0:
        s = str(i)
        D[int(s[0])*10+int(s[-1])] += 1
S = 0
for i in range(10):
    for j in range(10):
        S += D[i*10+j] * D[j*10+i]
print(S)

Submission status: Runtime Error

Solution code:
N = input("")
L = input("").split(" ")
suc = int(N)

for i in range(int(N)):
    for j in range(i):
        if (L[j] < L[i]):
            suc -= 1
            break
    
print(suc)

Submission status: Runtime Error

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
from functools import reduce
stdin = sys.stdin
         
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
     
INF=10**18
mod=10**9+7
N=int(input())
A=nl()
ans=0
min_bai=1
for i in range(N):#最大公倍数
    min_bai=min_bai*A[i]//fractions.gcd(min_bai,A[i])

#lcm = reduce(lambda x,y: x//fractions.gcd(x,y)*y, A)
 
for i in range(N):
    ans+=lcm//A[i]

#ans = sum(lcm//x for x in A)
print(ans%mod)

Submission status: Runtime Error

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
from functools import reduce
stdin = sys.stdin
         
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
     
INF=10**18
mod=10**9+7
N=int(input())
A=nl()
ans=0
min_bai=1
#for i in range(N):#最大公倍数
#    min_bai=min_bai*A[i]//fractions.gcd(min_bai,A[i])

lcm = reduce(lambda x,y: x//fractions.gcd(x,y)*y, A)
 
#for i in range(N):
#    ans+=lcm//A[i]

ans = sum(lcm//x for x in A)
print(ans%mod)

Submission status: Runtime Error

Solution code:
from functools import reduce
from fractions import gcd
from collections import defaultdict,Counter
import copy

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

dic = defaultdict(int)

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

for i in a:
    c = Counter(prime_factorize(i))
    for j,k in c.items():
        if dic[j] < k:
            dic[j] = k

point = 0

for i in a:
    dic2 = copy.deepcopy(dic)
    e = Counter(prime_factorize(i))
    for j,k in e.items():
        dic2[j] -= k
    now = 1
    for j,k in dic2.items():
        for l in range(k):
            now *= j
            now %= mod
    point += now%mod

print(point%mod)

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:
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:
print("Yes" if len(set(input.split()))==1 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:
a = input().split()
  2 b = a[0]
  3 c = a[1]
  4 if b == c:
  5     print("yes")
  6 else:
  7     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(' ')
    if a == b:
      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=int(input().split())
print("Yes" if a==b else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, M = int(input())
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:
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()))

total=1
minP=P[0]
for i in range(1,N):
    if P[i]<minP:
        total+=1
        minP=P[i]
print(total)

Submission status: Runtime Error

Solution code:
def main():
    お寿司, 食べたい = map(int, input().split())
    築地 = [[] for _ in range(お寿司)]
    for _ in range(食べたい):
        鮪, 蛸 = map(lambda x: int(x) - 1, input().split())
        築地[鮪].append(蛸)
        築地[蛸].append(鮪)

    やってるかい = [False] * お寿司
    寿司くいねぇ = おなかすいた(0, 築地, やってるかい, 0)

    print(寿司くいねぇ)


def おなかすいた(市場, 築地, やってるかい, お勘定):
    やってるかい[市場] = True
    if all(やってるかい):
        return お勘定 + 1

    for 豪遊 in 築地[市場]:
        if やってるかい[豪遊]:
            continue
        お勘定 = おなかすいた(豪遊, 築地, やってるかい, お勘定)
        やってるかい[豪遊] = False

    return お勘定


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())




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

Submission status: Runtime Error

Solution code:
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())




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

Submission status: Runtime Error

Solution code:
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())




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

Submission status: Runtime Error

Solution code:
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())




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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,M = map(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")
if N!=M:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if N==M:
  print("Yes")
if N!=M:
  print("No")

Submission status: Runtime Error

Solution code:
if N == M:
  print("Yes")
if N != M:
  print("No")

Submission status: Runtime Error

Solution code:
resolve()

def resolve():
    N,M = map(int, input().split())

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

Submission status: Runtime Error

Solution code:
l  = [int(x) for x in input().split()]
a, b = l[0], l[1]
if a <= b:
    print(int(str(b)*a))
else:
    print(int(str(a)*b))

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

Submission status: Runtime Error

Solution code:
n = int(input())
p_list = list(map(int, input().split()))
flg = 0
i_sum = 0
for i in range(1, n):
    for j in range(1, i+1):
        if p_list[j] >= p_list[i]:
            flg += 1
            if flg == i:
                i_sum += 1
                flg = 0
                continue
        else:
            flg = 0
            continue
        
print(i_sum +1)

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

Submission status: Runtime Error

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

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:
-*- coding: utf-8 -*-
# 整数の入力
a = int(input()) #1
# スペース区切りの整数の入力
b, c = map(int, input().split()) #2 3
# 文字列の入力
s = input()
# 出力
#print("{} {}".format(a+b+c, s))
print(str(a+b+c) + " " + s)

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:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

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

Submission status: Runtime Error

Solution code:
//参考：http://ehafib.hatenablog.com/entry/2015/12/23/164517
//インクルード
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include<map>//map(辞書)
#include<numeric>//iota(整数列の生成),gcdとlcm(c++17)
#include<queue>//キュー
#include<set>//集合
#include<stack>//スタック
#include<string>//文字列
#include<unordered_map>//イテレータあるけど順序保持しないmap
#include<unordered_set>//イテレータあるけど順序保持しないset
#include<utility>//pair
#include<vector>//可変長配列

using namespace std;
typedef long long ll;

//マクロ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000
#define NCK_MAX 510000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second

int main(int argc, char const *argv[]) {
  int n,m;
  scanf("%d %d", &n,&m);
  if (n==m) printf("Yes\n");
  else printf("No\n");
  return 0;
}

Submission status: Runtime Error

Solution code:
from fractions import gcd
n=int(input())
a=list(map(int,input().split()))
b=1
for i in a:
  b=b//gcd(b,i)*i
ans=0
for i in a:
  ans+=(b//i)
print(ans%(10**9+7))

Submission status: Runtime Error

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

if int(a)>=int(b):
  print(str(a)*b)
else:
  print(str(b)*a)

Submission status: Runtime Error

Solution code:
def LI(): return [int(x) for x in sys.stdin.readline().split()]
n, m = LI()
if n == m:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
P_list = list(map(int, input().split()))
count_i = 1
for i in range(1, N):
    if P_list[i] <= min(P_list[:i+1]):
        count_i += 1
print(count_i)

Submission status: Runtime Error

Solution code:
N = int(input())
P_list = list(map(int, input().split()))
count_i = 0
for i in range(N):
    if P_list[i] <= min(P_list[:i+1]):
        count_i += 1
print(count_i)

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:
    pritn("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = map(int, input().split())
b_list = list(b)
count = 0
for i in range(len(b_list)):
    if b_list[i] == min(b_list[:i+1]):
        count += 1
        
print(count)

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

if N==M:
    print(YES)
else:
    print(NO)
return

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().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:
n=int(input())
m=int(input())

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
f,s=map(int,input.split())
if f==s:
    print('Yes')
elif :
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
P = list(map(int,input().split()))
ans=0

for i in range(1,n-1):
  Q = (P[:i+1])
  if max(Q)!=P[i]:
        ans+=1
  if max(Q)==P[i]:
        ans+=0

print(ans+1)

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split();print("YNeos"[n>m::2])

Submission status: Runtime Error

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

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

count=0
for i in range(0,n-1):
  for j in range(0,i):
    if x[i] > x[j]:
      count=count+1
      break
      
#  if x[i-1]>=x[i]:
#    count=count+1
    
#if min(x)==x[n-1]:
#  count=count+1
print(n-count)

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

ans = 0
for i in range(n):
    if i == 0:
        ans += 1
        m = p[0]
        continue
    if p[i] <= m:
        ans += 1
        m = p[i]

print(ans)

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys
from functools import reduce
import fractions

MOD = 1000000007  # type: int


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


def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)


def solve(N: int, A: "List[int]"):
    m = lcm(*A)

    def sumup(x, y):
        return (x + m // y) % MOD
    print(reduce(sumup, A, 0))
    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
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if n / m == 1:
    print("Yes")
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:
print("Yes" if int(input()) == int(input()) else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
data = input()

n = int(data[0])
m = int(data[1])

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

Submission status: Runtime Error

Solution code:
nm = input().split()

n = nm[0]
m = nm[1]

if n < m :
	print(No)
else:
	print(Yes)

Submission status: Runtime Error

Solution code:

def main():


    from collections import deque


    h ,w = map(int, input().split())
    a = [ list(input())  for _ in range(h)]

    q = deque()

    if a[0][0]=='.':
        q.appendleft((0,0,0))
    else:
        q.appendleft((0,0,1))

    while(True):
        f = q.popleft()
        x, y, c = f[0], f[1], f[2]
        if (x,y) == (w-1,h-1):
            print(c)
            break

        for u, v in [(1,0), (0,1)]:
            if x + u <= w - 1 and y + v<= h - 1:
                n = a[x+u][y+v]=='.'
                if n:
                    q.appendleft((x + u, y + v, c + 0))
                else:
                    q.append((x + u, y + v, c + 1))



if __name__=='__main__':
    main()

Submission status: Runtime Error

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

if (N==M):
    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 = int(input())
A = list(map(int,input().split()))
min = N + 1
AC = 0
for i in range(N):
  if min < A[i]:
     AC += 1
input(AC)

Submission status: Runtime Error

Solution code:
# coding: utf-8
# Your code here!

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

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
ls = list(map(int,input().split()))
a = 0
for i in range(n):
    for j in range(i):
        if ls[i] =< ls[j]:
            continue    
        else:
            a += 1
            break
print(n - a)

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().split())
print("Yes" N==M else "No")

Submission status: Runtime Error

Solution code:
import java.util.Scanner;

public class Main{
  public static void main(String[] args){
    Scanner scan=new Scanner(System.in);
    int i=scan.nextInt();
    int j=scan.nextInt();
    if (i!=j){
      System.out.println("No");
    }else
      System.out.println("Yes");
    scan.close();
  }
}

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

ans = 0
for i in range(1,n+1):
    list = sorted(listn[:i])
    if listn[i-1]==list[0]:
        ans+=1

print(ans)

Submission status: Runtime Error

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

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 sys import stdin
if m >= n:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import fractions
import functools
def main():
    n = int(input())
    a = [int(t)for t in input().split()]

    M = 10**9+7
    culcm = functools.reduce(lcm,a)

    b = [culcm//a_i for a_i in a]

    print(sum(b)%M)

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

if __name__ == "__main__":
    main()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import defaultdict

N = int(input())
d = defaultdict(int)

for n in range(N):
    n = str(n)

    a = n[0]
    b = n[-1]

    d[(a, b)] += 1


s = 0
for i in range(1, 10):
    for j in range(10):

        s += d[(str(j), str(i))] * d[(str(i), str(j))]

print(s)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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 = int(input())
P = list(map(int,input().split()))
count = 1
 
if N > 0:
  min = P[0]
  
for i in range(1, N): 
  if min >= P[i]:
    min = P[i]
    count += 1      
print(count)

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

Submission status: Runtime Error

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

if n == m:
	print("AC")
else:
	print("WA")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
n = int(sys.stdin.readline())
p =list(map(int, sys.stdin.readline().split()))
cnt = 0
for i in range(n):
    if min(p[:i+1]) == p[i]:
        cnt+=1
print(cnt)