Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
loc = [list(map(int, input().split())) for i in range(N)]
t = 0
x = 0
y = 0
def check(X,Y):
    k=0
    global x,y,t
    for i in range(len(loc)):
        d = (loc[i][0] - t) - (abs(loc[i][1] - X) + abs(loc[i][2] - Y))
        if d %2 ==0 and d >= 0: #（x、y)からはじめに行く位置を探す
            t = loc[i][0]
            x = loc[i][1]
            y = loc[i][2]
            loc.remove(loc[i])
            k =1 #フラグ
            break
         
    if k ==0:
        t = -1  #不可能

while(len(loc) !=0 and t!= -1):
    check(x,y)
    

if t == -1:
    print('No')

elif len(loc) ==0:
    print('Yes')
else:
    print('error') #チェック用

#print(loc)


Fixed submission:
N = int(input())
loc = [list(map(int, input().split())) for i in range(N)]
t = 0
x = 0
y = 0
i = 0
def check(X,Y):
    k=0
    global x,y,t,i
    
    d = (loc[i][0] - t) - (abs(loc[i][1] - X) + abs(loc[i][2] - Y))
    if d %2 ==0 and d >= 0: #（x、y)からはじめに行く位置を探す
        t = loc[i][0]
        x = loc[i][1]
        y = loc[i][2]
        #loc.remove(loc[i])
        k =1 #フラグ
        i += 1
         
    if k ==0:
        t = -1  #不可能

while(i < N and t!= -1):
    check(x,y)
    

if t == -1:
    print('No')

else:
    print('Yes')

#print(loc)
Buggy python submission (verdict: Runtime Error):

N = int(input())
a = [int(input()) for i in range(N)]
a.sort()
for k in range(N-1):
    if a[k] == a[k+1]:
        a[k] =-1

b=[a[k] for k in range(N) if a[k] != -1]

a.remove(-1)
print(len(b))


Fixed submission:

N = int(input())
a = [int(input()) for i in range(N)]
a.sort()
for k in range(N-1):
    if a[k] == a[k+1]:
        a[k] =-1

b=[a[k] for k in range(N) if a[k] != -1]
print(len(b))
Buggy python submission (verdict: Runtime Error):
s=input()
t=input()
 
for i in range(s.size()):
  if s[i]!=t[i]:
    ans += 1
print(ans)

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

Buggy python submission (verdict: Runtime Error):
s=input()
t=input()

for i in s.size():
  if s[i]!==t[i]:
    ans += 1
print(ans)

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

if (a*b) % 2 == 0):
  print('Even')
else:
  print('Odd')


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

if (a*b) % 2 == 0:
  print('Even')
else:
  print('Odd')

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

if((a*b) % 2 == 0){
  print('Even')
} else {
  print('Odd')
}


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

if (a*b) % 2 == 0:
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Runtime Error):
_ = int(input())
bef_time = 0
bef_x = 0
bef_y = 0
ans = True

for i in range(_):
    next = input().split()
    next_time = int(next[0])
    next_x = int(next[1])
    next_y = int(next[2])
    time = next_time - bef_time
    range = abs((next_x - bef_x)) + abs(next_y - bef_y))

    if (next_time - bef_time) < range:
        ans = False
        break

    if time % 2 == 0:
       if  range % 2 != 0:
           ans = False
           break
       else:
           if range % 2 == 0:
              ans = False
              break

    bef_time = next_time
    bef_y = next_y
    bef_x = next_x



if ans == True:
    print('YES')
else:
    print('NO')

Fixed submission:
_ = int(input())
bef_time = 0
bef_x = 0
bef_y = 0
ans = True

for i in range(_):
    next = input().split()
    next_time = int(next[0])
    next_x = int(next[1])
    next_y = int(next[2])
    time = next_time - bef_time
    range = abs(next_x - bef_x) + abs(next_y - bef_y)

    if (next_time - bef_time) < range:
        ans = False
        break

    if time % 2 == 0:
       if range % 2 != 0:
          ans = False
          break
    else:
       if range % 2 == 0 or range == 0:
          ans = False
          break

    bef_time = next_time
    bef_y = next_y
    bef_x = next_x



if ans == True:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
import copy
import collections

def calc(k, balls):
    balls_count = set(copy.copy(balls))
    change_count = 0
    flg = True

    while flg == True:
        if len(balls_count) <= int(k):
            flg = False
            return change_count
        else:
            c = collections.Counter(balls)
            most_common = c.most_common()[-1]
            balls = [i for i in balls if i != most_common[0]]
            balls_count = sorted(set(copy.copy(balls)))
            change_count += int(most_common[1])


_ = input().split()
k = _[1]
balls = sorted(input().split())

print(calc(k, balls))

Fixed submission:
import copy
import collections

def calc(k, balls):
    dif = len(set(copy.copy(balls))) - int(k)
    change_count = 0

    if dif <= 0:
        return change_count
    else:
         c = collections.Counter(balls)
         most_common = c.most_common()[::-1]
         for x in most_common:
             change_count = change_count +  x[1]
             dif = dif - 1
             if dif <= 0 :
                break
         return change_count


_ = input().split()
k = _[1]
balls = sorted(input().split())

print(calc(k, balls))
Buggy python submission (verdict: Runtime Error):
import math
N = int(inpit())
print math.pi*N


Fixed submission:
import math
n = int(input())
print(2*math.pi*n)
Buggy python submission (verdict: Runtime Error):
n = int(input())
print n//2

Fixed submission:
import math
n = int(input())
print(math.ceil(n/2))
Buggy python submission (verdict: Runtime Error):
a = [0]*3
b = [[0]*3]*3
for i in range(3):
	a[i] = list(map(int,input().split()))

n = int(input())

for i in range(n):
  tmp = int(input())
  for j in range(3):
    for k in range(3):
      if a[i][j] == tmp:
        b[i][j] = 1
        if b[i][0]==1 and b[i][1]==1 and b[i][2]==1:
          print('Yes')
          exit()
        elif b[0][j]==1 and b[1][j]==1 and b[2][j] ==1:
          print('Yes')
          exit()
        elif b[0][0]==1 and b[1][1]==1 and b[2][2] ==1:
          print('Yes')
          exit()
        elif b[0][2]==1 and b[1][1]==1 and b[2][0] ==1:
          print('Yes')
          exit()
print('No')


Fixed submission:
ary=[list(map(int,input().split()))for p in range(3)]
for i in range(int(input())):
  data=int(input())
  for j in range(3):
    for k in range(3):
      if ary[j][k]==data:
          ary[j][k]=0
ans="No"
for i in range(3):
  if ary[i][0]==ary[i][1]==ary[i][2]==0 or ary[0][i]==ary[1][i]==ary[2][i]==0:
      ans="Yes"
if ary[0][0]==ary[1][1]==ary[2][2]==0 or ary[2][0]==ary[1][1]==ary[0][2]==0:
    ans="Yes"
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
m = list(map(int,input().split()))
f = True
for i in m:
  if i % 2 == 0:
    if (i % 3 == 0 ) or (i % 5 == 0 ):
      f = True
    else:
      print('DENIED')
      exit()

print('APPROVED')



Fixed submission:
n,m,l = map(int,input().split())
if (n != m) and (n != l ) and (m != l):
  print('No')
elif n == m:
  if n == l:
    print('No')
  else:
    print('Yes')
elif n == l:
  print('Yes')
elif m == l:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
n.m = input().split()
r,b = map(int,input().split())
t = input()
if n == t:
  print(str(r-1) + ' ' + str(b))
else:
  print(str(r) + ' ' + str(b-1))


Fixed submission:
n,m = input().split()
r,b = map(int,input().split())
t = input()
if n == t:
  print(str(r-1) + ' ' + str(b))
else:
  print(str(r) + ' ' + str(b-1))

Buggy python submission (verdict: Runtime Error):
n,m = input().split()
r,b = map(int,input().split())
i = input()
if i == n:
  r = r -1
  print(r + ' ' + b)
else:
  b = b-1
  print(r + ' ' + b)

Fixed submission:
n,m = input().split()
r,b = map(int,input().split())
t = input()
if n == t:
  print(str(r-1) + ' ' + str(b))
else:
  print(str(r) + ' ' + str(b-1))
Buggy python submission (verdict: Runtime Error):
n = int(input())
m = list(map(int,input().split()))
m.sort()
for i in range(n):
  if m[i] == m[i+1]:
    print('NO')
    exit()
    
print('YES')

Fixed submission:
n = int(input())
m = list(map(int,input().split()))
m.sort()
for i in range(n-1):
  if m[i] == m[i+1]:
    print('NO')
    exit()
    
print('YES')
Buggy python submission (verdict: Runtime Error):
n = 10**5
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
    primes.difference_update(range(i*2, n+1, i))
primes=list(primes)

m = int(input())
for i in range(len(primes)):
  if primes[i] < m and m < primes[i+1]:
    print(primes[i+1])
    


Fixed submission:
m = int(input())
if m <= 2 :
  print('2')
else:
  n = 10**6
  primes = set(range(2, n+1))
  for i in range(2, int(n**0.5+1)):
      primes.difference_update(range(i*2, n+1, i))
  primes=list(primes)

  for i in range(len(primes)-1):
    if primes[i] < m and m <= primes[i+1]:
      print(primes[i+1])
Buggy python submission (verdict: Time Limit Exceeded):
import bisect
n = int(input())
m = list(map(int,input().split()))
num=1
for i in range(n):
  if num in m:
    t = m.index(num)
    del m[:t]
    num+=1
  else:
    break

if num == 1:
  print(-1)
else:
  print(n-num+1)

Fixed submission:
n = int(input())
m = list(map(int,input().split()))
num=1
for i in range(n):
  if m[i] == num:
    num+=1
    
if num == 1:
  print(-1)
else:
  print(n-num+1)

Buggy python submission (verdict: Time Limit Exceeded):
import bisect
n = int(input())
m = list(map(int,input().split()))
num=1
for i in range(n):
  if num in m:
    t = m.index(num)
    del m[:t]
    num+=1
if num == 1:
  print(-1)
else:
  print(n-num+1)

Fixed submission:
n = int(input())
m = list(map(int,input().split()))
num=1
for i in range(n):
  if m[i] == num:
    num+=1
    
if num == 1:
  print(-1)
else:
  print(n-num+1)

Buggy python submission (verdict: Time Limit Exceeded):
import bisect
n = int(input())
m = list(map(int,input().split()))
num=1
for i in range(n):
  if num in m:
    m = m[m.index(num):]
    num+=1
if num == 1:
  print(-1)
else:
  print(n-num+1)

Fixed submission:
n = int(input())
m = list(map(int,input().split()))
num=1
for i in range(n):
  if m[i] == num:
    num+=1
    
if num == 1:
  print(-1)
else:
  print(n-num+1)
Buggy python submission (verdict: Time Limit Exceeded):
mod = 1000000007
n = int(input())
num = list(map(int,input().split()))
sum = 0
for i in range(n-1):
  for j in range(i+1,n):
    sum += num[i]^num[j]
print(sum%mod)

Fixed submission:
import numpy as np
mod = 10 ** 9 + 7

n = int(input())
x = np.array([int(a) for a in input().split()])

answer = 0
for d in range(61):
    x, r = x // 2, x % 2
    s = int(r.sum())
    b = (2 ** d) % mod
    answer += (b * s * (n - s)) % mod
print(answer%mod)
Buggy python submission (verdict: Runtime Error):
import sys
m,d = int(input().split())
if m in ('1','3','5','7','8','10','12'):
  if d == '31':
    print('1')
elif m == '2':
  if d == '28':
    print('1')
else:
  print('0')


Fixed submission:
import sys
m,d = input().split()
if m in ('1','3','5','7','8','10','12'):
  if d == '31':
    print('1')
  else:
    print('0')
elif m == '2':
  if d == '28':
    print('1')
  else:
    print('0')
else:
  if d == '30':
    print('1')
  else:
    print('0')
Buggy python submission (verdict: Runtime Error):
import sys
n = int(input())
if n%105==0 or n%104==0 or n%103==0 or n%102==0 or n%101==0 or n%100==0:
	print('1')
    sys.exit()

ans = n%615
if ans < 100:
  ans+=615
for i in range(7):
   for j in range(7):
       for k in range(7):
           for l in range(7):
              for m in range(7):
                   for n in range(7):
                       tmp = 100*i + 101*j + 102*k + 103*l + 104*m + 105*n
                       if ans == tmp:
                            print('1')
                            sys.exit()
                        elif ans < tmp:break
print('0')


Fixed submission:
x=int(input())
n=x//100
if x<100:
    print('0')
else:
    if 100*n<=x and 105*n>=x:
        print('1')
    else:
        print('0')

Buggy python submission (verdict: Runtime Error):
import sys
n = int(input()
ans = n%615
for i in range(7):
    for j in range(7):
        for k in range(7):
            for l in range(7):
                for m in range(7):
                    for n in range(7):
                        tmp = 100*i+101*j + 102*k + 103*l * 104*m + 105*n
                        if ans == tmp:
                            print('1')
                            sys.exit()
                        elif m < tmp:break
print('0')

Fixed submission:
x=int(input())
n=x//100
if x<100:
    print('0')
else:
    if 100*n<=x and 105*n>=x:
        print('1')
    else:
        print('0')
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=map(int,input().split())
m=10**9+7
r=1
C=[0,0,0]
for a in A:
  i=C.index(a)
  r=r*sum([1 if c==a else 0 for c in C])%m
  C[i]+=1
print(r)


Fixed submission:
N=int(input())
A=map(int,input().split())
m=10**9+7
r=1
C=[0,0,0]
for a in A:
    try:
        i=C.index(a)
        r=r*sum([1 if c==a else 0 for c in C])%m
        C[i]+=1
    except:
        print(0)
        exit()
print(r)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

print(S.translate(str.maketrans(alphabet, alphabet[N:] + alphabet[:N])))

Fixed submission:
n = input()
if n == 'SUN':
  print('7')
elif n == 'MON':
  print('6')
elif n == 'TUE':
  print('5')
elif n == 'WED':
  print('4')
elif n == 'THU':
  print('3')
elif n == 'FRI':
  print('2')
elif n == 'SAT':
  print('1')

Buggy python submission (verdict: Runtime Error):
n = int(input())
i_s = input()
out = ''
for s in i_s:
       s = ord(s)
       s = s + n
       if s >= 91 :
            s=s%26 + 25
       s = chr(s)
       out += s

print(out)

Fixed submission:
n = input()
if n == 'SUN':
  print('7')
elif n == 'MON':
  print('6')
elif n == 'TUE':
  print('5')
elif n == 'WED':
  print('4')
elif n == 'THU':
  print('3')
elif n == 'FRI':
  print('2')
elif n == 'SAT':
  print('1')
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = inut()
alp = 'ABCDEFGHJKLMNOPQRSTUVWXYZ'
print(a.tanslate(str.maketrans(alp , alp[:n] + alp[n:])))


Fixed submission:
N = int(input())
S = input()

alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

print(S.translate(str.maketrans(alphabet, alphabet[N:] + alphabet[:N])))
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().partition())
a = list(map(int,input().split()))
b = [0]*(n+1)

c=0
for i,d in enumerate(a):
    c += d-1
    c%= k
    b[i+1] = c

B = {}
count = 0
for i , d in enumerate(b):
    if i > k:
        B[b[i-k]] -= 1
        
    if d in B:
        count += B[d]
        B[d] += 1
    else:
        B[d] = 1
        
print(count)

Fixed submission:
n, k = map(int, input().split())
m = list(map(int, input().split()))
T = [0] * (n + 1)

b = 0
for i, a in enumerate(m):
    b += a - 1
    b %= k
    T[i + 1] = b

tmp = {}
count = 0

for i, b in enumerate(T):
    if i >= k:
        tmp[T[i - k]] -= 1

    if b in tmp:
        count += tmp[b]
        tmp[b] += 1
    else:
        tmp[b] = 1

print(count)
Buggy python submission (verdict: Runtime Error):
print((int(input())**2)

Fixed submission:
n = int(input())
print(n**2)
Buggy python submission (verdict: Runtime Error):
x,y = list(map(int,input().split()))
if x < 10 and y < 10:
	print(x*y)
    exit()
else:
  print('-1')


Fixed submission:
x,y = list(map(int,input().split()))
if x < 10 and y < 10:
	print(x*y)
else:
  print('-1')

Buggy python submission (verdict: Runtime Error):
x,y = list(map(int,input().split()))
if x < 10 abd y < 10:
	print(x*y)
    exit()
else:
  print('-1')


Fixed submission:
x,y = list(map(int,input().split()))
if x < 10 and y < 10:
	print(x*y)
else:
  print('-1')

Buggy python submission (verdict: Runtime Error):
n = int(input())
print(n**2)

Fixed submission:
x,y = list(map(int,input().split()))
if x < 10 and y < 10:
	print(x*y)
else:
  print('-1')
Buggy python submission (verdict: Runtime Error):
from math in sqrt
n = int(input())

m = int(sqrt(n))

print(m*2-1) 

Fixed submission:
import sys
n=int(input())
for i in range(int(n**0.5)+1,0,-1):
  if n%i==0:
    print(i + n//i -2)
    sys.exit()
print(n-1)
Buggy python submission (verdict: Runtime Error):
import bisect

n = int(input())
s = list(map(int,input().split()))
l = sorted(s)
count = 0
for i in range(n-1):
    for j in range(i+1,n):
        limit = l[i] + l[j]
        count += bisect.bisect_left((l,limit)) - (j+1)

print(count)

Fixed submission:
import bisect

n = int(input())
s = list(map(int,input().split()))
l = sorted(s)
count = 0
for i in range(n-1):
    for j in range(i+1,n):
        limit = l[i] + l[j]
        count += bisect.bisect_left(l,limit) - (j+1)

print(count)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
ans = 1
if b>a:
  ans = b//a
  if b%a==0:
  else:
    ans+=1
print(ans)

Fixed submission:
a,b = map(int,input().split())
a-=1
b-=1
if b%a == 0:
    print(b//a)
else:
    print((b//a+1))
Buggy python submission (verdict: Runtime Error):
n,y = map(int.input().split())
y //= 1000
k = min((n-y)//4,y//5)
if 9 * k > 2 * (n-y):
  x = (y-n) - 4 *k
  y = 9 * k - 2*(y-n)
  z = y -5*k
  print(x,y,z)
  exit()
print('-1 -1 -1')

Fixed submission:
n,m = map(int,input().split())
for x in range(n+1):
  for y in range(n+1):
    z = n - x - y
    if (10000*x + 5000*y + 1000*z == m and x + y + z == n and 0 <= z <=n):
        print(x,y,z)
        exit()
print('-1 -1 -1')

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
for x in range(n+1):
  for y in range(n+1):
    z = n - x - y
    if (10000*x + 5000*y + 1000*z == m and \
        x + y + z = m and \
        0 <= z <= n:
        print(x,y,z)
print('-1 -1 -1')
        

Fixed submission:
n,m = map(int,input().split())
for x in range(n+1):
  for y in range(n+1):
    z = n - x - y
    if (10000*x + 5000*y + 1000*z == m and x + y + z == n and 0 <= z <=n):
        print(x,y,z)
        exit()
print('-1 -1 -1')
Buggy python submission (verdict: Runtime Error):
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
if K > 0:
  for i in range(K):
    H.pop(-1)
print(sum(H))

Fixed submission:
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
if K> 0:
    del H[-K:]
print(sum(H))
Buggy python submission (verdict: Runtime Error):
N = input()
A = 0 if N%1000 == 0 else 1000 - N%1000
print(A)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N = int(input())
X = N%1000
A = 0 if X == 0 else A = 1000 - X
print(A)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = 0 if N%1000 == 0 else A = 1000-N%1000
print(A)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N = input()
A = 0 if N%1000 == 0 else A = 1000-N%1000
print(A)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N = input()
A = 0 if N%1000 == 0 else A = (1+N//1000)*1000-N
print(A)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N=input()
print((1+int(N/1000))*1000-N)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
n=input()
print((1+int(n/1000))*1000-n)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N=input()
print((1+int(N/1000))*1000-N)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N=input()
print(1+N/1000)

Fixed submission:
print((10000-int(input()))%1000)

Buggy python submission (verdict: Runtime Error):
N = input()
print(1 + N/1000)

Fixed submission:
print((10000-int(input()))%1000)
Buggy python submission (verdict: Runtime Error):
s = input().strip()
t = input().strip()
print(t+s)

Fixed submission:
a=input()
s,t = a.split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
s=input()
s=input()+s
ptint(s)

Fixed submission:
a=input()
s,t = a.split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
f=lambda n:format(n, 'b')[::-1].find('1')
c=0
C=[0]*3
n=int(input())
L = list(map(int, input().split()))
for i in range(n):C[i]=f(L[i])
  print(min(C))

Fixed submission:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=5
c=10

if a+b+c >= 22:
  print("bust")
else:
  print("win")

Fixed submission:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

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:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

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:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

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:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

Buggy python submission (verdict: Runtime Error):
a1,a2,a3=map(int, input().split()) 
if a+b+c >= 22:
  print("bust")
else:
  print("win")

Fixed submission:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

Buggy python submission (verdict: Runtime Error):
a1,a2,a3=map(int, input().split()) 
if a+b+c >= 22:
  print("bust")
else:
  print("win")

Fixed submission:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

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:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

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:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

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:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

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:
a1,a2,a3=map(int, input().split()) 

if a1+a2+a3>=22:
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Runtime Error):
r=input()
print(r**2)

Fixed submission:
r=int(input())
print(r**2)
Buggy python submission (verdict: Runtime Error):
s,t=input().splitlines()
c=0
for i in range(3):
  if s[i]==t[i]:c+=1
print(c)

Fixed submission:
s=input()
t=input()
c=0
for i in range(3):
  if s[i]==t[i]:c+=1
print(c)

Buggy python submission (verdict: Runtime Error):
s,t=input().split()
c=0
for i in range(3):
  if s[i]==t[i]:c+=1
print(c)

Fixed submission:
s=input()
t=input()
c=0
for i in range(3):
  if s[i]==t[i]:c+=1
print(c)
Buggy python submission (verdict: Runtime Error):
a=int(input())
s=input()
t=s if a>=3200 else red
print(t)

Fixed submission:
a=int(input())
s=input()
t=s if a>=3200 else "red"
print(t)

Buggy python submission (verdict: Runtime Error):
a=input()
s=input()
t=s if a>=3200 else red
print(t)

Fixed submission:
a=int(input())
s=input()
t=s if a>=3200 else "red"
print(t)