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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = input().split()
s1 = a*int(b)
s2 = b*int(a)
print(s1 if s1 < s2 else s2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

elif n > m:
    print('WA')

Submission status: Wrong Answer

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

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

elif n != m:
    print('WA')

Submission status: Wrong Answer

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

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

else:
    print('WA')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def popcount(n):
    c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
    return c

Submission status: Wrong Answer

Solution code:
lst = input().split(' ')
m = lst[0]
n = lst[1]

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

Submission status: Wrong Answer

Solution code:
if len(set((list(input().split()))))==1:
    print("Yes")
else:("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if N > M:
    print('WA')
else:
    print('AC')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>=b:
    print(str(b)*a)
else:
    print(str(a)*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<=b:
  print(str(a)*b)
else:
  print(str(b)*a)

Submission status: Wrong Answer

Solution code:
print("YNeos"[len(set(input()))!=2::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
  N=int(input())
  P=list(map(int,input().split()))
  sumCount=1
  p0=P[0]
  for i in range(1,N):
    pi=P[i]
    if(p0>=P[i]):
      p0=P[i]
      sumCount=sumCount+1
  print(sumCount)
if __name__=='main':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#スペース区切りの整数入力
N, M = map(int, input().split(' ')) 
#N,Mの比較
if N==M:
    print('yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def pop_cnt(n):
    c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
    return c

Submission status: Wrong Answer

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

if N == M:
  print("AC")
else:
  print("WA")

Submission status: Wrong Answer

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

if n[1]>=n[0]:
    print('Yes\n')
else:
    print('No\n')

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(int(a*(a-1) / 2 + b*(b-1) / 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("N M")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import sys
from io import StringIO
import unittest


def resolve():
    n, m = map(int, input().split())

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



class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """3 3"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """3 2"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """1 1"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__ == "__main__":
    unittest.main()

Submission status: Wrong Answer

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

n = int(nm[0])
m = int(nm[1])
print(n)
print(m)

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def popcnt(n):
    c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
    return c

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a==b:
    print('yes')
else:
    print('No')

Submission status: Wrong Answer

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

lis = set({a,b})

if a==b:
    print('yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
n = a[0]
m = a[1]
if n == m:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
n,m = a
if n == m:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a = input().split()
n,m = a
if n > m:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
n,m = a
if n > m:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ha=list(map(int,input().split()))
a=ha[0]
b=ha[1]
if a>b:
  print(str(b)*a)
else:
  print(str(a)*b)

Submission status: Wrong Answer

Solution code:

def main():
    
    n,m = map(int, input().split())

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

if N == M:
    ans = "AC"
    
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ansA = ""
ansB = ""
for countA in range(B):
    ansA = ansA + str(A)
for countB in range(A):
    ansB = ansB + str(B)

list = [str(ansA),str(ansB)]
list.sort()

print(list[0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if N-M == 0:
    print('AC')
else:
    print('WA')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, M = input().split()
 
if N==M :
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b=input().split()
print("TNeos"[a!=b::2])

Submission status: Wrong Answer

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

a(N, M)

Submission status: Wrong Answer

Solution code:
N,M=list(map(int,input().split()))
a=(N==M)
print("WAC"[a:a+2])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
print("AC" if n == k else "WA")

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
s = 0
if a <= b:
    for i in range(0,b):
        s += a*(10**i)

else:
    for i in range(0,a):
        s += b*(10**i)

print(s)

Submission status: Wrong Answer

Solution code:
def acornot(s):
  a = s.split()
  if len(a) != 2:
    return "No"
  if a[0] == a[1]:
    return "Yes"
  return "No"

Submission status: Wrong Answer

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

while H > 0:
    H -= A
    cnt += 1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = list(map(int, input().split()))
print(N)
i = N[1] - N[0]
if i == 0 :
         print("Yes")
else:
         print("No")

Submission status: Wrong Answer

Solution code:
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        ans[i] = ans[i]+x
    return ans

text = input()

if get(text,2)[0] <= get(text,2)[1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        ans[i] = ans[i]+x
    return ans

text = input()

if get(text,2)[0] == get(text,2)[1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, M=input().split()
if N==M:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a<=b:
  for i in range(b):
    print(a,end="")
else:
  for i in range(a):
    print(b,end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# ABC152
a,b = map(int, input().split())
 
if a<b:
    ans=str(a)*b
else:
    ans=str(b)*a
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b=map(int, input().split())
if b >= a:
  print(str(a)*b)
else:
  print(str(b)*a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(b**a if b>=a else a**b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
n=0
for i in range(0,b):
  n = n + a*(10**i)
m = 0
for j in range(0,a):
  m = m + b*(10**j)
  
if n<=m:
  print(n)
else:
  print(m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
ans = [int(s) for s in input().split()]
if ans[0] == ans[1]:
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
n, m = [int(s) for s in input().split()]
if n == m:
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
def ac_or_wa(n, m):
    if n == m:
        return "AC"
    elif n > m:
        return "WA"


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

Submission status: Wrong Answer

Solution code:
def ac_or_wa(n, m):
    if n == m:
        return "AC"
    else:
        return "WA"


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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if (N==M):
    print("Yes")
elif(N!=M):
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, b = input().split()
str_list = []
a_ = a * int(b)
b_ = b * int(a)
str_list.append(a_)
str_list.append(b_)
str_list = sorted(str_list)
print('%s' % str_list[0])

Submission status: Wrong Answer

Solution code:
a, b = input().split()
str_list = []
a_ = a * int(b)
b_ = b * int(a)
str_list.append(a_)
str_list.append(b_)
sorted(str_list)
print('%s' % str_list[0])

Submission status: Wrong Answer

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


def main():
    H, N = map(int, input().split())
    print('Yes' if H == N else 'NO')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N,M = input().split()
if M <= N:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
# 素因数分解 n >= 2
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(factorization(100))
#出力: [[2, 2], [5, 2]]

#print(factorization(1))
#出力: [[1, 1]]

Submission status: Wrong Answer

Solution code:
#立っているビットの数をO(1)で勘定
def popcnt(n):
  c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
  c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
  c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
  c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
  c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
  c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
  return c

#print((103, bin(103)[2:], popcnt(103)))
#出力
#[1, 10, 2, 5]

Submission status: Wrong Answer

Solution code:
#立っているビットの数をO(1)で勘定
def popcnt(n):
  c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555)
  c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333)
  c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f)
  c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff)
  c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff)
  c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff)
  return c

# print((103, bin(103)[2:], popcnt(103)))
# 出力
# (103, '1100111', 5)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, m = list(map(int, input().strip().split()))
if(n==m):
  print("AC")
else:
  print("WA")

Submission status: Wrong Answer

Solution code:
import  numpy as np
import math

if __name__ == "__main__":
  _n, _m = map(int, input().split())
  if _n == _m:
    print('yes')
  else:
    print("no")

Submission status: Wrong Answer

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

if int(a)>int(b):
	for i in range(int(a)):
		print(b,end="")
else:
	for i in range(int(b)):
		print(a,end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def read_ints(row):
    return list(map(int, row().split()))
  
import sys

row =sys.stdin.readline
N,M = read_ints(row)
print(N == M)

Submission status: Wrong Answer

Solution code:
import numpy as np
a=[1,2,3,4,5]
b=np.cumsum(a)
print('AC')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
test = input()
print(test)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = list(map(int,input().split()))
if N[0] == N[1]:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
n, m = [int(x) for x in input().split()]
print('AC' if n == m else 'WA')

Submission status: Wrong Answer

Solution code:
num = list(input().split())

if num[0] == num[1]:
    print('yes')
else :
    print('no')

Submission status: Wrong Answer

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

list_a = [0]*int(b)
list_b = [0]*int(a)

for i in range(0,int(b)):
    list_a[i] = int(a)*10**i

for i in range(0,int(a)):
    list_b[i] = int(b)*10**i
    
a_r = sum(list_a) 
b_r =sum(list_b)

if(int(a_r)<int(b_r)):
    print(str(a_r))
elif(int(a_r)>int(b_r)):
    print(str(b_r))
else:
    print(str(a_r))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
if m>=n:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
arr = set(map(int, input().split()))
print('AC' if len(arr) == 1 else 'WA')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def test_cases(N, M):
  if N==M:
    return 'Yes'
  else:
    return 'No'

Submission status: Wrong Answer

Solution code:
def test_case(M, N):
  if M==N:
    return True
  else:
    Flase

Submission status: Wrong Answer

Solution code:
def pass_test_cases(m,n):
  if m==n:
    return Yes
  else:
    return No

Submission status: Wrong Answer

Solution code:
import sys
from operator import itemgetter
import collections


def main():
    input = sys.stdin.readline
    s = str(input()).split(" ")
    print("Yes") if s[0]==s[1] else print("No")

    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
from operator import itemgetter
import collections


def main():
    input = sys.stdin.readline
    s = str(input()).split(" ")
    print("Yes" if s[0]==s[1] else "No")

    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
l = input().split()
 
if l[0] == l[1]:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #n = int(stdin.readline()[:-1])   
    r = stdin.readline()[:-1]
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]
    #n = int(r)
    #a = r.split()
    #a,b,c = r.split()
    a = list(map(int, r.split()))
    #a,b,c,d = map(int, r.split())
    #a = [int(s[i]) for i in range(1, n+1)]
    #a = [list(map(int, r.split())) for i in range(1,n+1)]
    #res = 0

    a.sort()
    if a[0] <= a[1]:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
S = "N M"
S = S.split(" ")
N = S[0]
M = S[1]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N_M = input().split() #s_1 s_2を分割して取得し、sに値を入れる
N = int(N_M[0])
M = int(N_M[1])

if M == N:
	print('yes')
else:
	print('no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
if N==K:
    print('yes')

else:
    print('no')

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print('AC' if a is b else 'WA')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
  if n == m:
    return True
  else:
    return False
main()

Submission status: Wrong Answer

Solution code:
s=input();print("YNeos"[s[0]!=s[-1]::2])

Submission status: Wrong Answer

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

if a > b:
  B = ""
  for i in range(a):
    B += str(b)
  print(B)  
elif a < b:
  A = ""
  for i in range(b):
    A += str(a)
  print(A)
else:
  C = ""
  for i in range(a):
    C += str(a)
  print(C)

Submission status: Wrong Answer

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

if a > b:
  B = []
  for i in range(a):
    B.append(b)
  print(B)  
elif a < b:
  A = []
  for i in range(b):
    A.append(a)
  print(A)
else:
  C = []
  for i in range(a):
    C.append(a)
    print(C)

Submission status: Wrong Answer

Solution code:
#coding: utf-8

s = input().split()
if s[0]>s[1]:
    for i in range(int(s[0])):
  	    print(str(s[1]),end='')
    print()
else:
    for i in range(int(s[1])):
  	     print(str(s[0]),end='')
    print()

Submission status: Wrong Answer

Solution code:
#coding: utf-8

s = input().split()
if s[0]>s[1]:
  for i in range(int(s[0])):
  	print(str(s[1]),end='')
else:
  for i in range(int(s[1])):
  	print(str(s[0]),end='')

Submission status: Wrong Answer

Solution code:
#coding: utf-8

s = input().split()
if s[0]==s[1]:
  print('yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
def P(N, M):
  if N > M:
    return No
  return Yes

Submission status: Wrong Answer

Solution code:
n, m = map(int, input().split())
print(['No', 'Yes'][n >= m])

Submission status: Wrong Answer

Solution code:
a=input()
b=a.split()
if int(b[0])==int(b[1]):
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def get_sieve_of_eratosthenes(n):
  prime = [2]
  limit = int(n ** 0.5)
  data = [i + 1 for i in range(2, n, 2)]
  while True:
    p = data[0]
    if limit <= p:
      return prime + data
    prime.append(p)
    data = [e for e in data if e % p != 0]

for i in range(2, 7):
  print(10 ** i, ":", len(get_sieve_of_eratosthenes(10 ** i)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
N = map(int, input().split())
Alist = list(map(int, input().split()))
import fractions
from functools import reduce


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


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


lcm_a = lcm_list(Alist)
mod = 10**9 + 7
ans = 0

for a in Alist:
    ans += (lcm_a // a)
print(ans % mod)

Submission status: Wrong Answer

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