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

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

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

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

n = int(input())
l = [int(_) for _ in input().split()]
x = lcm_list(l)
ans = 0

for i in range(n):
    ans += x // l[i]
    ans %= (10**9 + 7)
print(ans)

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

Submission status: Runtime Error

Solution code:
import fractions

mod=10**9+7

n=int(input())

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

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

lcma=1

for i in range(n):
    lcma=lcm(lcma,a[i])%mod

def modpow(x,y,mod):
    res=1
    while y>0:
        if y&1:
            res=res*x%mod
        x=x*x%mod
        y>>=1
    return res

def modinv(x,mod):
    return modpow(x,mod-2,mod)

ans=0

for i in range(n):
    ans=(ans+lcma*modinv(a[i],mod)%mod)%mod

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import gcd

n = int(input())

inputs = list(map(int,input().split()))

lcm = inputs[0]
for i in inputs[1:]:
  lcm = int(lcm*i/gcd(lcm, i))

ans = 0;
lis = []
for i in inputs:
    ans = ans + int(int(lcm/i)%1000000007)
    ans = ans%1000000007;

print(ans)

Submission status: Runtime Error

Solution code:
from numba import jit
N = int(input())


@jit
def main(N):
    cnt = 0
    for i in range(1, N):
        for j in range(1, N):
            i = str(i)
            j = str(j)
            if i[-1] == j[0] and i[0] == j[-1]:
                cnt = cnt + 1
    return cnt


print(main(N))

Submission status: Runtime Error

Solution code:
import fractions

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

a = A[0]
for i in range(1, N):
    g = a * A[i] // fractions.gcd(a, A[i])
    a = g
    
b = 0
for i in range(N):
    b = b + gcc // A[i]

c = b % (1000000007)
print(c)

Submission status: Runtime Error

Solution code:
n = int(input())
m = int(input())
if m <= n:
    ans = "yes"
else:
    ans = no
print(ans)

Submission status: Runtime Error

Solution code:
r=input()
k=r.split()

t1=t2=0
for i in range(k[1]):
    t1 += k[0]
for i in range(k[0]):
    t2 += k[1]
    
jj=[t1,t2]
jj.sort(reverse=True)
print(jj[0])

Submission status: Runtime Error

Solution code:
N = input()
lis = input().split(" ")
cnt = 1
for i in range(int(N)+1):
    for j in range(i-1,-1,-1):
        if int(lis[i])>int(lis[j]):
            break
        else:
            cnt +=1
        break
print(cnt)

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input().split()))
mod=10**9+7

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

def power(a,p):
    T=[a]
    while 2**(len(T))<p:
        T.append(T[-1]**2%p)
    b=bin(p-2)
    ans=1
    for i in range(len(b)-2):
        if int(b[-i-1])==1:
            ans=ans*T[i]%p
    return ans   

l=A[0]
for i in range(n-1):
    l=lcm(l,A[i+1])
s=0
for i in range(n):
    s+=l*power(A[i],mod)%mod
    s%=mod
print(s)

Submission status: Runtime Error

Solution code:
from fractions import gcd

def main():
    mod= 10 ** 9 + 7
    nok = 1
    n = int(input())
    a = [int(i) for i in input().split()]
    for i in a:
        nok = nok * i // gcd(nok, i)
    ans = 0
    for i in a:
        ans = (ans + nok // i) % mod
    print(ans)

main()

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:
str1, str2 = [s for s in input().split()]
a = str1*int(str2)
b = str2*int(str1)
int(a)
int(b)
list = [a, b]
list.sort();
print(list[0])

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
Ps = list(map(int, input().split()))
Ps = np.array(Ps)
count = 0

for i in xrange(N):
    low = Ps[i]
    if ( np.sum(Ps[:i] < low) == 0):
        count += 1

print(count)

Submission status: Runtime Error

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

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())
P = []
counter = 0
input_string = input()
P = input_string.split()

for i in range(N):
    for j in range(N):
        if N == int(P[i]):
            counter = counter + 1
            if N != 1:
                N = N - 1
                break
            else: 
                break
        elif N < int(P[i]):
            break
        else:
            if N != 1:
                N = N - 1   

print(counter)

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:
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>

using namespace std;
using boost::multiprecision::cpp_int;

int main() {
  cpp_int a, b;
  cin >> a >> b;
  cout << (a > b ? "GREATER" : (a == b ? "EQUAL" : "LESS")) << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
p = list(map(int,input().split()))
#n = 5
#p = [4,2,5,1,3]
maxcnt = 1
cnt = 1
for i in range(n):
    box = 0
    cnt = 1
    box = p[i]
    if n - i < maxcnt :
        break

    for j in range(i + 1 , n ):
        if i < j and box >= p[j]:
            box = p[j]
            cnt += 1
            if maxcnt < cnt :
                maxcnt = cnt
            
print(maxcnt)

Submission status: Runtime Error

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

import numpy as np
P = np.array(P)

answer = 0
for i in range(N):
  if P[i]==min(P[:i+1]):
    answer += 1
    
print(answer)

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 = list(map(int, input()))
ans = "Yes"
if m <n:
    ans = "No"
print(ans)

Submission status: Runtime Error

Solution code:
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
temp = 0
for i in range(n):
    """
    for j in range(i+1):
        if p[i]<=p[j]:
            temp+=1
        if temp == i+1:
            #print("i:"+str(i))
            ans+=1
    temp=0
            """
    if min(p[:i+1]) == p[i]:
        #print("i:"+str(i))
        ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
def find_lcm(num1, num2): 
    if(num1>num2): 
        num = num1 
        den = num2 
    else: 
        num = num2 
        den = num1 
    rem = num % den 
    while(rem != 0): 
        num = den 
        den = rem 
        rem = num % den 
    gcd = den 
    lcm = (num1 * num2)/int(gcd) 
    return lcm
 
n = int(input())
l = list(map(int, input().split()))
lcm = 1 
  
for i in range(0, len(l)): 
    lcm = find_lcm(lcm, l[i])
 
ans = 0
 
for i in range(0, len(l)):
  ans += lcm / l[i]
 
print(int(ans % 1000000007))

Submission status: Runtime Error

Solution code:
n = int(input())
P = [int(x) for x in input().split()]

counter = 1
for i in range(1,n):
    if any( x< P[i] for x in  P[0:i] ):
            break
    else:
        counter +=1

print(counter)

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
s1=""
s2=""
for i in range(a):
	s1=s1+str(b)
for i in range(b):
	s2=s2+str(a)
print(s1) if (s1<s2) else print(s2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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