Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N = int(input())
A = []
for n in range(N):
    A.append(int(input()))
A = np.array(A)
for n in range(N):
    ind_rm = [n]
    ind = np.ones(N, dtype=bool)
    ind[ind_rm] = False
    print(max(A[ind]))

Fixed submission:
import numpy as np
N = int(input())
A = []
for n in range(N):
    A.append(int(input()))
A = np.array(A)
all_max = np.max(A)
max_ind = np.argmax(A)
max_remove = np.ones(N, dtype=bool)
max_remove[max_ind] = False
second_max = np.max(A[max_remove])
# print(all_max)
# print(second_max)
for n in range(N):
    if n == max_ind:
        print(second_max)
    else:
        print(all_max)

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N = int(input())
A = []
for n in range(N):
    A.append(int(input()))
A = np.array(A)
for n in range(N):
    ind_rm = [n]
    ind = np.ones(N, dtype=bool)
    ind[ind_rm] = False
    A_tmp = [a for a in A if a not in ind_rm]
    print(max(A[ind]))

Fixed submission:
import numpy as np
N = int(input())
A = []
for n in range(N):
    A.append(int(input()))
A = np.array(A)
all_max = np.max(A)
max_ind = np.argmax(A)
max_remove = np.ones(N, dtype=bool)
max_remove[max_ind] = False
second_max = np.max(A[max_remove])
# print(all_max)
# print(second_max)
for n in range(N):
    if n == max_ind:
        print(second_max)
    else:
        print(all_max)
Buggy python submission (verdict: Time Limit Exceeded):
in_ = [int(i) for i in input().split()]
L = in_[0]
R = in_[1]
mod_min = 100000
# L = L % 2019
# R = R % 2019
# tab = [[-1 for r in range(R+1)] for l in range(L+1)]
# print(tab)
i_list = []
j_list = []
for i in range(L, R):
    i_mod = i % 2019
    for j in range(i+1, R+1):
            j_mod = j % 2019
            mod = i_mod * j_mod % 2019
            if mod < mod_min:
                mod_min = mod
                if mod_min == 0:
                    break
print(mod_min)

Fixed submission:
in_ = [int(i) for i in input().split()]
L = in_[0]
R = in_[1]
mod_min = 100000
# L = L % 2019
# R = R % 2019
# tab = [[-1 for r in range(R+1)] for l in range(L+1)]
# print(tab)
i_list = []
j_list = []
for i in range(L, R):
    i_mod = i % 2019
    for j in range(i+1, R+1):
            j_mod = j % 2019
            mod = i_mod * j_mod % 2019
            if mod < mod_min:
                mod_min = mod
                if mod_min == 0:
                    break
    if mod_min == 0:
        break
print(mod_min)

Buggy python submission (verdict: Time Limit Exceeded):
in_ = [int(i) for i in input().split()]
L = in_[0]
R = in_[1]
mod_min = 100000
for i in range(L, R):
    for j in range(i+1, R+1):
        mod = i * j % 2019
        if mod < mod_min:
            mod_min = mod

print(mod_min)

Fixed submission:
in_ = [int(i) for i in input().split()]
L = in_[0]
R = in_[1]
mod_min = 100000
# L = L % 2019
# R = R % 2019
# tab = [[-1 for r in range(R+1)] for l in range(L+1)]
# print(tab)
i_list = []
j_list = []
for i in range(L, R):
    i_mod = i % 2019
    for j in range(i+1, R+1):
            j_mod = j % 2019
            mod = i_mod * j_mod % 2019
            if mod < mod_min:
                mod_min = mod
                if mod_min == 0:
                    break
    if mod_min == 0:
        break
print(mod_min)
Buggy python submission (verdict: Runtime Error):
N, X = list(map(int, input().split()))
L = list(map(int, input().split()))

d = 0
i = 0
while d <= X:
    d += L[i]
    i += 1
print(i)

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

# while d <= X:
#     if i >= i_max:
#         break
#     d += L[i]
#     i += 1
count = 1
total = 0
for i in range(len(L)):
    total += L[i]
    if total <= X:
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

N = int(input())
X,L = [],[]

for _ in range(N):
    x,l = input().split()
    X.append(int(x))
    L.append(int(l))

i = 0
while i < len(X):
    
    if i>0 and X[i]-L[i] <= X[i-1]-L[i-1]:
        X.pop(i-1)
        L.pop(i-1)
    elif i<len(X)-1 and X[i]+L[i] >= X[i+1]+L[i+1]:
        X.pop(i+1)
        L.pop(i+1)
    else:
        i+=1

print(len(X))

Fixed submission:
# -*- coding: utf-8 -*-

H,W,N = [int(input()) for _ in range(3)]

ans = N/max(H,W) if N%max(H,W)==0 else N/max(H,W)+1
print(int(ans))

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

N = int(input())
X,L = [],[]

for _ in range(N):
    x,l = input().split()
    X.append(int(x))
    L.append(int(l))

remove=0
i=1
while (i < len(X)-1):
    if X[i+1]-X[i-1] <= L[i+1]+L[i-1]:
        X.pop(i)
        L.pop(i)
        remove+=1
    else:
        i+=1
print(N-remove)

Fixed submission:
# -*- coding: utf-8 -*-

H,W,N = [int(input()) for _ in range(3)]

ans = N/max(H,W) if N%max(H,W)==0 else N/max(H,W)+1
print(int(ans))
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

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

AC = [False for _ in range(N)]
WA = [0 for _ in range(N)]

for _ in range(M):
    p,s = input().split()
    p = int(p)
    if AC[p]:
        continue
    if s=='AC':
        AC[p] = True
    else:
        WA[p] += 1

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

Fixed submission:
# -*- coding: utf-8 -*-

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

AC = [False for _ in range(N)]
WA = [0 for _ in range(N)]
total_WA = 0

for _ in range(M):
    p,s = input().split()
    p = int(p)-1
    if AC[p]:
        continue
    if s=='AC':
        AC[p] = True
        total_WA += WA[p]
    else:
        WA[p] += 1

print(sum(AC), total_WA)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

"""
計算式は以下のように示される
C_n = (1/n)*(1+C_(n-1)) + ((n-1)/n)*C_(n-1)  =  C_(n-1)+(1/n)
"""
import math
N = int(input())
X = list(map(int, input().split()))

def calc(i):
    if i==1:
        return 1
    return calc(i-1)+(1.0/i)

result = []
for i in range(1, N):
    temp = (X[i]-X[i-1])*calc(i)
    result.append(temp)
    
print(int(sum(result)*math.factorial(N-1)))

Fixed submission:
# -*- coding: utf-8 -*-

N = int(input())
M = [input().split() for i in range(N)]
X = input()

def solver(M,X):
    result = 0
    flag = 0
    for m in M:
        if flag == 1:
            result += int(m[1])
        if m[0]==X:
            flag = 1
    return result

print(solver(M,X))
Buggy python submission (verdict: Runtime Error):
def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

mod = 10**9+7 #出力の制限
N = 10**4
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

for i in range( 2, N + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )
    
X,Y = list(map(int,input().split()))

# a+2b = X
# 2a+b = Y を解く
# -> a = (2Y-X)/3, b = (2X-Y)/3
# (i+1,j+2) の移動が a 回
# (i+2,j+1) の移動が b 回

a = (2*Y-X)/3
b = (2*X-Y)/3 

if not a.is_integer() or not b.is_integer():
    print(0)
    exit(0)

# a回とb回の移動の組み合わせは (a+b)!/a!b!
print(cmb(int(a+b),int(a),mod))

Fixed submission:
mod = 10**9+7

def fact(n):
    ans = 1
    for i in range(2,n+1):
        ans *= i
        ans %= mod
    return ans
    
X,Y = list(map(int,input().split()))

# a+2b = X
# 2a+b = Y を解く
# -> a = (2Y-X)/3, b = (2X-Y)/3
# (i+1,j+2) の移動が a 回
# (i+2,j+1) の移動が b 回

a = (2*Y-X)/3
b = (2*X-Y)/3 

if (X+Y)%3 != 0 or a<0 or b<0:
    print(0)
    exit(0)

# a回とb回の移動の組み合わせは (a+b)!/a!b!
print(fact(int(a+b)) * pow(fact(int(a)),mod-2,mod) * pow(fact(int(b)),mod-2,mod) % mod)
Buggy python submission (verdict: Runtime Error):
import math
a,b,x = map(int,input().split())
if a*a*b/2 >= x:
    print(math.degrees(math.atan(a*b*b/(2*x))))
else:
    print(90-math.degrees(math.atan(a/(2*b-2*x/(a*a)))))


Fixed submission:
import math
a,b,x = map(int,input().split())
if a*a*b/2 >= x:
    print(math.degrees(math.atan(a*b*b/(2*x))))
else:
    print(math.degrees(math.atan((2*b*a*a-2*x)/(a**3))))

Buggy python submission (verdict: Runtime Error):
import math
a,b,x = map(int,input().split())
if a*a*b/2 >= x:
    print(math.degrees(math.atan(a*b*b/(2*x))))
else:
    print(90-math.degrees(math.atan(a/(2*b-2*x/(a*a)))))


Fixed submission:
import math
a,b,x = map(int,input().split())
if a*a*b/2 >= x:
    print(math.degrees(math.atan(a*b*b/(2*x))))
else:
    print(math.degrees(math.atan((2*b*a*a-2*x)/(a**3))))
Buggy python submission (verdict: Runtime Error):
import sympy
A,B = map(int,input().split())
print(1 + len(set(sympy.factorint(A).keys()) & set(sympy.factorint(B).keys())))

Fixed submission:
def fact(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append(i)

    if temp!=1:
        arr.append(temp)

    if arr==[]:
        arr.append(n)

    return arr

A,B = map(int,input().split())
print(len( (set(fact(A))|set([1])) & (set(fact(B))|set([1])) ))
Buggy python submission (verdict: Time Limit Exceeded):
N,M = map(int,input().split())
A = sorted(list(map(int,input().split())))
for i in range(M):
    A = sorted(A)
    A[N-1] //= 2
print(sum(A))

Fixed submission:
import heapq

N,M = map(int,input().split())
A = sorted(list(map(int,input().split())))
A = [i * -1 for i in A]
heapq.heapify(A)
for i in range(M):
    maxA = -1 * heapq.heappop(A)
    heapq.heappush(A,-1*(maxA//2))
print(-sum(A))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
# 文字列内の文字を辞書順ソート
strings = [''.join(sorted(list(input()))) for i in range(n)]
# 重複文字列（＝元の文字列はアナグラムで一致する）と重複度の辞書
dictionaries = [[e, strings.count(e)] for e in set(strings)]
sum = 0
for d in dictionaries :
    q = d[1]
    sum += int(q * (q-1) / 2)
print(sum)

Fixed submission:
n = int(input())
# 文字列内の文字を辞書順ソートしたリストを辞書順ソート
strings = sorted([''.join(sorted(list(input()))) for i in range(n)])
strings.append('XXXXXXXXXX')

ans = 0
s = 0
for i in range(1,n+1) :
    if strings[i] == strings[i-1] :
        s += 1
    else:
        s += 1
        ans += s * (s - 1)
        s = 0
print(int(ans/2))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
# 文字列内の文字を辞書順ソート
strings = [''.join(sorted(list(input()))) for i in range(n)]
# 重複文字列（＝元の文字列はアナグラムで一致する）と重複度の辞書
dictionaries = [[e, strings.count(e)] for e in set(strings)]
sum = 0
for d in dictionaries :
    q = d[1]
    sum += int(q * (q-1) / 2)
print(sum)

Fixed submission:
n = int(input())
# 文字列内の文字を辞書順ソートしたリストを辞書順ソート
strings = sorted([''.join(sorted(list(input()))) for i in range(n)])
strings.append('XXXXXXXXXX')

ans = 0
s = 0
for i in range(1,n+1) :
    if strings[i] == strings[i-1] :
        s += 1
    else:
        s += 1
        ans += s * (s - 1)
        s = 0
print(int(ans/2))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
# 文字列内の文字を辞書順ソート
strings = [''.join(sorted(list(input()))) for i in range(n)]
# 重複文字列（＝元の文字列はアナグラムで一致する）と重複度の辞書
dictionaries = [[e, strings.count(e)] for e in set(strings) if strings.count(e) > 1]
sum = 0
for d in dictionaries :
    q = d[1]
    sum += int(q * (q+1) / 2) - q
print(sum)

Fixed submission:
n = int(input())
# 文字列内の文字を辞書順ソートしたリストを辞書順ソート
strings = sorted([''.join(sorted(list(input()))) for i in range(n)])
strings.append('XXXXXXXXXX')

ans = 0
s = 0
for i in range(1,n+1) :
    if strings[i] == strings[i-1] :
        s += 1
    else:
        s += 1
        ans += s * (s - 1)
        s = 0
print(int(ans/2))
Buggy python submission (verdict: Runtime Error):
import math

n,k = map(int,input().split())
sum = 0
for i in range(1,n+1) :
    if i > k :
        sum += 1
    else :
        sum += math.pow(0.5,math.ceil(math.log2(k/i)))
print(sum/n)

Fixed submission:
import math

n,k = map(int,input().split())
sum = 0
for i in range(1,n+1) :
    if i > k :
        sum += 1
    else :
        sum += math.pow(0.5,math.ceil(math.log2(k/i)))
print(sum/n)
Buggy python submission (verdict: Time Limit Exceeded):
import fractions
N,M=map(int, input().split())
A = [int(a) for a in input().split()]
A2 = [a//2 for a in A]

lcm = A2[0]
for i in range(1, N):
    lcm = lcm * A2[i] // fractions.gcd(lcm, A2[i])

B = sum([1 for a in A if lcm%a==0])
if B>0:
    print(0)
else:
    print((M//lcm+1)//2)

Fixed submission:
import sys
import fractions
N,M=map(int, input().split())
A = [int(a) for a in input().split()]
A2 = [a>>1 for a in A]

lcm = A2[0]
for i in range(1, N):
    lcm = lcm * A2[i] // fractions.gcd(lcm, A2[i])
    if lcm>M:
        print(0)
        sys.exit()
    
B = sum([1 for a in A if lcm%a==0])
if B>0:
    print(0)
else:
    print((M//lcm+1)//2)
Buggy python submission (verdict: Runtime Error):
N,K=map(int, input().split()) 
R,S,P=map(int, input().split()) 
T=input()
SC=0

def MaxScore(n,t):
    SC = 0
    if t[0]=='r':
        SC+=P
    elif t[0]=='s':
        SC+=R
    else:
        SC+=S
    NC=1
    for i in range(1,n):
        if t[i]=='r':
            if t[i]!=t[i-1]:
                SC+=P
                NC=1
            elif t[i]==t[i-1] and NC%2==0:
                SC+=P
                NC+=1
            else:
                NC+=1
        elif t[i]=='s':
            if t[i]!=t[i-1]:
                SC+=R
                NC=1
            elif t[i]==t[i-1] and NC%2==0:
                SC+=R
                NC+=1
            else:
                NC+=1
        else:
            if t[i]!=t[i-1]:
                SC+=S
                NC=1
            elif t[i]==t[i-1] and NC%2==0:
                SC+=S
                NC+=1
            else:
                NC+=1
    return SC

for i in range(K):
    Ti=[T[j] for j in range(N) if j%K==i]
    Ti=''.join(Ti)
    if (N-i)%K==0:
        Ni=(N-i)//K
    else:
        Ni=(N-i)//K+1
    SCi=MaxScore(Ni,Ti)
    SC+=SCi
    
print(SC)         

Fixed submission:
s, t = input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
import numpy as np 

n,u,v=map(int, input().split())
S = []
for _ in range(n-1):
    S.append(list(map(int, input().split())))

pt= [[0]*0 for i in range(n)] 
for i in range(n-1):
    pt[S[i][0]-1].append(S[i][1])
    pt[S[i][1]-1].append(S[i][0])

def bfs(v):
    d=[-1]*n
    d[v-1]=0
    q=[v]
    c=1
    while q:
        q1=[]
        for i in q:
            for j in pt[i-1]:
                if d[j-1]==-1:
                    d[j-1]=c
                    q1.append(j)
        q=q1
        c+=1
        #print(d,q)
    return d
bfs_v=np.array(bfs(v))
bfs_u=np.array(bfs(u))
bfs_v_replace=bfs_v[bfs_v>bfs_u]
answer=np.max(bfs_v_replace)-1
print("{}".format(answer))

Fixed submission:
a = int(input())
b = int(input())

print("{}".format(6-a-b))
Buggy python submission (verdict: Runtime Error):
def main():
    """"ここに今までのコード"""

n = int(input())
A = [int(a) for a in input().split()]
mod=10**9+7

ans=0
for i in range(60):
    l=sum([a>>i & 1 for a in A])
    ans+= l*(n-l) <<i
    ans%= mod
    
print(ans) 

if __name__ == '__main__':
    main()

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):
def main():
    """"ここに今までのコード"""
 
n = int(input())
A = [int(a) for a in input().split()]
mod=10**9+7
 
ans=0
for i in range(60):
    l=sum([a%2 for a in A])
    ans=(ans+l*(n-l)*(2**i))%mod
    A=[a//2 for a in A]

print(int(ans)) 
 
if __name__ == '__main__':
    main()

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):
S=input()

A=['SAT','FRI','THU','WED','THU','MON','SUN']

print(A.index(S)+1)

Fixed submission:
S=input()

A=['SAT','FRI','THU','WED','TUE','MON','SUN']

print(A.index(S)+1)
Buggy python submission (verdict: Runtime Error):
s = [int(input()) for i in range(3)]
target = s[2]
if s[0] >= s[1]:
  long = s[0]
  short = s[1]
else:
  long = s[1]
  short = s[0]

for i in range(short):
  if long * i >= target:
    print(str(i+1))
    return

Fixed submission:
s = [int(input()) for i in range(3)]
target = s[2]
if s[0] >= s[1]:
  long = s[0]
  short = s[1]
else:
  long = s[1]
  short = s[0]
 
for i in range(short):
  if long * (i+1) >= target:
    print(str(i+1))
    break
Buggy python submission (verdict: Runtime Error):
if int(input()) < 1000:
    print('ABC')
else:
    print('ABD')


Fixed submission:
a, b = map(int, input().split())
n = b-a #右の塔はｎ本目
hidari = n*(n-1) / 2 #右（ｎ－１本目）の塔の高さ
ans = hidari - a
print(int(ans))
Buggy python submission (verdict: Runtime Error):
N = input()
Y = input()
x = y = z = 0
z = N
while(1):
    if 10000*x+5000*y+1000*z == Y:
        print x,y,z
        break
    else:
        if z > 0:
            y += 1
            z -= 1
        elif y > 0:
            x += 1
            y = 0
            z =	N - x
        else:
            print -1, -1, -1
            break


Fixed submission:
S = raw_input('')
a = '2018/01/'
b = S[8:]
print a+b
Buggy python submission (verdict: Runtime Error):
N = input('>> ')
Y = input('>> ')
x = y = z = 0
z = N
while(1):
    if 10000*x+5000*y+1000*z == Y:
        print x,y,z
        break
    else:
        if z > 0:
            y += 1
            z -= 1
        elif y > 0:
            x += 1
            y = 0
            z =	N - x
        else:
            print -1, -1, -1
            break

Fixed submission:
a = map(int, raw_input().split())
N = a[0]
Y = a[1]
x = y = z = 0
z = N
while(1):
    if 10000*x+5000*y+1000*z == Y:
        print x,y,z
        break
    else:
        if z > 0:
            y += 1
            z -= 1
        elif y > 0:
            x += 1
            y = 0
            z =	N - x
        else:
            print -1, -1, -1
            break
Buggy python submission (verdict: Runtime Error):
h = int(input())
w = int(input())
n = int(input())

if n / max(h, w) > n:
    print(n // max(h, w) + 1)
elif n / max(h, w) == 1:
    print(1)
elif n / max(h, w) < 1:
    print(1)
else:
    print(n // max(h, w))

Fixed submission:
import math

a, b, t = map(int, input().split())

print( math.floor(t / a) * b )

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

ans = []
minus_num = 0

for num in a:
    if num < 0:
        ans.append( num * -1 )
        minus_num += 1
    else:
        ans.append( num )

if minus_num % 2 == 0:
    print(sum(ans))
else:
    ans.sort()
    print(sum(ans[1:]) + ans[0] * -1)

Fixed submission:
import math

a, b, t = map(int, input().split())

print( math.floor(t / a) * b )

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

ans = []
minus_num = 0

for num in a:
    if num < 0:
        ans.append( num * -1 )
        minus_num += 1
    else:
        ans.append( num )

if minus_num % 2 == 0:
    print(sum(ans))
else:
    ans.sort()
    print(sum(ans[1:]) + ans[0] * -1)

Fixed submission:
import math

a, b, t = map(int, input().split())

print( math.floor(t / a) * b )
Buggy python submission (verdict: Runtime Error):
num = int(input())

s = input()
t = input()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

ans = ''.join(u)

print(ans)

Fixed submission:
num = int(input())

s, t = input().split()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

ans = ''.join(u)

print(ans)

Buggy python submission (verdict: Runtime Error):
num = int(input())

s = input()
t = input()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

print(''.join(u))

Fixed submission:
num = int(input())

s, t = input().split()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

ans = ''.join(u)

print(ans)

Buggy python submission (verdict: Runtime Error):
num = int(input())

s = input()
t = input()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

print(''.join(u))

Fixed submission:
num = int(input())

s, t = input().split()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

ans = ''.join(u)

print(ans)

Buggy python submission (verdict: Runtime Error):
num = int(input())

s = input()
t = input()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

print(''.join(u))


Fixed submission:
num = int(input())

s, t = input().split()
u =[]

for _ in range(num):
  u.append(s[_] + t[_])

ans = ''.join(u)

print(ans)
Buggy python submission (verdict: Runtime Error):
a,b=(int(x), for x in input().splite())
c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Fixed submission:
a=int(input())
b=int(input())

c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=(int(x), for x in input().splite())
c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Fixed submission:
a=int(input())
b=int(input())

c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=(int(x), for x in input().splite())
c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Fixed submission:
a=int(input())
b=int(input())

c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=int(input())
c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)

Fixed submission:
a=int(input())
b=int(input())

c=a+b
if c==3:
    print(3)
elif c==4:
    print(2)
else:
    print(1)
Buggy python submission (verdict: Runtime Error):
a,b,c=(int(x) for x in input().split())

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


Fixed submission:
a,b,c=(int(x) for x in input().split())

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

Buggy python submission (verdict: Runtime Error):
a,b,c=(int(x) for x in input().split())

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


Fixed submission:
a,b,c=(int(x) for x in input().split())

sum =a+b+c
if sum>=22:
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Runtime Error):
char=input()

week=("SUN","MON","TUE","WED","THU","FRI","SAT")

print(7-week.index())


Fixed submission:
char=input()

week=("SUN","MON","TUE","WED","THU","FRI","SAT")

print(7-week.index(char))
Buggy python submission (verdict: Runtime Error):
a,b=int(input())

if a<=10 && b<=10:
  print(a*b)
else:
  print(-1)

Fixed submission:
a,b=(int(x) for x in input().split())
 
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
*a=map(int,input().split())
print(max(a)-min(a))

Fixed submission:
*a,=map(int,input().split())
print(max(a)-min(a))
Buggy python submission (verdict: Runtime Error):
s = input()
k = input()
l = input()
d = l/k
j = l % k
if s > k :  
  if j !=:
    d += 1
    print(d)
else:
  print(d)

Fixed submission:
s = input()
k = input()
l = input()
if s > k :
        d = l/s
        j = l % s
        if j != 0:
                d += 1
                print(d)
        else:
                print(d)
else:
        d = l/k
        j = l % k
        if j != 0:
                d += 1
                print(d)
        else:
                print(d)
Buggy python submission (verdict: Runtime Error):
N = map(int,raw_input()).split()
for i in range(100):
  A = N[0]-(N[1]*2+1)*i
  if A >= 0:
    pass
  else:
    print(i)
    exit()


Fixed submission:
N = map(int,raw_input().split())
for i in range(10):
        A =N[0]-(N[1]*2+1)*i
        if A <= 0:
                print(i)
                exit()
        else:
                pass