Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
ans = [0]*n
for i in range(m):
  s,c = map(int,input().split())
  if ans[s-1] != 0 and ans[s-1] != c:
    print(-1)
    exit()
  elif n != 1 and s == 1 and c == 0:
    print(-1)
    exit()
  else:
    ans[s-1] = c
ans_f = "".join((map(str,ans)))
if n>1 and ans_f[0] == "0":
  print("1"+ans_f[1::])
else:
  print(ans_f)

Fixed submission:
n = int(input())
ans = n//2
if n/2 == ans:
  print(ans)
else:
  print(ans+1)
Buggy python submission (verdict: Runtime Error):
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]

for i in range(3):
    for j in range(3):
        for k in range(n):
            if a[i][j] == b[k]:
                a[i][j] = 0

ans = "No"
for i in range(3):
    if a[i][0] + a[i][1] + a[i][2] == 0:
        ans = "Yes"
    if a[0][i] + a[1][i] + a[2][i] == 0:
        ans = "Yes"
if a[0][0] == a[1][1] == a[2][2] == 0 or a[0][2] == a[1][1] == a[2][0] == 0:
    ans = "Yes
print(ans)

Fixed submission:
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]

for i in range(3):
    for j in range(3):
        for k in range(n):
            if a[i][j] == b[k]:
                a[i][j] = 0

ans = "No"
for i in range(3):
    if a[i][0] + a[i][1] + a[i][2] == 0:
        ans = "Yes"
    if a[0][i] + a[1][i] + a[2][i] == 0:
        ans = "Yes"
if a[0][0] + a[1][1] + a[2][2] == 0:
    ans = "Yes"
if a[0][2] + a[1][1] + a[2][0] == 0:
    ans = "Yes"
print(ans)
Buggy python submission (verdict: Runtime Error):
abc = map(int,input().split())
if len(abc) == len(set(abc)):
  print("No")
  exit()
print("Yes")abc = list(map(int, input().split()))
if len(abc) == len(set(abc)):
    print("No")
    exit()
print("Yes")


Fixed submission:
abc = list(map(int, input().split()))
a = len(set(abc))
if len(set(abc)) == 2:
    print("Yes")
    exit()
print("No")

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    if a[i] % 2 == 0:
        if a[i] % 3 == 0 or a[i] % 5 == 0:
            pass
        else:
            print("DENIED")
            exit()
print("APPROVED")

Fixed submission:
abc = list(map(int, input().split()))
a = len(set(abc))
if len(set(abc)) == 2:
    print("Yes")
    exit()
print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())
for i in range (n):
  if a[i] %2 == 0:
    if a[i] %3 != 0 or a[i] %5 != 0:
      print("DENIED")
      exit()
print("APPROVED")

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    if a[i] % 2 == 0:
        if a[i] % 3 != 0:
            if a[i] % 5 != 0:
                print("DENIED")
                exit()
        if a[i] % 5 != 0:
            if a[i] % 3 != 0:
                print("DENIED")
                exit()
print("APPROVED")
Buggy python submission (verdict: Time Limit Exceeded):
import collections
n = int(input())
s = [input() for _ in range(n)]
wordlist = collections.Counter(s)
values, counts = zip(*wordlist.most_common())
values = list(values)
counts = list(counts)
for cnt in range(len(counts)):
    if counts[cnt] != max(counts):
        cnt -=1
        break
values = values[:cnt+1]
values.sort()
print("\n".join(values))

Fixed submission:
from collections import Counter

N = int(input())
S = []
for i in range(N):
    S.append(input())
S.sort()
c = Counter(S).most_common()
m = c[0][1]
c.sort()
for i in range(len(c)):
    if c[i][1] == m:
        print(c[i][0])
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a>b:
  print(str(b)*a)a,b = map(int,input().split())
if a>b:
  print(str(b)*a)
else:
  print(str(a)*b)

Fixed submission:
a,b = map(int,input().split())
if a>b:
  print(str(b)*a)
else:
  print(str(a)*b)
Buggy python submission (verdict: Runtime Error):
h,w,m = map(int,input().split())
total = 0
if h < w:
  h,w = w,h
for i in range(w):
  total += h
  if total >= m:
    print(i+1)

Fixed submission:
h = int(input())
w = int(input())
m = int(input())
total = 0
if h < w:
  h,w = w,h
for i in range(w):
  total += h
  if total >= m:
    print(i+1)
    exit()
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = []
t = []
for i in range(n):
  s_temp,t_temp = map(int,input().split())
  s.append(s_temp)
  t.append(t_temp)
end = input()
print(sum(t[s.index(end)+1:]))

Fixed submission:
n = int(input())
s = []
t = []
for i in range(n):
  s_temp,t_temp = input().split()
  s.append(s_temp)
  t.append(int(t_temp))
end = input()
print(sum(t[s.index(end)+1:]))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
ans = 0
for i in range(n):
    if s[i] == "A" and s[i + 1] == "B" and s[i + 2] == "C":
        ans += 1
print(ans)


Fixed submission:
n = int(input())
s = input()
ans = 0
for i in range(n):
    if s[i:i+3] == "ABC":
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
def lcm(x, y):
    return (x * y) // math.gcd(x, y)
a,b = map(int,input().split())

print(lcm(a, b))

Fixed submission:
import fractions
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)
a,b = map(int,input().split())

print(lcm(a, b))

Buggy python submission (verdict: Runtime Error):
import math
def lcm(x, y):
    return (x * y) // math.gcd(x, y)
a,b = map(int,input().split())

print(lcm(a, b))

Fixed submission:
import fractions
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)
a,b = map(int,input().split())

print(lcm(a, b))

Buggy python submission (verdict: Runtime Error):
def lcm(x, y):
    return (x * y) // math.gcd(x, y)
a,b = map(int,input().split())

print(lcm(a, b))

Fixed submission:
import fractions
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)
a,b = map(int,input().split())

print(lcm(a, b))
Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
ans = sum(a)
if a >= 22:
  ans = "burst"
else:
  ans = "win"
print(ans)

Fixed submission:
a = list(map(int,input().split()))
ans = sum(a)
if ans >= 22:
  ans = "bust"
else:
  ans = "win"
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
priint(a*a)

Fixed submission:
a = int(input())
print(a*a)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
if n==1:
    print("No")
    exit()

if n % 2 == 0:
    n //= 2
else:
    n = n // 2 + 1
s2 = s[n:]
for i in range(n):
    if s[i] != s2[i]:
        print("No")
        exit()
print("Yes")

Fixed submission:
n = int(input())
s = input()

if n % 2 == 0:
    n //= 2
else:
    print("No")
    exit()
s2 = s[n:]
for i in range(n):
    if s[i] != s2[i]:
        print("No")
        exit()
print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
for i in range(n):
  print(a.index(i+1) + 1,end = " ")

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = [0]*n
for i in range(n):
    ans[a[i]-1] = str(i + 1)
print(" ".join(ans))
Buggy python submission (verdict: Runtime Error):
n,k,q = map(int,input().split())
points = [int(input()) for _ in range(q)]
for i in range(q):
    winner = int(input())
    points[winner - 1] += 1
for i in points:
    if i >0:
        print("Yes")
    else:
        print("No")

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

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = map(int,input().split())
points = [k]*n
for i in range(q):
    winner = int(input())
    for j in range(n):
        points[j] -= 1
    points[winner - 1] += 1
for i in points:
    if i > 0:
        print("Yes")
    else:
        print("No")

Fixed submission:
n,k,q = map(int,input().split())
points = [k-q]*n
for i in range(q):
    winner = int(input())
    points[winner - 1] += 1
for i in points:
    if i >0:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
b = list(map(in,input().split()))
ans = b[0] + b[-1]
for i in range(n-2):
  ans+=min(b[i],b[i-1])
print(ans)

Fixed submission:
n = int(input())
b = list(map(int,input().split()))
ans = b[0] + b[-1]
for i in range(n-2):
  ans+=min(b[i],b[i+1])
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
ans = 0
for i in range(3):
if s[i] == t[i]:
  ans += 1
print(ans)

Fixed submission:
s = input()
t = input()
ans = 0
for i in range(3):
	if s[i] == t[i]:
  		ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
num = 0
while num <b:
  a, b = map(int, input().split())
num = a
ans = 1
while num < b:
    num += a-1
    ans += 1
print(ans)

Fixed submission:
a, b = map(int, input().split())
num = 1

ans = 0
while num < b:
    num += a -1
    ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = []
ans = 0
for i in range(n):
  a.appen(int(input())
print(a)         n = int(input())
a = list(map(int,input().split()))
ans1 = 0
for i in range(n - 1):
    if a[i] >= a[i+1]:
        ans1 += 1
    else:
        ans1 = 0
print(ans1)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
temp = 0
ans = 0
for i in range(n - 1):
    if a[i] >= a[i+1]:
        temp +=1
        ans = max(ans,temp)
    else:
        temp = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
m,d = map(int,input().split())
cnt = 0
for i in range(d):
  temp = str(i)
  if int(temp[0]) >= 2 and int(temp[1]) >= 2 and int(temp[1]) * int(temp[1]) =< m:
    cnt += 1
print(cnt)

Fixed submission:
m,d = map(int,input().split())
cnt = 0
for i in range(d+1):
  d10,d1 = i//10,i%10
  if d10 >= 2 and d1 >= 2 and d1 * d10 <= m:
    cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
m,d = map(int,input().split())
cnt = 0
for i in range(d):
  temp = str(i)
  if int(temp[0]) >= 2 and int(temp[1]) >= 2 and int(temp[1]) * int(temp[1]) =< m:
    cnt += 1

Fixed submission:
m,d = map(int,input().split())
cnt = 0
for i in range(d+1):
  d10,d1 = i//10,i%10
  if d10 >= 2 and d1 >= 2 and d1 * d10 <= m:
    cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = 0
for i in range(1,n+1):
  if (len(i) % 2) != 0:
    ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = 0
for i in range(1,n+1):
  num = str(i)
  if (len(num) % 2) != 0:
    ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = 0
for i in range(1,n+1):
  if len(i) % 2 != 0:
    ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = 0
for i in range(1,n+1):
  num = str(i)
  if (len(num) % 2) != 0:
    ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if (a+b)//2 a,b = map(int,input().split())
if (a+b)/2 == (a+b)//2:
  print((a+b)//2)
else:
  print("IMPOSSIBLE") 

Fixed submission:
a,b = map(int,input().split())
if (a+b)/2 == (a+b)//2:
  print((a+b)//2)
else:
  print("IMPOSSIBLE")

Buggy python submission (verdict: Time Limit Exceeded):
a,b = map(int,input().split())
for k in range(1,10**9):
  if abs(a-k) == abs(b-k):
    print(k)
    exit()
print("IMPOSSIBLE")

Fixed submission:
a,b = map(int,input().split())
if (a+b)/2 == (a+b)//2:
  print((a+b)//2)
else:
  print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
n,d = map(int,input().split())

for i in range(1,21):
  if (i - d) == 1:
    num = i + d
    ans = n / num 
    if ans = int(ans):
      print(ans)
    else:
      print(ans+1)

Fixed submission:
n, d = map(int, input().split())

ans = n / (2 * d + 1)
if ans == int(ans):
    print(int(ans))
    exit()
else:
    print(int(ans) + 1)
    exit()

Buggy python submission (verdict: Runtime Error):
n,d = map(unt,input().split())

for i in range(1,21):
  if (i - d) == 1:
    num = i + d
    ans = n / num 
    if ans = int(ans):
      print(ans)
    else:
      print(ans+1)

Fixed submission:
n, d = map(int, input().split())

ans = n / (2 * d + 1)
if ans == int(ans):
    print(int(ans))
    exit()
else:
    print(int(ans) + 1)
    exit()
Buggy python submission (verdict: Runtime Error):
s = input()
for i in range(4):
  if s[i] != s[i+1]:
    print("Bad")
    exit()
print("Good")

Fixed submission:
s = input()
for i in range(3):
  if s[i] == s[i+1]:
    print("Bad")
    exit()
print("Good")
Buggy python submission (verdict: Runtime Error):
x,a = map(int,input().split())
if x<a:
  print("0")
else:
  print("10!)

Fixed submission:
x,a = map(int,input().split())
if x<a:
  print("0")
else:
  print("10")
Buggy python submission (verdict: Runtime Error):
n,x = map(int.input().split())
l = list(map(int,input().split()))
sum = 0
ans = 0
for i in l:
  sum += i
  if sum <= x:
    ans += 1
    
  

Fixed submission:
n,x = map(int,input().split())
l = list(map(int,input().split()))
sum = 0
ans = 0
for i in l:
  sum += i
  if sum <= x:
    ans += 1
print(ans+1)
Buggy python submission (verdict: Runtime Error):
a,p = map(int,input().split())
print((a*b+p)//2)

Fixed submission:
a,p = map(int,input().split())
print((a*3+p)//2)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
l_max=0
r_min=n 
for i in range(n):
  l,r = map(int,input().split())
  l_max = max(l_max,l)
  r_min = min(r_min,r)
print(r_min - l_max)

Fixed submission:
n,m = map(int,input().split())
l_max=1
r_min=10**5 
for i in range(m):
  l,r = map(int,input().split())
  l_max = max(l_max,l)
  r_min = min(r_min,r)
ans = r_min - l_max + 1
print(ans if ans >= 0 else 0 )
Buggy python submission (verdict: Time Limit Exceeded):
r, g, b, n = map(int, input().split())
ans = 0
for i in range((n//r)+1):
    for j in range((n//g)+1):
        temp = (n - i * r - j * g)
        if temp >=0 and temp % b == 0:
            ans += 1
print(ans)


Fixed submission:
r, g, b, n = map(int, input().split())
ans = 0
for i in range((n//r)+1):
    for j in range((n//g)+1):
        temp = (n - i * r - j * g)
        if temp >=0 and temp % b == 0:
            ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
pattern1 = 0
patetrn2 = 0
for i in range(len(s)):
  if i %2 == 0:
    if s[i] == "0":
      pattern1 += 1
    else:
      patetrn2 += 1
  else:
    if s[i] == "0":
      pattern2 += 1
    else:
      patetrn1 += 1
print(min(patetrn1,patetrn2))

Fixed submission:
s = input()
pattern1 = 0
pattern2 = 0
for i in range(len(s)):
  if i %2 == 0:
    if s[i] == "0":
      pattern1 += 1
    else:
      pattern2 += 1
  else:
    if s[i] == "0":
      pattern2 += 1
    else:
      pattern1 += 1
print(min(pattern1,pattern2))
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input())
print(x + y //2)

Fixed submission:
x,y = map(int,input().split())
print(x + y //2)
Buggy python submission (verdict: Runtime Error):
s = input()
ans = "AC"
if s[0] == "A":
  c_cnt = 0
  for i in range(2,len(s)-1):
    if s[i] == "C":
      c_cnt += 1
  if c_cnt = 1:
    for i in s:
      if i.lower() != "a" and i.lower() != "c" and i.lower() != i:
        ans = "WA"
        break
  else:
    ans = "WA"
else:
  ans = "WA"
print(ans)

Fixed submission:
s = input()
ans = "AC"
if s[0] == "A":
  c_cnt = 0
  for i in range(2,len(s)-1):
    if s[i] == "C":
      c_cnt += 1
  if c_cnt == 1:
    for i in s:
      if i.lower() != "a" and i.lower() != "c" and i.lower() != i:
        ans = "WA"
        break
  else:
    ans = "WA"
else:
  ans = "WA"
print(ans)
Buggy python submission (verdict: Runtime Error):
n,y = map(int,input().split())
for i in range(n+1):
  for j in range(n+1):
    if (y - 1000*i - 5000*j)/10000 = n-i-j:
      print(i,j,n-i-j)
      exit()
print(-1,-1,-1)

Fixed submission:
n,y = map(int,input().split())
for i in range(n+1):
  for j in range(n+1):
    if (y - 1000*i - 5000*j)/10000 == n-i-j and n-i-j>=0:
      print(n-i-j,j,i)
      exit()
print(-1,-1,-1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
d = list(map(int,input().split()))
m = int(input())
t = list(map(int,input().split()))
p = {}
for j in d:
    if j not in p:
        p[j] = 1
    else:
        p[j] += 1
for i in t:
    if p[i] == 0 or i not in p:
        print("NO")
        exit()
    p[i] -= 1
print("YES")

Fixed submission:
n = int(input())
D = list(map(int,input().split()))
m = int(input())
T = list(map(int,input().split()))

p = {}
for d in D:
    if d not in p:
        p[d] = 1
    else:
        p[d] += 1

for t in T:
    if t not in p:
        print('NO')
        exit()
    if p[t] == 0:
        print('NO')
        exit()
    p[t] -= 1
    
print('YES')

Buggy python submission (verdict: Runtime Error):
n = int(input())
d = list(map(int,input().split()))
m = int(input())
t = list(map(int,input().split()))
p = {}
for j in d:
    if j not in p:
        p[j] = 1
    else:
        p[j] += 1
for i in t:
    if p[i] == 0:
        print("NO")
        exit()
    p[i] -= 1
print("YES")

Fixed submission:
n = int(input())
D = list(map(int,input().split()))
m = int(input())
T = list(map(int,input().split()))

p = {}
for d in D:
    if d not in p:
        p[d] = 1
    else:
        p[d] += 1

for t in T:
    if t not in p:
        print('NO')
        exit()
    if p[t] == 0:
        print('NO')
        exit()
    p[t] -= 1
    
print('YES')

Buggy python submission (verdict: Runtime Error):
n = int(input())
d = list(map(int,input().split()))
m = int(input())
t = list(map(int,input().split()))
lst = [0]*200001
for j in d:
    lst[j] += 1
for i in t:
    if lst[i] == 0:
        print("NO")
        exit()
    lst[i] -= 1
print("YES")

Fixed submission:
n = int(input())
D = list(map(int,input().split()))
m = int(input())
T = list(map(int,input().split()))

p = {}
for d in D:
    if d not in p:
        p[d] = 1
    else:
        p[d] += 1

for t in T:
    if t not in p:
        print('NO')
        exit()
    if p[t] == 0:
        print('NO')
        exit()
    p[t] -= 1
    
print('YES')

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
d = list(map(int,input().split()))
m = int(input())
t = list(map(int,input().split()))

for i in t:
    if i not in d:
        print("NO")
        exit()
    d.pop(d.index(i))
print("YES")

Fixed submission:
n = int(input())
D = list(map(int,input().split()))
m = int(input())
T = list(map(int,input().split()))

p = {}
for d in D:
    if d not in p:
        p[d] = 1
    else:
        p[d] += 1

for t in T:
    if t not in p:
        print('NO')
        exit()
    if p[t] == 0:
        print('NO')
        exit()
    p[t] -= 1
    
print('YES')
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = sorted(list(map(int, input().split())))

lst = [0] * max(a)

l1 = 0
l2 = 0

for i in range(n):
    lst[a[i] - 1] += 1
    temp = lst[a[i] - 1]
    if temp >= 4:
        l1 = a[i]
        l2 = a[i]
    elif l1 != a[i] and temp >= 2:
        l1, l2 = a[i], l1
print(l1 * l2)

Fixed submission:
import collections
n = int(input())
a = sorted(list(map(int, input().split())))

cnt = collections.Counter(a)
l1 = 0
l2 = 0

for i in cnt.keys():
    if cnt[i] >= 4:
        l1 = i
        l2 = i
    elif cnt[i] >= 2:
        l1, l2 = i, l1
print(l1 * l2)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = sorted(list(map(int, input().split())))

lst = [0] * max(a)

l1 = 0
l2 = 0

for i in range(n):
    lst[a[i] - 1] += 1
    temp = lst[a[i] - 1]
    if temp >= 4:
        l1 = a[i]
        l2 = a[i]
    elif l1 != a[i] and temp >= 2:
        l1, l2 = a[i], l1
print(l1 * l2)


Fixed submission:
import collections
n = int(input())
a = sorted(list(map(int, input().split())))

cnt = collections.Counter(a)
l1 = 0
l2 = 0

for i in cnt.keys():
    if cnt[i] >= 4:
        l1 = i
        l2 = i
    elif cnt[i] >= 2:
        l1, l2 = i, l1
print(l1 * l2)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(input()) for _ in range(n)]
pos = 1
cnt = 0
passed = []
TF = True
while TF:
  pos -= 1
  if a[pos] in passed:
    TF = False
    print(-1)
  elif a[pos] == 2:
    print(cnt+1)
    TF = False
  else:
    passed.append(a[pos])
    pos = a[pos]
    cnt += 1

Fixed submission:
n = int(input())
a = [int(input()) for _ in range(n)]
pos = 1
cnt = 0
passed = [0]*(n+1)
TF = True
while TF:
  pos -= 1
  temp = a[pos]
  if passed[temp] == 1:
    TF = False
    print(-1)
  elif temp == 2:
    print(cnt+1)
    TF = False
  else:
    passed[temp] = 1
    pos = temp
    cnt += 1
Buggy python submission (verdict: Runtime Error):
n = int(input())
a,b = divmod(n,15)
print(n*800 - 200*a)n = int(input())
a,b = divmod(n,15)
print(n*800 - 200*a)

Fixed submission:
n = int(input())
a,b = divmod(n,15)
print(n*800 - 200*a)
Buggy python submission (verdict: Runtime Error):
if a > b :
    if b == 1:
        print("Bob")
    else:
        print("Alice")
    print("Alice")
elif a <b :
    if a==1:
        print("Alice")
    else:
        print("Bob")
else:
    print("Draw")

Fixed submission:
a, b = map(int, input().split())

if a > b :
    if b == 1:
        print("Bob")
    else:
        print("Alice")
elif a <b :
    if a==1:
        print("Alice")
    else:
        print("Bob")
else:
    print("Draw")
Buggy python submission (verdict: Runtime Error):
    x = int(input())
     
    if x >= 1200:
      print("ARC")
    else:
      print("ABC")

Fixed submission:
x = int(input())

if x >= 1200:
    print("ARC")
else:
    print("ABC")
Buggy python submission (verdict: Runtime Error):
s = input()
ans = 0

for i in range(len(s)-1):
  if s[i] != S[i+1]:
    ans += 1

print(ans)

Fixed submission:
s = input()
ans = 0

for i in range(len(s)-1):
  if s[i] != s[i+1]:
    ans += 1

print(ans)
Buggy python submission (verdict: Runtime Error):
sa = list(input())
sb = list(input())
sc = list(input())
start  = sa.pop(0)

for i in range(399):
  if len(sa) == 0 and start == "a" :
    print("A")
    exit()
  if len(sb) == 0 and start == "b":
    print("B")
    exit()
  if len(sc) == 0 and start == "c":
    print("C")
    exit()
  if start == "a":
    start = sa.pop(0)
  if start == "b":
    start = sb.pop(0)
  if start == "c":
    start = sc.pop(0)


Fixed submission:
a = list(input())
b = list(input())
c = list(input())
next = a.pop(0)
while True:
  if next == "a":
    if a == []:
      print("A")
      break
    else:
      next = a.pop(0)
  elif next == "b":
    if b == []:
      print("B")
      break
    else:
      next = b.pop(0)
  else:
    if c == []:
      print("C")
      break
    else:
      next =c.pop(0)

Buggy python submission (verdict: Runtime Error):
sa = input()
sb = input()
sc = input()
start  = sa.pop(0)

for i in range(399):
  if len(sa) == 0 :
    print("A")
    exit()
  if len(sb) == 0:
    print("B")
    exit()
  if len(sc) == 0:
    print("C")
    exit()
  if start == "a":
    start = sa.pop(0)
  if start == "b":
    start = sb.pop(0)
  if start == "c":
    start = sc.pop(0)

Fixed submission:
a = list(input())
b = list(input())
c = list(input())
next = a.pop(0)
while True:
  if next == "a":
    if a == []:
      print("A")
      break
    else:
      next = a.pop(0)
  elif next == "b":
    if b == []:
      print("B")
      break
    else:
      next = b.pop(0)
  else:
    if c == []:
      print("C")
      break
    else:
      next =c.pop(0)
Buggy python submission (verdict: Runtime Error):
s = list(input())
t = list(input())
ans = []
for i in range(len(s)-len(t)):
  ans.append(0)
  for j in range(len(t)):
    if s[i+j] == t[j]:
      ans[i] += 1
print(len(t) - max(ans))

Fixed submission:
s = list(input())
t = list(input())
ans = []
if len(s)-len(t) == 0:
  an = 0
  for j in range(len(t)):
      if s[j] == t[j]:
        an += 1
  print(len(t)-an)
else:
  for i in range(len(s)-len(t)):
    ans.append(0)
    for j in range(len(t)):
      if s[i+j] == t[j]:
        ans[i] += 1
  print(len(t) - max(ans))