Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
str1= input().split()
str2= input().split()

for a,b in zip(str1, str2):
    str3 = str3 + a + b

print (str3)

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

if (a-b==b-c):
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
O=[]
O= input().split()
LO=int(len(O))
E= input().split()
LE=len(E)

flist=[]

for i in range(LO):
    if i>LE:
        a=O[i]
        flist.append(a)
    else:
        a=O[i]+E[i]
        flist.append(a)

print(''.join(flist))


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

if (a-b==b-c):
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
O=[]
O= input().split()
LO=int(len(O))
E= input().split()
LE=len(E)

flist=[]

for i in range(LO):
    if i>LE:
        a=O[i]
        flist.append(a)
    else:
        a=O[i]+E[i]
        flist.append(a)
b=join.flist
print(b)

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

if (a-b==b-c):
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
a, b = map(int,raw_input().split())
if(a > 8 || b > 8):
	print ":("
else:
	print "Yay!"

Fixed submission:
a, b = map(int, input().split())
if(a > 8 or b > 8):
	print(":(")
else:
	print("Yay!")
Buggy python submission (verdict: Runtime Error):
import numpy as np

x,y = map(int, input().split())
z = np.array([x,y])
i = 1

if z[z.argmax()] == 0 or z[z.argmax()] == 1:
    i = 1
else:
    while True:
        amax, amin = z.argmax(), z.argmin()
        z[amin] += z[amax]//2
        z[amax] = 1 if z[amax]%2 else 0
        i+=1
        if (z[z.argmax()] == 0 or z[z.argmax()] == 1): 
            break

print("Brown" if i%2 else "Alice")


Fixed submission:
x = input().split()
for _x in x:
    print(str(_x[0]).capitalize(), end="")

Buggy python submission (verdict: Runtime Error):
import math

n = int(input())
a = list(map(int, input().split()))

cnt = 0
x = []
x.append(a[0])

if a[0] == 0:
    cnt += 1
    if a[1] > 0:
        x[0] = -1
    else:
        x[0] = 1


for i in range(n-1):
    
    if x[i] > 0:
        if x[i]+a[i+1] > -1:
            tmp = int(math.fabs(x[i] + a[i+1]) + 1)
            a[i+1] = a[i+1] - tmp
            cnt += tmp
        x += [x[i] + a[i+1]]
        
    else:
        if x[i]+a[i+1] < +1:
            tmp = int(math.fabs(x[i] + a[i+1]) + 1)
            a[i+1] = a[i+1] + tmp
            cnt += tmp
        x += [x[i] + a[i+1]]

print(cnt)

Fixed submission:
x = input().split()
for _x in x:
    print(str(_x[0]).capitalize(), end="")

Buggy python submission (verdict: Runtime Error):
import math

n = int(input())
a = list(map(int, input().split()))

cnt = 0
x = []
x.append(a[0])

for i in range(n-1):
    if x[i] > 0:
        if x[i]+a[i+1] > -1:
            cnt += math.fabs(x[i] + a[i+1]) + 1
            x += [-1]
        else:
            x += [x[i] + a[i+1]]
        
    else:
        if x[i]+a[i+1] < +1:
            cnt += math.fabs(x[i] + a[i+1]) + 1
            x += [1]
        else:
            x += [x[i] + a[i+1]]

print(int(cnt))

Fixed submission:
x = input().split()
for _x in x:
    print(str(_x[0]).capitalize(), end="")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
b_index = b-a
a_index = b_index - 1
get_height = lambda n: n*(n+1)/2

a_height = get_height(a_index)
b_height = get_height(b_index)
snow_height = b_height - b
print(int(snow_height))

Fixed submission:
N = int(input())
if N >= 1000:
    print('ABD')
else:
    print('ABC')
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
return max(A+B, A-B, A*B)

Fixed submission:
A, B = map(int, input().split())
print(max(A+B, A-B, A*B))
Buggy python submission (verdict: Runtime Error):
# Get input from console, default to string
S = input()
S.sort() # alphabetical sort
if S == 'abc':
  print('Yes')
else:
  print('No')

Fixed submission:
S = input()
#S = ''.join(sorted(list(S)))
if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = map(int, input().split())

def get_candidates(A, B, K):
    """Find matching numbers, return as list"""
    L = B - A + 1 # length of list
    c = set()
    for index, val in enumerate(range(A,B+1)):
        #print(index,val)
        if index < K:
            c.add(val)
        elif index >= max(0, L-K):
            c.add(val)
    #c = sorted(list(c))
    return sorted(list(c))

for n in get_candidates(A, B, K):
    print(n)

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

l1 = list(range(A,min(B+1,A+K)))
l2_lower = max(A,(B+1) - K)
l2 = list(range(l2_lower, B+1))
for n in sorted(list(set(l1+l2))):
    print(n)
Buggy python submission (verdict: Runtime Error):
N = int(input())
D, X = map(int, input().split())
A = list()
for _ in range(N):
    A.append(int(input()))

#print(N,D,X,A)
print(sum(A)*D(D+1)/2 + N*D + X)

Fixed submission:
N = int(input())
D, X = map(int, input().split())
A = list()
for _ in range(N):
    A.append(int(input()))


def count_days(a,D):
    count = 1
    for d in range(2,D+1):
        if a*(d-1)+1 <= D:
            count+=1
    return count

print(sum([count_days(a,D) for a in A])+X)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = list()
for _ in range(N):
    S.append(input())
M = int(input())
for _ in range(M):
    T.append(input())

all_words = set(S+T) # unique strings only
scores = [S.count(w) - T.count(w) for w in all_words]
print(max(0,max(scores)))

Fixed submission:
N = int(input())
S = list()
for _ in range(N):
    S.append(input())
M = int(input())
T = list()
for _ in range(M):
    T.append(input())

all_words = set(S+T) # unique strings only
scores = [S.count(w) - T.count(w) for w in all_words]
print(max(0,max(scores)))

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = list()
for _ in range(N):
    S.append(input())
M = int(input())
for _ in range(M):
    T.append(input())

all_words = set(S+T) # unique strings only
scores = [S.count(w) - T.count(w) for w in all_words]
print(max(0,max(scores)))

Fixed submission:
N = int(input())
S = list()
for _ in range(N):
    S.append(input())
M = int(input())
T = list()
for _ in range(M):
    T.append(input())

all_words = set(S+T) # unique strings only
scores = [S.count(w) - T.count(w) for w in all_words]
print(max(0,max(scores)))
Buggy python submission (verdict: Runtime Error):
N = int(input())
colors = list(map(int, input().split()))
if len(set(colors)) == 3:
  print('Three')
else:
  print('Four')

Fixed submission:
N = int(input())
colors = list(input().split())
if len(set(colors)) == 3:
    print('Three')
else:
    print('Four')
Buggy python submission (verdict: Runtime Error):
N = list(map(int, input()))
ans = 'N'
if N[0] == N[1] and N[0] == N[2]:
    ans = 'Y'¥
elif N[1] == N[2] and N[1] == N[3]:
    ans = 'Y'

if ans == 'Y':
    print('Yes')
else:
    print('No')

Fixed submission:
N = list(map(int, input()))
ans = 'N'
if N[0] == N[1] and N[0] == N[2]:
    ans = 'Y'
elif N[1] == N[2] and N[1] == N[3]:
    ans = 'Y'

if ans == 'Y':
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
que = []

for i in range(N):
    A = int(input())
    q = A in que
    if q == True:
        num = que.index(A)
        que.pop(num)
    else:
        que.append(A)
print(len(que))

Fixed submission:
import collections

N = int(input())
que = [int(input()) for i in range(N)]
count = 0
count_dict = collections.Counter(que)
for k, v in count_dict.items():
    if v % 2 == 1:
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
A.sort()
A.reverse()
que = []

def solve(i):
    if len(que) >=  2:
        return True
    num = A[i]
    check = num in que
    if A.count(num) > 3:
        que.append(num)
        que.append(num)
    elif A.count(num) > 1 and check == False:
        que.append(num)
    if i == N - 1:
        return False
    else:
        return solve(i+1)

a = solve(0)
if a == True:
    ans = que[0] * que[1]
    print(ans)
else:
    print(0)


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

A = abs(x-a)
B = abs(x-b)
if A < B:
    print("A")
else:
    print("B")
Buggy python submission (verdict: Runtime Error):
k, s = map(int, input().split())

x, y, z = 0, 0, 0

an = s - (k * 2)
bn = s - k

if an >= 0:
    x = k - an + 1
    step = 1
    start = 0
    for i in range(x):
        start += step
        step += 1
elif bn >= 0:
    step = 1
    start = 0
    for i in range(k+1):
        start += step
        step += 1

print(start)


Fixed submission:
k, s = map(int, input().split())

count = 0

for x in range(k+1):
    for y in range(k+1):
        z = s-x-y
        if z >= 0 and z <= k:
            count += 1

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = list(input())

min = N
for i in range(N):
    left_parts = S[:i]
    right_parts = S[i:]
    left_count = left_parts.count('W')
    right_count = right_parts.count('E')
    count = left_count + right_count

    if count < min:
        min = count

print(min)

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

countE = S.count('E')
countW = 0
min = countE + countW
for i in range(N):
    if S[i] == 'E':
        countE -= 1
    elif S[i] == 'W':
        countW += 1

    if countE + countW < min:
        min = countE + countW

print(min)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = list(input())

min = N
for border in range(N):
    # 入れ替える回数
    count = 0
    for i in range(N):
        if i < border:
            if S[i] == 'W':
                count += 1
        elif i > border:
            if S[i] == 'E':
                count += 1

        if count > min:
            continue

    if count < min:
        min = count

print(min)

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

countE = S.count('E')
countW = 0
min = countE + countW
for i in range(N):
    if S[i] == 'E':
        countE -= 1
    elif S[i] == 'W':
        countW += 1

    if countE + countW < min:
        min = countE + countW

print(min)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = list(input())

counts = []
for border in range(N):
    # 入れ替える回数
    count = 0
    for i in range(N):
        if i < border:
            if S[i] == 'W':
                count += 1
        elif i > border:
            if S[i] == 'E':
                count += 1

    counts.append(count)

print(min(counts))

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

countE = S.count('E')
countW = 0
min = countE + countW
for i in range(N):
    if S[i] == 'E':
        countE -= 1
    elif S[i] == 'W':
        countW += 1

    if countE + countW < min:
        min = countE + countW

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

for l_index in range(N):
    my_sum = 0
    for r_index in range(l_index, N):
        if my_sum + A[r_index] == my_sum ^ A[r_index]:
            my_sum += A[r_index]
            count += 1
        else:
            break

print(count)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
my_sum = 0
count = 0
r, l = 0, 0

while r < N:
    boo = my_sum + A[r]
    foo = my_sum ^ A[r]
    if boo == foo:
        my_sum += A[r]
        r += 1
        count += (r - l)
    else:
        my_sum -= A[l]
        l += 1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
count = 0

N = int(input())
A = list(map(int, input().split()))
for start in range(0, N):
    for i in range(start, N):
        # 操作すべきリストを作成
        nums = A[start:i + 1]
        sum = 0
        binary = 0
        for s in range(len(nums)):
            sum += nums[s]
            binary = binary^nums[s]

        if sum == binary:
            count += 1

print(count)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
my_sum = 0
count = 0
r, l = 0, 0

while r < N:
    boo = my_sum + A[r]
    foo = my_sum ^ A[r]
    if boo == foo:
        my_sum += A[r]
        r += 1
        count += (r - l)
    else:
        my_sum -= A[l]
        l += 1

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

if __name__ == "__main__":
    a,b = list(map(int,input().split()))
    if a =< 8 and b =< 8:
        print('Yay!')
    else:
        print(':(')

Fixed submission:
#coding : utf-8

if __name__ == "__main__":
    a,b = list(map(int,input().split()))
    if a <= 8 and b <= 8:
        print('Yay!')
    else:
        print(':(')
Buggy python submission (verdict: Runtime Error):
#coding : utf-8

if __name__ == '__main__':

    N = int(input())
    if n < 1000:
        print('ABC')
    else:
        print('ABD')

Fixed submission:
#coding : utf-8

if __name__ == '__main__':

    N = int(input())
    if N < 1000:
        print('ABC')
    else:
        print('ABD')
Buggy python submission (verdict: Runtime Error):

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

cnt = 0

for a in A:
    while (a % 2 == 0):
        cnt = cnt + 1
        a = a / 2

print(cnt)

Fixed submission:
a,b = map(int,input().split())
if (a <= 8 and b <= 8):
    print("Yay!")
else:
    print(":(")
Buggy python submission (verdict: Runtime Error):
a,d = map(int,input().split())
if n == 100:
    print(101 * (100**d))
else:
    print(n * (100**d))


Fixed submission:
d,n = map(int,input().split())
if n == 100:
    print(101 * (100**d))
else:
    print(n * (100**d))

Buggy python submission (verdict: Runtime Error):
a,d = map(int,input().split())
if n == 100:
    print(101 * (100**d))
else:
    print(n * (100**d))

Fixed submission:
d,n = map(int,input().split())
if n == 100:
    print(101 * (100**d))
else:
    print(n * (100**d))

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if n == 100:
    print(101 * (100**d))
else:
    print(n * (100**d))

Fixed submission:
d,n = map(int,input().split())
if n == 100:
    print(101 * (100**d))
else:
    print(n * (100**d))
Buggy python submission (verdict: Runtime Error):
n = int(input().rstrip())
a = [int(v) for v in input().rstrip().split()]

count = 0

for v in a:
    t = v
    while t % 2 == 0:
        t = t / 2
        count += 1

print(count)


Fixed submission:
a, b = [int(v) for v in input().rstrip().split()]

if (a <= 8) and (b <= 8):
    print("Yay!")
else:
    print(":(")

Buggy python submission (verdict: Runtime Error):
D, N = map(int,input().split())
if N != 100:
    print(N*100**D)
else:
    print(N*100**D + 1)
D, N = map(int,input().split())
if N != 100:
    print(N*100**D)
else:
    print((N+1)*100**D)


Fixed submission:
a, b = map(int, input().split())
if a <= 8 and b<= 8:
    print("Yay!")
else:
    print(":(")
Buggy python submission (verdict: Runtime Error):
D, N = map(int,input().split())
if N != 100:
    print(N*100**D)
else:
    print(N*100**D + 1)
D, N = map(int,input().split())
if N != 100:
    print(N*100**D)
else:
    print((N+1)*100**D)


Fixed submission:
D, N = map(int,input().split())
if N != 100:
    print(N*100**D)
else:
    print((N+1)*100**D)
Buggy python submission (verdict: Runtime Error):
N=input()
li = list(map(int,input().split()))

mal = 1
for i in li:
    mal = mal * i
cnt =0
while mal % 2 == 0:
    mal = mal / 2
    cnt += 1
print(cnt)

Fixed submission:
N=input()
li = list(map(int,input().split()))
cnt =0
for i in li:
    while i % 2 == 0:
        i =  i / 2
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
A, B, C = input()
if A + B * 2 >= C:
    print('Yes')
else:
    print('No')


Fixed submission:
A, B, C = map(int,input().split())
if A + B >= C:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
input = str(raw_input())

print("2018"+input[4:])

Fixed submission:
print("2018"+input()[4:])
Buggy python submission (verdict: Runtime Error):
H, W = (int(i) for i in input().split())
t = []
t.append(['.']*(H+2))

for j in range(H):
	tmp = input()
	tmp = '.' + tmp + '.'
	t.append(list(tmp))

t.append(['.']*(H+2))

def CheckBlock(i,k):
	if t[i][k-1] == '#': #check up
		return 0
	elif t[i-1][k] == '#': #check left
		return 1
	elif t[i+1][k] == '#': #check right
		return 2
	elif t[i][k+1] == '#': #check down
		return 3
	else:
		return 4

for i in range(1,W+1):
	for k in range(1,H+1):
		if t[i][k] == '#':
			marker = CheckBlock(i,k)
			if marker == 4:
				print('No')
				quit()
print('Yes')

Fixed submission:
A,B = input().split()

if B >= A: print(int(A))
else: print((int(A)-1))
Buggy python submission (verdict: Runtime Error):
M = int(nput())

print("{}".format(48-M))

Fixed submission:
M = int(input())

print("{}".format(48-M))
Buggy python submission (verdict: Runtime Error):
A,B,C,D = input().split(' ')
A,B,C,D = [int(A),int(B),int(C),int(D)]

L= A + B
R = C + D

if L>R:
	print("Left")
elif L=R:
	print("Balanced")
else:
	print("Right")


Fixed submission:
A,B,C,D = input().split(' ')
A,B,C,D = [int(A),int(B),int(C),int(D)]

L= A + B
R = C + D

if L>R:
	print("Left")
elif L==R:
	print("Balanced")
else:
	print("Right")

Buggy python submission (verdict: Runtime Error):
A,B,C,D = input().split(' ')
A,B,C,D = [int(A),int(B),int(C),int(D)]

L= A + B
R = C + D

if L>R:
	print("Left")
elif L=R:
	print("Balanced")
else:
	print("Right")


Fixed submission:
A,B,C,D = input().split(' ')
A,B,C,D = [int(A),int(B),int(C),int(D)]

L= A + B
R = C + D

if L>R:
	print("Left")
elif L==R:
	print("Balanced")
else:
	print("Right")

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

L=A[0]+A[1]
R=A[2]+A[3]
if L<R: print("Right")
if L=R: print("Balanced")
if L>R: print("Left")

Fixed submission:
A,B,C,D = input().split(' ')
A,B,C,D = [int(A),int(B),int(C),int(D)]

L= A + B
R = C + D

if L>R:
	print("Left")
elif L==R:
	print("Balanced")
else:
	print("Right")
Buggy python submission (verdict: Runtime Error):
#Collecting.py
N,K=input(),input()
x = (int(_) for _ in raw_input().split()) 

for i in range(N):
	if abs(x[i]) < abs(K-x[i]):
		sum += abs(x[i])
	else:
		sum += abs(K-x[i]) 
print(sum)

Fixed submission:
import math
N,K=input(),input()
x = [int(_) for _ in raw_input().split()]
sum = 0

for i in range(N):
	if K < x[i]:
		sum += (x[i]-K)*2
	elif K/2 < x[i]:
		sum += (K-x[i])*2
	else:
		sum += x[i]*2
print(sum)
Buggy python submission (verdict: Runtime Error):
inp = input()
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
if B == 100:
	if A = 0:
		C = 101
	elif A = 1:
		C = 10001
	elif A = 2:
		C = 1000001
print(C) 

Fixed submission:
inp = input()
inp2 = inp.split()
A=int(inp2[0])
B=int(inp2[1])
C = B*(100**A)
if B == 100:
	if A == 0:
		C = 101
	elif A == 1:
		C = 10100
	elif A == 2:
		C = 1010000
print(C)
Buggy python submission (verdict: Runtime Error):
N = int(input())
inp2 = input()
a = inp2.split()
count = 0
for i in range(int(N)):
	b = int(a[i])
	flag = True
	while flag:
		c = b/2
		if c.isinstance(c,int):
			count+=1
		else:
			flag = False

print(count) 

Fixed submission:
N = int(input())
inp2 = input()
a = inp2.split()
count = 0
for i in range(int(N)):
	b = int(a[i])
	flag = True
	c = b
	while flag:
		c = c/2
		if c.is_integer():
			count+=1
		else:
			flag = False

print(count)

Buggy python submission (verdict: Runtime Error):
N = int(input())
inp2 = int(input())
a = inp2.split()
count = 0
for i in range(int(N)):
	b = int(a[i])
	flag = True
	while flag:
		c = b/2
		if c.isinstance(c,int):
			count+=1
		else:
			flag = False

print(count) 

Fixed submission:
N = int(input())
inp2 = input()
a = inp2.split()
count = 0
for i in range(int(N)):
	b = int(a[i])
	flag = True
	c = b
	while flag:
		c = c/2
		if c.is_integer():
			count+=1
		else:
			flag = False

print(count)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

if A < 9 and B < 9:
    print("Yay!")
else:
    print(":(")

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

if A < 9 and B < 9:
    print("Yay!")
else:
    print(":(")

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

if A < 9 and B < 9:
    print("Yay!")
else:
    print(":(")

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

if A < 9 and B < 9:
    print("Yay!")
else:
    print(":(")

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()

if A < 9 and B < 9:
    print(Yay!)
else:
    print(":(")

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

if A < 9 and B < 9:
    print("Yay!")
else:
    print(":(")

Buggy python submission (verdict: Runtime Error):
N = int(input())
a = np.array(input().split()).astype(int)

sum = 0
for i in range(len(a)):
    sum += a[i]%2
print(sum)


Fixed submission:
ui = input()
D, N = int(ui.split()[0]), int(ui.split()[1])
if D <= 8 and N <= 8:
    print('Yay!')
else:
    print(':(')

Buggy python submission (verdict: Runtime Error):
ui = input()

A, B = int(ui.split()[0]), int(ui.split()[1])

def return_ans(A, B):
    if A > 8 or B > 8:
        return ':('
    else:
        return 'Yay!'

a = return_and(A,B)
print(a)

Fixed submission:
ui = input()
D, N = int(ui.split()[0]), int(ui.split()[1])
if D <= 8 and N <= 8:
    print('Yay!')
else:
    print(':(')

Buggy python submission (verdict: Runtime Error):
ui = input()

A, B = int(ui.split()[0]), int(ui.split()[1])

def return_ans(A, B):
    if A > 8 or B > 8:
        return ':('
    else:
        return 'Yay!'

a = return_and(A,B)


Fixed submission:
ui = input()
D, N = int(ui.split()[0]), int(ui.split()[1])
if D <= 8 and N <= 8:
    print('Yay!')
else:
    print(':(')
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = np.array(input().split()).astype(int)

sum = 0
for i in range(len(a)):
    sum += a[i]%2
print(sum)


Fixed submission:
N = int(input())
a = input().split()

sum = 0
for a_int in a:
    a_int = int(a_int)
    count = 0
    flag = 0
    while flag == 0:
        if a_int % 2 == 0:
            a_int = a_int / 2
            count += 1
        else:
            flag = 1
            break
    sum += count
print(sum)
Buggy python submission (verdict: Runtime Error):

if x[1]==100:
    if x[0]==1:
        print(10000)
    if x[0]==2:
        print(10000)
print(x[1],end='')
for _ in range(0,x[0]):
    print('00', end='')



Fixed submission:
x = list(map(int, input().split()))

if x[1]==100:
    print(101,end ='')
else:
    print(str(x[1]),end='')
for _ in range(0,x[0]):
    print('00', end='')
Buggy python submission (verdict: Time Limit Exceeded):

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

x.sort()
count=0

x[0]=x[2]-x[0]
x[1]=x[2]-x[1]


while not(x[0]==1 or x[0]==2):
    x[0]=x[0]-2
    count+=1

while not(x[1]==1 or x[1]==2):
    x[1]=x[1]-2
    count+=1

if (x[0]==1 and x[1]==1):
    print(count+1)
    quit()

if (x[0]==2 and x[1]==2):
    print(count+2)
    quit()

if (x[0]*x[1]==2):
    print(count+3)
    quit()

Fixed submission:
x = list(map(int, input().split()))

x.sort()
count=0

x[0]=x[2]-x[0]
x[1]=x[2]-x[1]

if x[0]%2==0:
    count+=int(x[0]/2)-1
    x[0]=2
else:
    count+=int(x[0]/2)
    x[0]=1
    
if x[1]%2==0:
    count+=int(x[1]/2)-1
    x[1]=2
else:
    count+=int(x[1]/2)
    x[1]=1

if (x[0]==1 and x[1]==1):
    print(count+1)
    quit()

if (x[0]==2 and x[1]==2):
    print(count+2)
    quit()

if (x[0]*x[1]==2):
    print(count+3)
    quit()