TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
n,m = map(int,input().split())
ps = [input().split() for _ in range(m)]


answer =["inf"]*m
count = 0

for i in range(len(ps)):
  if ps[i][0] not in answer:
    if ps[i][1] == "AC":
      answer[i] = ps[i][0]
    else:
      count += 1
answer.remove("inf")
print(len(answer),count)

n, m = map(int, input().split())
ac = 0
wa = 0
cnt = [0]*n

for i in range(m):
    p, s = input().split()
    p = int(p)
    p -= 1
    if cnt[p] == -1:
        continue
    elif s == 'AC':
        ac += 1
        wa += cnt[p]
        cnt[p] = -1
    else:
        cnt[p] += 1
print(ac, wa)

Verdicts: Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
coding: utf-8

import bisect
import math

N, M = (int(v) for v in input().split())

seen = {}
WA = {}

acs = 0
was = 0

for i in range(M):
    q, tmp = input().split()
    if tmp == "AC":
        if q not in seen:
            acs += 1
            if q not in WA:
                WA[q] = 0
            was += WA[q]
            seen[q] = 1
    else:
        if q not in WA:
            WA[q] = 1
        else:
            WA[q] += 1

print (acs, was)



#coding: utf-8

import bisect
import math

N, M = (int(v) for v in input().split())

seen = {}
WA = {}

acs = 0
was = 0

for i in range(M):
    q, tmp = input().split()
    if tmp == "AC":
        if q not in seen:
            acs += 1
            if q not in WA:
                WA[q] = 0
            was += WA[q]
            seen[q] = 1
    else:
        if q not in WA:
            WA[q] = 1
        else:
            WA[q] += 1

print (acs, was)



Verdicts: Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
n,m = map(int, input().split())
num_ac = 0
num_wa = 0
tmp_num_wa = 0
answerd = []

for i in range(m):
  p,s = input().split()
  if p in answerd:
    continue
  if s == 'WA':
    tmp_num_wa += 1
  if s == 'AC':
    num_ac += 1
    num_wa += tmp_num_wa
    tmp_num_wa = 0
    answerd.append(_p)
    
print(num_ac, num_wa)

n,m = map(int, input().split())
ac = [0]*n
wa = [0]*n

for i in range(m):
  p,s = input().split()
  p = int(p)-1
  if s == 'AC':
     ac[p] = 1
  elif s == 'WA':
    if ac[p] == 0:
      wa[p] += 1

num_ac = 0
num_wc = 0

for a, w in zip(ac,wa):
  num_ac += a
  if a > 0:
    num_wc += w  
print(num_ac,num_wc)

Verdicts: Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
import numpy as np
n,p = map(int,input().split())
ac = np.array([0]*n)
wa = np.array([0]*n)

for i in range(N):
    p,s = input().split()
    if ac[int(p) - 1] == 0 and s == "WA":
        wa[int(p) - 1] += 1
    else:
        ac[int(p) - 1] = 1

if sum(ac) == 0:
    print(0,0)
else:
    print(sum(ac),sum(wa))


import numpy as np

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

AC = np.array([0]*N)
WA = np.array([0]*N)

for i in range(M):
    p,S = input().split()

    if AC[int(p)-1] ==0 and S == "WA":
       WA[int(p)-1] += 1
    else:
        AC[int(p)-1] = 1

print(sum(AC),sum(AC*WA))


Verdicts: Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
n,m = map(int,input().split())
ac = [0]*n
wa = [0]*n
pena = 0

for i in range(m):
    p,s = map(str,input().split())
    p = int(p)-1 
    if s == "WA" and ac[p] == 0:
        wa[p] += 1
    elif s == "AC" and ac[p] == 0:
        ac[p] = 1
        pena += wa[p]   
    elif ac[p] == 1:
        continue

print(str(sum(ac)) + " " + str(pena)

n,m = map(int,input().split())
ac = [0]*n
wa = [0]*n
pena = 0

for i in range(m):
    p,s = map(str,input().split())
    p = int(p)-1 
    if s == "WA" and ac[p] == 0:
        wa[p] += 1
    elif s == "AC" and ac[p] == 0:
        ac[p] = 1
        pena += wa[p]   
    elif ac[p] == 1:
        continue

print(str(sum(ac)) + " " + str(pena))

Verdicts: Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
def main(n, m, p_s):
    st = [False for _ in range(n)]
    ac, wa = 0, 0

    for p, s in p_s:
        if st[p - 1]:
            continue

        if s == "AC":
            ac += 1
            st[p - 1] = True
        if s == "WA":
            wa += 1

    print(ac, wa)


if __name__ == "__main__":
    n, m = map(int, input().split())
    p_s = [list(map(int, input().split())) for _ in range(m)]

    main(n, m, p_s)


def main(n, m, p_s: list):
    data = {"WA": set(), "AC": set()}
    for p, s in p_s:
        data[s].add(int(p))

    print(len(data["AC"]), len(data["WA"]))


if __name__ == "__main__":
    n, m = map(int, input().split())
    p_s = [input().split() for _ in range(m)]


def main(n: int, m: int, p_s: list):
    bool_ac = [False for _ in range(n)]
    count_wa = [0 for _ in range(n)]
    ac, wa = 0, 0

    for p, s in p_s:
        p = int(p)

        if bool_ac[p - 1]:
            continue

        if s == "AC":
            bool_ac[p - 1] = True
            wa += count_wa[p - 1]
            ac += 1
        elif s == "WA":
            count_wa[p - 1] += 1

    print(ac, wa)


if __name__ == "__main__":
    n, m = map(int, input().split())
    p_s = [input().split() for _ in range(m)]

    main(n, m, p_s)


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
  p, s = input().split()
  p = int(p)
  if s == "AC":
    if not isAC[p]:
      isAC[p] = True
      ac += 1
      p += penalties[p]
  else:
    penalties[p] += 1
print(ac, penalty)

N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
  p, s = input().split()
  p = int(p)
  if s == "AC":
    if not isAC[p]:
      isAC[p] = True
      ac += 1
      p += penalties[p]
  else:
    penalties[p] += 1
print(ac, penalty)

N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
  p, s = input().split()
  p = int(p)
  if s == "AC":
    if not isAC[p]:
      isAC[p] = True
      ac += 1
      penalty += penalties[p]
  else:
    penalties[p] += 1
print(ac, penalty)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
N, M = list(map(int, input().split()))

p = [0] * M
S = [''] * M


for i in range(M):
    p[i], S[i] = input().split()
    p[i] = int(p[i])

dp = [[0] * 2 for i in range(N)]  

for i in range(M):
    num = p[i] - 1
    
    if(dp[num][0] == 0):
         if(S[i] == 'WA'):
             dp[num][1] += 1
             continue

         elif(S[i] == 'AC'):
             dp[num][0] += 1
             continue
         else:
             print("S is ??")

score = 0
penalty = 0
for i in range(len(dp)):
    score += dp[i][0]
    penalty += dp[i][1]

print(score, penalty)
~

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

p = [0] * M
S = [''] * M


for i in range(M):
    p[i], S[i] = input().split()
    p[i] = int(p[i])

penalty = 0
right_ans = 0

dp = [[0] * 2 for i in range(N)]  

for i in range(M):

    
    if(dp[p[i]][0] > 0):
        continue

    if(S[i] == 'AC'):
        dp[p[i]][0] += 1
        continue

    elif(S[i] == 'WA'):
        dp[p[i]][1] += 1

print(right_ans, penalty)

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

p = [0] * M
S = [''] * M


for i in range(M):
    p[i], S[i] = input().split()
    p[i] = int(p[i])

WAnum = 0
ACnum = 0

WA = [0] * N
AC = [0] * N

for i in range(M):
    num = p[i] - 1
    
    if(AC[num] >= 1):
        continue

    if(S[i] == 'WA'):
        WA[num] += 1

    elif(S[i] == 'AC'):
        AC[num] = 1
        ACnum += 1
        WAnum += WA[num]

print(ACnum, WAnum)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
from sys import stdin
n,m = [int(x) for x in stdin.readline().rstrip().split()]

if m == 0:
    print(0,0)
    exit()

li = [list(stdin.readline().rstrip().split()) for _ in range(m)]
li.sort()

cor = 0
wor = 0
now = int(li[0][0])
for i in li:
    if int(i[0]) == now:
        if i[1] == "WA":
            wor += 1
        else:
            cor += 1
            now += 1
print(cor,wor)



from sys import stdin
n,m = [int(x) for x in stdin.readline().rstrip().split()]

li = [list(stdin.readline().rstrip().split()) for _ in range(m)]
lin = [0]*(n+1)
wor = [0]*(n+1)

for i in li:
    if lin[int(i[0])] == 0:
        if i[1] == "WA":
            wor[int(i[0])] += 1
        elif i[1] == "AC":
            lin[int(i[0])] = 1
wa = 0
for i in range(n+1):
    if lin[i] == 1:
        wa += wor[i]

print(sum(lin),wa)


Verdicts: Wrong Answer

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
n,m=map(int, input().split())
ac,wa=0,0
if m==0:
    print(ac,wa)
else: 
    l=[0]*n 
    r=[0]*n 
    for i in range(m):
        pa,s=map(str, input().split())
        p=int(pa)
        if l[p-1]==0 and s=='AC': 
            l[p-1]=1
            ac+=1
        elif s=='WA': 
            r[p-1]+=1
        else:
            continue
    for i in range(n):
        if l[i]==1:
            wa+=w[i]
        else:
            continue
    print(ac,wa)

n,m=map(int, input().split())
ac,wa=0,0
if m==0:
    print(ac,wa)
else: 
    l=[0]*n 
    r=[0]*n 
    for i in range(m):
        pa,s=map(str, input().split())
        p=int(pa)
        if l[p-1]==0 and s=='AC': 
            l[p-1]=1
            ac+=1
        elif l[p-1]==0 and s=='WA': 
            r[p-1]+=1
        else:
            continue
    for i in range(n):
        if l[i]==1:
            wa+=r[i]
        else:
            continue
    print(ac,wa)

Verdicts: Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
N,M = map(int,input().split())
PS = []

T = [0] * (N + 1)
ans = [0,0]


for i in range(M):
  p,s = input().split()
  p = int(p)
  if T[p] == 0:
    T[p] = s
    if s == "AC":
      ans[0] += 1
      T[p] = "AC"
    elif s == "WA":
      ans[1] += 1
      T[p] = "WA"
      
  elif T[p] == "AC":
    continue

  elif T[p] == "WA":
    if s == "AC":
      T[p] == s
      ans[0] += 1
    elif s == "WA":
      ans[1] += 1
      continue
      
print(ans[0],ans[1])



N,M = map(int,input().split())
PS = []

T = [0] * (N + 1)
ans = [0,0]


for i in range(M):
  p,s = input().split()
  p = int(p)
  if T[p] == 0:
    T[p] = s
    if s == "AC":
      ans[0] += 1
    elif s == "WA":
      ans[1] += 1
      
  elif T[p] == "AC":
    continue
  elif T[p] == "WA":
    if s == "AC":
      T[p] == s
      ans[0] += 1
    elif s == "WA":
      ans[1] += 1
      
print(ans[0],ans[1])



N,M = map(int,input().split())
PS = []

T = [0] * (N + 1)
A = 0
W = [0] * (N + 1)

ans = [0,0]

for i in range(M):
  p,s = input().split()
  p = int(p)
  PS.append([p,s])

for i in range(M):
  p = PS[i][0]
  s = PS[i][1]

  if T[p] == 0:
    if s == "AC":
      A += 1
      T[p] = "AC"
    elif s == "WA":
      W[p] += 1
      T[p] = "WA"
      
  elif T[p] == "AC":
    continue

  elif T[p] == "WA":
    if s == "AC":
      T[p] = "AC"
      A += 1
    elif s == "WA":
      W[p] += 1

w = 0

for i in range(1,N + 1):
  if T[i] == "AC":
    w += W[i]
      
print(A,w)



Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
#C - Welcome to AtCoder
N,M = list(map(int, input().split()))
p = []
S = []
for k in range(M):
    p_input,S_input = input().split()
    p.append(p_input)
    S.append(S_input)
p = list(map(int, p))

j = 0
sum_ac,sum_wa = 0,0
for i in range(N):
    try:
        flg = 0
        while p[j] == i + 1:
            if S[j] == 'WA':
                print('WA')
                j = j + 1
                sum_wa = sum_wa + 1
            elif S[j] == 'AC' and flg == 0:
                print('AC')
                flg = flg + 1
                j = j + 1
                sum_ac = sum_ac + 1
            else:
                j = j + 1
    except IndexError:
        pass

print(sum_ac,sum_wa)

#other's code
N,M=map(int,input().split())
 
ac = 0
wa = 0
aclist = {}
walist = {}

for i in range(N):
    aclist[i + 1] = 0
    walist[i + 1] = 0

for i in range(M):
    a,b=input().split()
    a=int(a)
    if aclist[a] == 1:
        continue
    elif b == 'WA':
        walist[a] += 1
    elif b == 'AC':
        aclist[a] += 1
        ac += 1
        wa += walist[a]

print(ac,wa,sep=" ")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
n,m=map(int,input().split())
ps=[list(input().split()) for i in range(m)]
pen=[0]
rig=[0]

for i in range(m):
  if ps[i][1] == "AC":
    rig[int(ps[i][0])-1]=1
  else:
    if rig[int(ps[i][0]-1)] == 0:
      pen[int(ps[i][0]-1)]+=1

cnt1,cnt2=0,0
for i in range(n):
  if rig[i]==1:
    cnt1+=rig[i]
    cnt2+=pen[i]
    
print(str(cnt1)+" "+str(cnt2))

n,m=map(int,input().split())
ps=[list(input().split()) for i in range(m)]
pen=[0]*n
rig=[0]*n

for i in range(m):
  if ps[i][1] == "AC":
    rig[int(ps[i][0])-1]=1
  else:
    if rig[int(ps[i][0]-1)] == 0:
      pen[int(ps[i][0]-1)]+=1

cnt1,cnt2=0,0
for i in range(n):
  if rig[i]==1:
    cnt1+=rig[i]
    cnt2+=pen[i]
    
print(str(cnt1)+" "+str(cnt2))


n,m=map(int,input().split())
ps=[list(input().split()) for i in range(m)]
pen=[0]*n
rig=[0]*n

for i in range(m):
  if ps[i][1] == "AC":
    rig[int(ps[i][0])-1]=1
  else:
    if rig[int(ps[i][0])-1] == 0:
      pen[int(ps[i][0])-1]+=1

cnt1,cnt2=0,0
for i in range(n):
  if rig[i]==1:
    cnt1+=rig[i]
    cnt2+=pen[i]
    
print(str(cnt1)+" "+str(cnt2))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi participated in a contest on AtCoder.  The contest had N problems.  Takahashi made M submissions during the contest.  The i-th submission was made for the p_i-th problem and received the verdict S_i (`AC` or `WA`).  The number of Takahashi's correct answers is the number of problems on which he received an `AC` once or more.  The number of Takahashi's penalties is the sum of the following count for the problems on which he received an `AC` once or more: the number of `WA`s received before receiving an `AC` for the first time on that problem.  Find the numbers of Takahashi's correct answers and penalties.

Submission attempts (in order):
import sys

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

if m==0:
    print(0,0)
    sys.exit()

p=[]
s=[]
for i in range(m):
    pp,ss=input().split()
    p.append(int(pp))
    s.append(ss)

p.append(max(p)+1)

sei=0
pena=0

print(len(p))

i=0

while(True):
    #print(i)
    #print("p[i],p[-1]:",p[i],p[-1])
    if p[i]==p[-1]: break
    if s[i]=='WA':
        pena+=1
    else:
        sei+=1
        #print("p[i]+1:",p[i]+1)
        i=p.index(p[i]+1)-1
        #print("i:",i)
    i+=1
            
print(sei,pena)


n,m=map(int,input().split())
ac = [0] * n
wa = [0] * n

for i in range(m):
    p,s = map(str,input().split())
    p = int(p)
    if ac[p-1] != 1:
        if s == 'WA':
            wa[p-1] += 1
        elif s == 'AC':
            ac[p-1] += 1

for i in range(n):
    if ac[i] == 1:
        continue
    elif ac[i] == 0:
        wa[i] = 0
        
print(sum(ac),sum(wa))


Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
a = int(input())
b = input()

print(b.count('ABC'))

k,x = map(int,input().split())

if 500*k >= x:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k, x = [int(v) for v in input().split()]

if 500 * k >= x:
  print("YES");
else:
  print("NO");

#from math import sqrt
#from heapq import heappush, heappop
#from collections import deque
#s, t = [int(v) for v in int(input())]


def main():
    k, x = map(int, input().split())

    if k * 500 >= x:
        print("Yes")
    else:
        print("No")


main()


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K,X = map(int, input().split())
if K*500 > X:
	print('YES')
else:
	print('NO')

K,X = map(int, input().split())
if K*500 >= X:
	print('Yes')
else:
	print('No')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
def lcm (a,b):
	if a<b:
		t=a
		a=b
		b=t
	x=a*b
	r=a%b
	while r!=0:
		a=b
		b=r
		r=a%b
	return x/b

[n, m]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
i=0
a_lcm=a[0]
for i in range(n-1):
	a_lcm = lcm(a_lcm,a[i+1])

print(int(((m*2/a_lcm)+1)/2))

[s,t] = [int(x) for x in input().split()]
if 500*s >= t:
	print("Yes")
else:
	print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
def gcd(m,n):
    x = max(m,n)
    y = min(m,n)

    if x%y == 0:
        return y
    else:
        while x%y!=0:
            z = x%y
            x = y
            y = z
        else:
            return z

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

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

skoubaisu = 1
for x in a:
    skoubaisu = lcm(skoubaisu,x)

if M*2 <= skoubaisu:
  print(0)
else:
  print(M//skoubaisu+1)

K,X = [int(x) for x in input().split()]

total = K * 500

if total >= X:
    print("Yes") 
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
value = input().split(' ')
print(value)

K = int(value[0])
Threshold = int(value[1])

if (K*500 >= Threshold):
    print("Yes")
else:
    print("No")

K,X=map(int,input().split())
summ=500*K
if(summ>=X):
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k,x =map(int,input())
if x<=500*k:
  print("Yes")
else:
  print("No")

k,x=map(int,input().split())
if 500*k>=x:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K = int(input())
X = int(input())

total = 500 * K;
answer = 'Yes' if total >= X else 'No';

print(answer);


inputted = list(map(int, input().split()))
K = int(input())
X = int(input())

total = 500 * K;
answer = 'Yes' if total >= X else 'No';

print(answer);


inputted = list(map(int, input().split()))
K = inputted[0]
X = inputted[1]

total = 500 * K;
answer = 'Yes' if total >= X else 'No';

print(answer);


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K,X = map(int, input().split())
v = 500 * K
if s >= X:
    print("Yes")
else:
    print("No")


K,X = map(int, input().split())
v = 500 * K
if v >= X:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k,x=map(int,input(),split())
print("Yes" if 500*k>=x else "No")

k,x=map(int,input().split())
print("Yes" if 500*k>=x else "No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k, n = [int(x) for x input().split()]

if k*500 >= n:
  print("YES")
else:
  print("NO")

k, n = [int(x) for x in input().split()]

if k*500 >= n:
  print("YES")
else:
  print("NO")


k, n = [int(x) for x in input().split()]

if k*500 >= n:
  print("Yes")
else:
  print("No")


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K,X = map(int, input().split())
# N = int(input())

# C = int(input())
# s= input()
print("Yes" if K * 2 >= X else "No")

K,X = map(int, input().split())
# N = int(input())

# C = int(input())
# s= input()
print("Yes" if K * 500 >= X else "No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K = int(input())
print(K)
X = int(input())
print(X)

if 500*K >= X:
	print("Yes")
else:
	print("No")

if 500*K >= X:
	print("Yes")
else:
	print("No")

K, X = map(int, input().split())

if 500*K >= X:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K, X = map(int, input().split())

if 500*K >= X:
    print('YES')
else:
    print('NO')

K, X = map(int, input().split())

if 500*K >= X:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K, X = input().split()
if K * 500 > X:
  print("Yes")
else:
  print("No")

K, X = input().split()
K, X = int(K), int(X)
if K * 500 >= X:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
N,X=map(int, input(),split())
print("Yes" if 500*N >= X else "No")

N,X=map(int, input().split())
print("Yes" if 500*N >= X else "No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k, x = map(int, input().sprit())
if k*500>=x:
  print('Yes')
else:
  print('No')

k, x = map(int, input().split())
if k*500>=x:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K, X = list(map(int, input().split()))
print("yes" if 500 * K >= X else "no" )

K, X = list(map(int, input().split()))
print("Yes" if 500 * K >= X else "No" )

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K,X=map(int, input().split())
if 500*K>X
	print("yes")
else print("no")

K, X = map(int, input().split())
if (500*K>=X):
  print("Yes")
else:
  print("No")


Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k,x=map(int, input()split())

if 500*k >= x:
    print('Yes')
else:
    print('No')

k,x=map(int, input().split())

if 500*k >= x:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K = int(input())
X = int(input())

if K*500 >= X:
  print("Yes")



K = input()
X = input()

if K*500 >= X:
  print("Yes")
else:
  print("No")

K = int(input())
X = int(input())

if K*500 >= X:
  print("Yes")
else:
  print("No")


K,X = map(int, input().split())

if K*500 >= X:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
N = input()
s = list(str(input()))

count = 0

for i in range(len(s)-2):
    if(s[i]+s[i+1]+s[i+2]=="ABC"):
        count += 1

print(count)

S = input().split()
K = int(S[0])
X = int(S[1])

if(500*K >= X):
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
import itertools

n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))

list_range = list(range(1,n+1))
pattern_list = list(itertools.permutations(list_range, n))
pattern_list.sort()
ans = [0] * 2
for i in range(len(pattern_list)):
  if p == list(pattern_list[i]):
    ans[0] = i + 1
  elif q == list(pattern_list[i]):
    ans[1] = i + 1
print(abs(ans[0] - ans[1]))

k, x = map(int,input().split())
if k * 500 >= x:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K,X = map(int,input().split())

if K*2>=X:
  print("Yes")
else:
  print("No")

K,X = map(int,input().split())
 
if K*500>=X:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K,X=input().split()
k=int(K)
x=int(X)
if 500*k>==x:
  print('Yes')
else:
  print('No')

K,X=input().split()
k=int(K)
x=int(X)
if 500*k>=x:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
a,b = int(input()).strip().split()
p = 500 * a
if p >= b:
  print("Yes")
else:
  print("No")

a,b = int(input().strip().split())
p = 500 * a
if p >= b:
  print("Yes")
else:
  print("No")

a,b = input().strip().split()
a = int(a)
b = int(b)
p = 500 * a
if p >= b:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K, X = map(int, input().split())
if 500*K >= X:
  print("Yes")
elif:
  print("No")

K, X = map(int, input().split())
if 500*K >= X:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
a,b =int(input())
if a * 500 >= b:
  print('Yes')
else:print('No')

a,b =map(int,input().split())
if a * 500 >= b:
  print('Yes')
else:print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))

fac = [0] * 8
fac[1] = 1
for i in range(2, N):
    fac[i] = i * fac[i - 1]

a = 0
l = list(range(1, N + 1))
for i in range(N):
    a += l.index(P[i]) * fac[len(l) - 1]
    l.remove(P[i])

b = 0
l = list(range(1, N + 1))
for i in range(N):
    b += l.index(Q[i]) * fac[len(l) - 1]
    l.remove(Q[i])

print(abs(a - b))

k,x = map(int,input().split())
if(k*500 >=x)
	input('Yes')
else:
  input('No')

k,x = map(int,input().split())
if k*500 >=x:
	input('Yes')
else:
  input('No')

k,x = map(int,input().split())
if k*500 >=x:
	print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K, X = map(int(input().split())

if 500*K >= X:
  print("Yes")
else:
  print("No")

K, X = input(), input()

if 500*K >= X:
  print("Yes")
else:
  print("No")

K, X = map(int, input().split())

if 500*K >= X:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
processedIp = input.split(' ')
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

processedIp = input.split(" ")
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

processedIp = input().split(" ")
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
a,b=map(int, input().split())

if (1<=a and a<=100) and (1<= b and b<=100000) :
	if a*500 >= b:
      print("Yes")
    else:
      print("No")
else:
	print("input value is too large")

a,b=map(int, input().split())
 
if (1<=a and a<=100) and (1<= b and b<=100000) :
    if a*500 >= b:
        print("Yes")
    else:
        print("No")
else:
	print("input value is too large")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
a,b=map(int,input().split())

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

a,b=map(int,input().split())
 
if (500*a >= b):
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K, X = input().split()
print(K, X)
if 500 * int(K) >= int(X):
    print('Yes')
else:
    print('No')

K, X = input().split()
if 500 * int(K) >= int(X):
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
A = []
x,y = map(int,input()A.split())

if 500*x-y >= 0:
  print("Yes")
  
  else:
    print("No")

i = input()
x,y = map(int,i.split())

if 500*x-y>=0:
    print("Yes")
else:
        print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k,x = input().split(" ")
if (k*500>=x):
    print('Yes')
else:
    print('No')


k,x = input().split(" ")
val = int(k)*500
if (val>=int(x)):
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K X = map(int,input().split())
if K*500 > X:
    print(Yes)
else:
    print(No)

K,X = map(int,input().split())
if K*500 >= X:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K,M=mao(int,input().split())
if K*500>=M:
  print("Yes")
else:
  print("No")
  

K,M=map(int,input().split())
if K*500>=M:
  print("Yes")
else:
  print("No")
  


Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
def solve():
    N, M = map(int, input().split())
    return 'Yes' if None*500 >= M else 'No'

print(solve())

def solve():
    N, M = map(int, input().split())
    return 'Yes' if N*500 >= M else 'No'

print(solve())

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k,x = input().split(" ")
k = int(k)
x = int(x)

print(k,x)

text = "No"
 
if k*500>=x:
  text = "Yes"
  
print(text)

k,x = input().split(" ")
 
text = "No"
 
if k*500>=x:
  text = "Yes"
  
print(text)


k,x = input().split(" ")
k = int(k)
x = int(x)

print(k,x)

text = "No"
 
if k*500>=x:
  text = "Yes"
  
print(text +"\n")


k,x = input()

text = "No"

if k*500>=x:
  text = "Yes"
  
print(text)

k,x = input().split(" ")


text = "No"
 
if k*500>=x:
  text = "Yes"
  
print(text)



k,x = input().split(" ")
k = int(k)
x = int(x)



text = "No"
 
if k*500>=x:
  text = "Yes"
  
print(text)



Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
n=input()
s=input()

print(s.count("ABC"))

K,X=map(int,input().split())
if 500*K>=X:
	print("Yes")
  else:
  	print("No")


K,X=map(int,input().split())
if 500*K>=X
	print("Yes")
  else
  	print("No")

K,X=map(int,input().split())
if 500*K>=X:
	print("Yes")
else:
  	print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k ,x = map(int,input().split)

if k*500 >= x:
  print('Yes')
else:
  print('No')

k , x = map(int,input().split())

if k*500 >= x:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
print((lambda x:'Yes' if x[1]//500 >= x[0] else 'No')(list(map(int,input().split()))))

print((lambda x:('Yes' if (x[1]//500 >= x[0]) else 'No'))(list(map(int,input().split()))))

print((lambda x:('Yes' if (x[1] <= x[0]*500) else 'No'))(list(map(int,input().split()))))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k, x = map(int, input().spilt())
if 500*k >= x:
	print("Yes")
else:
	print ("No")

k, x = map(int, input().split())
if 500*k >= x:
	print("Yes")
else:
	print ("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
a = list(map(int,input().split()))
if 500 * a[0] >= a[1] :
  print(Yes)
else :
  print(No)

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k,x=map(int.input().split())
if 500*k >= x:
  print('Yes')
else:
  print('No')

k,x=list(map(int,(input().split())))
if 500*k >= x:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
def main():
    K,X = list(map(int,input().split()))
    if(500*k > X):
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()


def main():
    K,X = list(map(int,input().split()))

    price = 500 * K
    if(price >= X):
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()


Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
x,y = map(int,input().split())
if(x*500<y):
  print("NO")
else:
  print("YES")

x,y = map(int,input().split())
if(x*500<y):
  print("No")
else:
  print("Yes")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
n, m = map(int,input().split())
l = list(map(int,input().split()))
 
import math
 
def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x%y)
def lcm(x, y):
    return x * y / gcd(x, y)
 
ans = 1
tf = True
 
for i in l:
    i /= 2
    ans = lcm(ans, i)
    if (ans / i) % 2 == 0 or ans > m:
        print(0)
        tf = False
        break
 
if tf == True:
    print(math.ceil(m / (ans * 2)))

k,x=map(int,input().split())
print('YNeos'[x>500*k::2])

Verdicts: Runtime Error

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
import sys
K, X = map(int, sys.stdin.readline().strip().split())

if K * 500 >= X:
  print('YES')
else:
  print('NO')

import sys
K, X = map(int, sys.stdin.readline().strip().split())

if K * 500 >= X:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
k, x = input().split()
if (k * 500)>=x:
    print("Yes")
else:
    print("No")

k, x = input().split()
if (k * 500)>=x:
    print("Yes")
elif(k*500)<x:
    print("No")

k, x = [int(i) for i in input().split()]
if (k * 500) >= x:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
K, X = input().split()
def main(K,X):
    if(int(K)*500>=X):
        print("Yes")
    else: print("No")

K, X = input().split()
def main(K,X):
    if(int(K)*500>=int(X)):
        return "Yes"
    else:
        return "No"
print(main(K,X))

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has K 500-yen coins. (Yen is the currency of Japan.) If these coins add up to X yen or more, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
n = int(input())
s = input()
cnt = 0
flag = 0
for i in range(n):
  if s[i] == "A":
    flag = 1
  elif s[i] == "B" and flag == 1:
    flag = 2
  elif s[i] == "C" and flag == 2:
    cnt += 1
    flag = 0
  else:
    flag = 0
print(cnt)

k,x = map(int,input().split())
if k*500 >= x:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted