Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

sosu = make_divisors(n)
#print(type(sosu))
kumi = []
for i in range(len(sosu)):
  for j in range(len(sosu)):
    #print(type(sosu[i]))
    if sosu[i]*sosu[j] == n:
      kumi.append([str(sosu[i]), str(sosu[j])])
if len(kumi)%2 == 0:
  print(len(min(kumi[len(kumi)/2])))
else:
  print(len(min(kumi[round(len(kumi)/2)])))
      



Fixed submission:
n = int(input())

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

sosu = make_divisors(n)
#print(type(sosu))
kumi = []
for i in range(len(sosu)):
  for j in range(len(sosu)):
    #print(type(sosu[i]))
    if sosu[i]*sosu[j] == n:
      kumi.append([str(sosu[i]), str(sosu[j])])
#print(kumi)
top = 10000000000
#iter = 0
#if 
for i in kumi[:int(len(kumi)/2)+2]:
  sums = max(len(i[0]), len(i[1]))
  if top > sums:
    top = sums
    #iter = max(len(kumi[0]), len(kumi[1]))
print(top)
Buggy python submission (verdict: Time Limit Exceeded):
def make_divisors(n):
    divisors = 0
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors += 1
            if i != n // i:
              divisors += 1
    return divisors

num = int(input())
ans = 0
for i in range(1, num):
  ans += make_divisors(i)

print(ans)

Fixed submission:
N = int(input())
ans = 0
for a in range(1, N):
  ans += (N-1) // a

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return len(divisors)

num = int(input())
ans = 0
for i in range(1, num):
  ans += make_divisors(i)

print(ans)

Fixed submission:
N = int(input())
ans = 0
for a in range(1, N):
  ans += (N-1) // a

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
table = [0,0,1]
if N >= 4:
  for i in range(3, N):
    table.append((table[i-1] + table[i-3]) % mod)
  print(table[-1] % mod)
elif N == 3:
  print(1)
else:
  print(0)

Fixed submission:
N = int(input())
mod = 10 ** 9 + 7

table = [0,0,1]
if N >= 4:
  for i in range(3, N):
    table.append((table[i-1] + table[i-3]) % mod)
  print(table[-1] % mod)
elif N == 3:
  print(1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
X,N = map(int, input().split())
P = list(map(int, input().split()))

table = [0] * 102
ans = X
dist = 102

for p in range(P):
  table[p] = 1

for i in range(102):
  if table[i] == 1:
    continue
  if abs(i - X) < dist:
    ans = i
    dist = abs(i - X)
  elif abs(i - X) == dist:
    ans = min(i, ans)

Fixed submission:
X,N = map(int, input().split())
P = list(map(int, input().split()))

table = [0] * 102
ans = X
dist = 102

for p in P:
  table[p] = 1

for i in range(102):
  if table[i] != 0:
    continue
  if abs(i - X) < dist:
    ans = i
    dist = abs(i - X)
  elif abs(i - X) == dist:
    ans = min(i, ans)

print(str(ans))

Buggy python submission (verdict: Runtime Error):
X,N = map(int, input().split())
P = list(map(int, input().split()))

table = [0] * 102
ans = X
dist = 102

for p in range(P):
  table[p] = 1

for i in range(102):
  if abs(i - X) < dist:
    ans = i
    dist = abs(i - X)
  elif abs(i - X) == dist:
    ans = min(i, ans)

print(str(ans))

Fixed submission:
X,N = map(int, input().split())
P = list(map(int, input().split()))

table = [0] * 102
ans = X
dist = 102

for p in P:
  table[p] = 1

for i in range(102):
  if table[i] != 0:
    continue
  if abs(i - X) < dist:
    ans = i
    dist = abs(i - X)
  elif abs(i - X) == dist:
    ans = min(i, ans)

print(str(ans))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
a.sort()
ans = 1
max_limit = 10 ** 18
for i in range(N):
  ans *= A[i]
  if ans > max_limit:
    ans = -1
    break

if ans > max_limit:
  print(str(-1))
else:
  print(str(ans))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
A.sort()
ans = 1
max_limit = 10 ** 18
for i in range(N):
  ans *= A[i]
  if ans > max_limit:
    ans = -1
    break

if ans > max_limit:
  print(str(-1))
else:
  print(str(ans))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

ans = 1
max_limit = 10 ** 18
for i in range(N):
  ans *= A[i]

if ans > max_limit:
  print(str(-1))
else:
  print(str(ans))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
A.sort()
ans = 1
max_limit = 10 ** 18
for i in range(N):
  ans *= A[i]
  if ans > max_limit:
    ans = -1
    break

if ans > max_limit:
  print(str(-1))
else:
  print(str(ans))
Buggy python submission (verdict: Time Limit Exceeded):
A, B, C, K = list(map(int, input().split()))

ans = 0
while K:
  K -= 1
  if A:
    ans += 1
    A -= 1
  elif B:
    B -= 1
  else:
    ans -= 1

print(str(ans))

Fixed submission:
A, B, C, K = list(map(int, input().split()))

ans = 0
if A > K:
  print(K)
elif A == K:
  print(A)
elif A + B >= K:
  print(A)
else:
  print(A - (K - A - B))

Buggy python submission (verdict: Time Limit Exceeded):
A, B, C, K = list(map(int, input().split()))

ans = 0
while K:
  if A:
    ans += 1
    A -= 1
  elif B:
    B -= 1
  else:
    ans -= 1
  K -= 1

print(str(ans))

Fixed submission:
A, B, C, K = list(map(int, input().split()))

ans = 0
if A > K:
  print(K)
elif A == K:
  print(A)
elif A + B >= K:
  print(A)
else:
  print(A - (K - A - B))

Buggy python submission (verdict: Time Limit Exceeded):
A, B, C, K = list(map(int, input().split()))

ans = 0
while K:
  if A:
    ans += 1
    A -= 1
  elif B:
    B -= 1
  else:
    ans -= 1

print(str(ans))

Fixed submission:
A, B, C, K = list(map(int, input().split()))

ans = 0
if A > K:
  print(K)
elif A == K:
  print(A)
elif A + B >= K:
  print(A)
else:
  print(A - (K - A - B))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
multi = math.ceil((a + b) / 2)

print(str(multi))

Fixed submission:

import math
a, b = map(int, input().split())
multi = math.ceil((a + b) / 2)

print(str(multi))
Buggy python submission (verdict: Runtime Error):
N, M = list(map(int, input().split())
A = [0 for _ in range(N)]
for i in range(M):
  a, b = list(map(int, input().split())
  A[a-1] += 1
  A[b-1] += 1

for i range(N):
  print(str(A[i]))

Fixed submission:
N, M = list(map(int, input().split()))
A = [0 for _ in range(N)]

for i in range(M):
   a, b = list(map(int, input().split()))
   A[a-1] += 1
   A[b-1] += 1

for i in range(N):
  print(A[i])
Buggy python submission (verdict: Runtime Error):
A = input()
A = A[::-1]
divide = [i[::-1] for i  in ["dream", "dreamer", "erase", "eraser"]]

flag = 1
while flag and A:
  flag = 0
  for word in divide:
    if A.startswith(word):
      A = A[len(word):]
      print(A)
      flag = 1

if len(A) == 0:
  print('YES')
else:
  print('NO')

Fixed submission:
A = input()
A = A[::-1]
divide = [i[::-1] for i  in ["dream", "dreamer", "erase", "eraser"]]

flag = 1
while flag and A:
  flag = 0
  for word in divide:
    if A.startswith(word):
      A = A[len(word):]
      flag = 1

if len(A) == 0:
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
A = input()
A = A[::-1]
divide = [i[::-1] for i  in ["dream", "dreamer", "erase", "eraser"]]
print(A)
print(divide)
flag = 1
while flag and A:
  flag = 0
  for word in divide:
    if A.startswith(word):
      A = A[len(word):]
      print(A)
      flag = 1

if len(A) == 0:
  print('YES')
else:
  print('NO')


Fixed submission:
A = input()
A = A[::-1]
divide = [i[::-1] for i  in ["dream", "dreamer", "erase", "eraser"]]

flag = 1
while flag and A:
  flag = 0
  for word in divide:
    if A.startswith(word):
      A = A[len(word):]
      flag = 1

if len(A) == 0:
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
A = input()
A = A[::-1]
divide = [i[::-1] for i  in ["dream", "dreamer", "erase", "eraser"]]

flag = 1
while flag and A:
  flag = 0
  for word in divide:
    if A.startswith(word): # 先頭が一致したら
      A = A[len(word):] # 該当文字分だけスライス
      print(A)
      flag = 1

if len(A) == 0:
  print('Yes')
else:
  print('No')

Fixed submission:
A = input()
A = A[::-1]
divide = [i[::-1] for i  in ["dream", "dreamer", "erase", "eraser"]]

flag = 1
while flag and A:
  flag = 0
  for word in divide:
    if A.startswith(word):
      A = A[len(word):]
      flag = 1

if len(A) == 0:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int, input().split())
if a >=0:
    if c > 0:
        print(b * d)
    elif d < 0:
        print(a * d)
    else:
        print(b*d)
else:
    if c > 0:
        print(b * c)
    elif d < 0:
        print(a * c)
    else:
        print(b * c)

Fixed submission:
x = int(input())
if x==1:
    print("0")
else:
    print("1")

Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int, input().split())
if a >=0:
    if c > 0:
        print(b * d)
    elif d < 0:
        print(a * d)
    else:
        print(b*d)
else:
    if c > 0:
        print(b * c)
    elif d < 0:
        print(a * c)
    else:
        print(b * c)

Fixed submission:
x = int(input())
if x==1:
    print("0")
else:
    print("1")
Buggy python submission (verdict: Runtime Error):
d, t, s = input().split()
if int(s) * int(t) >= d:
    print("Yes")
else:
    print("No")

Fixed submission:
d, t, s = input().split()
if int(s) * int(t) >= int(d):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split(" ")))

res = 0
for j in range(n):
    sum_i = 0
    for i in range(j):
        sum_i += a[i]
    res = res + a[j]*sum_i
print(res % ((10 **9)+7))

Fixed submission:
n = int(input())
a = list(map(int, input().split(" ")))

res = 0
ruiseki = 0
for j in range(n):
    if j == 0:
        continue
    ruiseki += a[j-1]
    res = res + a[j]*ruiseki
print(res % ((10 **9)+7))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split(" ")))

res = 0
for j in range(n):
    for i in range(j):
        res = res + (a[j] * a[i] % (10**9 +7))
print(res % ((10 **9)+7))

Fixed submission:
n = int(input())
a = list(map(int, input().split(" ")))

res = 0
ruiseki = 0
for j in range(n):
    if j == 0:
        continue
    ruiseki += a[j-1]
    res = res + a[j]*ruiseki
print(res % ((10 **9)+7))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split(" ")))

res = 0
for j in range(n):
    for i in range(j):
        res = res + (a[j] * a[i])
print(res % ((10 **9)+7))

Fixed submission:
n = int(input())
a = list(map(int, input().split(" ")))

res = 0
ruiseki = 0
for j in range(n):
    if j == 0:
        continue
    ruiseki += a[j-1]
    res = res + a[j]*ruiseki
print(res % ((10 **9)+7))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
if (a+b+c)>=22:
    print('bust')
else:
    print('win')


Fixed submission:
a, b, c = [int(x) for x in input().split()]
if a + b + c >= 22:
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Runtime Error):
s=input()
ans = 0
if "RRR" in s: ans = 3
elif "RR" in s: ans = 2
else "R" in s: ans = 1
print(ans)

Fixed submission:
s=input()
ans = 0
if "RRR" in s: ans = 3
elif "RR" in s: ans = 2
elif "R" in s: ans = 1
print(ans)
Buggy python submission (verdict: Runtime Error):
from math import *

def trycut(val):
	ret = 0
	for i in range(n):
		ret += ceil(a[i]/val)-1
	return ret 

n,k=map(int,input().split())
a = [int(i) for i in input().split()]

low = 0
high = 1000000000
ans  =-1

while low <= high:
	mid = (low + high)//2
	cut = trycut(mid)
	if cut <= k:
		high = mid-1
		ans = mid
	else:
		low =  mid+1
print(ans)




Fixed submission:
from math import *

def trycut(val):
	ret = 0
	for i in range(n):
		ret += ceil(a[i]/val)-1
	return ret 

n,k=map(int,input().split())
a = [int(i) for i in input().split()]

low = 0
high = 1000000000
ans  =-1

while low <= high:
	mid = (low + high)/2
	cut = trycut(mid)
	# ~ print("low=",low, "high=", high,"val = ",mid,"ret = ",cut)
	if cut <= k:
		high = mid-0.0000001
		ans = mid
	else:
		low =  mid+0.0000001
	# ~ if low < high: print(low, high, "je reviens")
ans = int(ans*1000000)/1000000
# ~ print(ans)
print(int(ceil(ans)))
Buggy python submission (verdict: Runtime Error):
l,r,d = list(map(int,input()split()))
print(r//d-(l-1)//d)

Fixed submission:
l,r,d=list(map(int,input().split()))
print(r//d-(l-1)//d)
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=list(map(int,input()split()))
ans=0
for i in range(n):
  if i%2==0 and l[i]%2==1:
    ans+=1
print(ans)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
print(sum(1 for i in range(n) if i%2==0 and l[i]%2==1))
Buggy python submission (verdict: Runtime Error):
    n=int(input())
    f=[0]*10005
    for x in range(1,101):
      for j in range(1,101):
        for z in range(1,101):
          c=x**2+j**2+z**2+x*j+j*z+z*x
          if c<=n:
            f[c]+=1
    for i in range(1,n+1):
      print(f[i])

Fixed submission:
n=int(input())
f = [0]*10005

for x in range(1,101):
	for y in range(1,101):
		for z in range(1,101):
			c = x**2+y**2+z**2+x*y+y*z+z*x
			if c<=n: f[c]+=1
for i in range(1,n+1):
	print(f[i])

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
f=[0]*10005
for x in range(1,n+1):
  for j in range(1,n+1):
    for z in range(1,n+1):
      c=x**2+j**2+z**2+x*j+j*z+z*x
      if c<=n:
        f[c]+=1
for i in range(1,n+1):
  print(f[i])

Fixed submission:
n=int(input())
f = [0]*10005

for x in range(1,101):
	for y in range(1,101):
		for z in range(1,101):
			c = x**2+y**2+z**2+x*y+y*z+z*x
			if c<=n: f[c]+=1
for i in range(1,n+1):
	print(f[i])
Buggy python submission (verdict: Runtime Error):
s=input()
if s[1] in "24579":
	print("hon")
else:print("pon" if s[1] in "0168" else "bon")


Fixed submission:
s=input()
if s[-1] in "24579":
	print("hon")
else:print("pon" if s[-1] in "0168" else "bon")
Buggy python submission (verdict: Runtime Error):
def pdebut(s):
	o = 0
	for c in s:
		if c=='(':o+=1
		else: o-=1
		if o<0 : return False
	return o>=0
	
def pfin(s):
	c = 0
	for o in s[::-1]:
		if o==')':
			c+=1
		else:c-=1
		if c<0: return False
	return c>=0
	
def valuer(s):
	o = 0
	for c in s:
		if c=='(':o+=1
		else: o-=1
	return o
	
n = int(input())
val = [0]*(n+1)
tab = []
debut = []
fin = []
milieu = []
for i in range(n):
	s = input()
	tab.append(s)
	if pdebut(s):
		debut+=[i]
	elif pfin(s):
		fin+=[i]
	else:
		val[i] = valuer(s)
		milieu+=[i]

# ~ def cle(x):
	# ~ return -x[1]		
# ~ couples = [[i,val[i]] for i in milieu]
# ~ couples.sort(key = cle)

S = "".join(tab[i] for i in debut)
S+="".join(tab[c[0]] for c in couples)
S+= "".join(tab[i] for i in fin)

# ~ print("debut",debut)
# ~ print("milieu",milieu)
# ~ print("fin",fin)

# ~ print(S)

def Bon(s):
	o = 0
	for c in s:
		if c=='(':o+=1
		else: o-=1
		if o<0 : return False
	return o==0
print("Yes" if Bon(S) else "No")


Fixed submission:
def pdebut(s):
	o = 0
	for c in s:
		if c=='(':o+=1
		else: o-=1
		if o<0 : return False
	return o>=0
	
def pfin(s):
	c = 0
	for o in s[::-1]:
		if o==')':
			c+=1
		else:c-=1
		if c<0: return False
	return c>=0
	
def valuer(s):
	o = 0
	for c in s:
		if c=='(':o+=1
		else: o-=1
	return o
	
n = int(input())
val = [0]*(n+1)
tab = []
debut = []
fin = []
milieu = []
for i in range(n):
	s = input()
	tab.append(s)
	if pdebut(s):
		debut+=[i]
	elif pfin(s):
		fin+=[i]
	else:
		val[i] = valuer(s)
		milieu+=[i]

def cle(x):
	return -x[1]		
couples = [[i,val[i]] for i in milieu]
couples.sort(key = cle)

S = "".join(tab[i] for i in debut)
S+="".join(tab[c[0]] for c in couples)
S+= "".join(tab[i] for i in fin)

# ~ print("debut",debut)
# ~ print("milieu",milieu)
# ~ print("fin",fin)

# ~ print(S)

def Bon(s):
	o = 0
	for c in s:
		if c=='(':o+=1
		else: o-=1
		if o<0 : return False
	return o==0
print("Yes" if Bon(S) else "No")
Buggy python submission (verdict: Runtime Error):
print("A" if input()isupper() else "a")

Fixed submission:
from math import pi
r = float(input())
print(r*2* pi)
Buggy python submission (verdict: Runtime Error):
n=int(input())
t= [0]*(n+1)
l=[int(i) for i in input().split()]
for i in range(2, n+1):
  t[l[i]]+=1
for i in range(1,n+1):
  print(t[i])

Fixed submission:
n=int(input())
t = [0]*(n+1)
A = [int(i) for i in input().split()]
for i in range(n-1):
	t[A[i]]+=1
for i in range(1,n+1):
	print(t[i])
Buggy python submission (verdict: Runtime Error):
t=[]
for i in range(3):
    t.append([int(i) for i in input().split()])
n = int(input())
lst = []
for i in range(n):lst+=[int(input())]
def ligne(i):
    for j in range(3):
        if not t[i][j] in lst:
            return False
    return True
def col(j):
    for i in range(3):
        if not t[i][j] in lst:
            retur False
    return True
def diag1():
    for i in range(3):
        if not t[i][i] in lst:
            return False
    return True
def diag2():
    for i in range(3):
        if not t[2-i][i] in lst:
            return False
    return True
ans = False
for i in range(3):
    ans = ans or ligne(i)
    ans = ans or col(i)
ans  = ans or diag1() or diag2()
if ans :
    print("Yes")
else:
    print("No")

Fixed submission:
t=[]
for i in range(3):
    t.append([int(i) for i in input().split()])
n = int(input())
lst = []
for i in range(n):lst+=[int(input())]
def ligne(i):
    for j in range(3):
        if not t[i][j] in lst:
            return False
    return True
def col(j):
    for i in range(3):
        if not t[i][j] in lst:
            return False
    return True
def diag1():
    for i in range(3):
        if not t[i][i] in lst:
            return False
    return True
def diag2():
    for i in range(3):
        if not t[2-i][i] in lst:
            return False
    return True
ans = False
for i in range(3):
    ans = ans or ligne(i)
    ans = ans or col(i)
ans  = ans or diag1() or diag2()
if ans :
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
from math import *
from itertools import permutations
n = int(input())
p = list(permutations(list(range(1,n+1))))
a = (int(i) for i in input().split())
b = (int(i)for i in input().split())
print(abs(p.index(a) - p.index(b)))

Fixed submission:
from math import *
from itertools import permutations
n = int(input())
p = list(permutations(list(range(1,n+1))))
a = tuple([int(i) for i in input().split()])
b = tuple([int(i)for i in input().split()])
print(abs(p.index(a) - p.index(b)))
Buggy python submission (verdict: Runtime Error):
print(input()+input())

Fixed submission:
s,t = (i for i in input().split())
print(t+s)
Buggy python submission (verdict: Runtime Error):
def isprime(n):
  if n<10:
    return n in (2,3,5,7)
  for i in range(int(2,sqrt(n)+1)):
    if n%i==0:
      return False
  return True

x = int(input())
for d in range(x,x+300):
  if isprime(d):
    print(d)
    break

Fixed submission:
from math import *

def isprime(n):
	if n<10:
		return n in (2,3,5,7)
	for i in range(2,int(sqrt(n)+1)):
		if n%i==0:
			return False
	return True
 
x = int(input())
for d in range(x,x+300):
	if isprime(d):
		print(d)
		break
Buggy python submission (verdict: Runtime Error):
    def f(n):
      d = 2
      ans = 0
      while n>d:
        d*=5
        n//=d
        ans+=n
      return ans
     
    print(f(int(input())))

Fixed submission:
def f(n):
  ans = 0
  while n>0:
    n//=5
    ans+=n
  return ans

x = int(input())
print(0 if x%2 else f(x//2))

Buggy python submission (verdict: Runtime Error):
def f(n):
  d = 2
  ans = 0
  while n>d:
    d*=5
    n//=d
    ans+=n
  return ans

print(f(int(input()))

Fixed submission:
def f(n):
  ans = 0
  while n>0:
    n//=5
    ans+=n
  return ans

x = int(input())
print(0 if x%2 else f(x//2))

Buggy python submission (verdict: Time Limit Exceeded):
def f(n,x):
  ret = 0
  while n>0:
    n = (n+x-1)//x
    ret+=n
  return ret

n = int(input())
print(min(f(n,2), f(n,5)))

Fixed submission:
def f(n):
  ans = 0
  while n>0:
    n//=5
    ans+=n
  return ans

x = int(input())
print(0 if x%2 else f(x//2))
Buggy python submission (verdict: Runtime Error):
s=input()
ans = 0
for i in range(len(s)//2+1):
	if s[i] != s[len(s)-1-i]:
    	ans+=1
        
print(ans)

Fixed submission:
s=input()
ans = 0
for i in range(len(s)//2):
 if s[i] != s[len(s)-1-i]:
  ans+=1

print(ans)
Buggy python submission (verdict: Runtime Error):
s = int(input())
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%2!=0 and s[i] in "LUD") for i in range(len(s))) else "No")

Fixed submission:
s=input()
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%2!=0 and s[i] in "LUD") for i in range(len(s))) else "No")

Buggy python submission (verdict: Runtime Error):
s = input()
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%2!=0 and s[i] in "LUD")) for i in range(len(s)) else "No")


Fixed submission:
s=input()
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%2!=0 and s[i] in "LUD") for i in range(len(s))) else "No")

Buggy python submission (verdict: Runtime Error):
s=input()
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%2!=0 and s[i] in "LUD") for i in range(len(s)) else "No")

Fixed submission:
s=input()
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%2!=0 and s[i] in "LUD") for i in range(len(s))) else "No")

Buggy python submission (verdict: Runtime Error):
s=input()
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%!==0 and s[i] in "LUD)) else "No")

Fixed submission:
s=input()
print("Yes" if all((i%2==0 and s[i] in "RUD") or (i%2!=0 and s[i] in "LUD") for i in range(len(s))) else "No")
Buggy python submission (verdict: Runtime Error):
n, k, q = (int(i) for i in input().split())
a = [k]*n
d = [0] + [a[i]-a[i-1] for i in  range(1,n)]+[0]
for i in range(q):
  x = int(input())-1
  d[0]-=1
  d[x]+=1
  d[x+1]-=1
  d[n]+=1
a[0]+=d[0]
for i in range(1,n): a[i] = a[i-1]+d[i]
for i in range(n): printf("Yes" if a[i]>0 else "No")

Fixed submission:
n,k,q = (int(i) for i in input().split())
a = [k]*n
d = [0]*(n+1)
for i in range(q):
	x = int(input())-1
	d[0]-=1
	d[x]+=1
	d[x+1]-=1
a[0] += d[0]
for i in range(1,n):
	a[i] = a[i-1] + d[i]
for i in range(n):
	print("Yes" if a[i]>0 else "No")

Buggy python submission (verdict: Runtime Error):
n,k,q = (int(i) for i in input().split())
a = [k]*n
d = [0] + [a[i]-a[i-1] for i in range(1,n)]
for i in range(q):
	x = int(input())-1
	d[0]-=1
	d[x]+=1
	d[x+1]-=1
a[0]+=d[0]
for i in range(1,n): a[i] = a[i-1]+d[i]
for i in range(n):print("Yes" if a[i]>0 else "No")


Fixed submission:
n,k,q = (int(i) for i in input().split())
a = [k]*n
d = [0]*(n+1)
for i in range(q):
	x = int(input())-1
	d[0]-=1
	d[x]+=1
	d[x+1]-=1
a[0] += d[0]
for i in range(1,n):
	a[i] = a[i-1] + d[i]
for i in range(n):
	print("Yes" if a[i]>0 else "No")
Buggy python submission (verdict: Runtime Error):
s = map(int, input().split())
d = s[0]
t = s[1]
s = s[2]
if d >= t * s:
  print("Yes")
else:
  print("No")

Fixed submission:
s = input().split()
d = int(s[0])
t = int(s[1])
s = int(s[2])
if d <= t * s:
  print("Yes")
else:
  print("No")