Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03323 (python)

Fixed submission:
input_lines = input()
if int(input_lines.split(" ")[0])<=8 and int(input_lines.split(" ")[1])<=8:
    print("Yay!")
else:
    print(":(")

Buggy submission (verdict: Runtime Error):
import sys
array =[]
for line in sys.stdin.readlines():
    array.append(line.rstrip())
num1 = array[0]
box =list()
num2 = array[1]
print(num2)
for i in range(0,len(num2.split(" "))) :
    box.append(int(num2.split(" ")[i]))
count =0
for j in range(len(box)):
    while(True):
        if box[j]%2==0:
            count+=1
            box[j]=box[j]//2
        else:
            break;
print(count)
Problem p03323 (python)

Fixed submission:

A,B = map(int, raw_input().split())

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

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

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

Buggy submission (verdict: Runtime Error):
if (A <= 8) and (B <= 8):print "Yay!"
else : print ":("
Problem p03324 (python)

Fixed submission:
D,N = map(int, raw_input().split( ))

if N < 100:
	print pow(100,D)*N

else:
	print (N+1)*pow(100,D)

Buggy submission (verdict: Runtime Error):
D,N = map(int, raw_input().split( ))

if N < 100:
	print pow(100,D)*N

else:
	print (N+1)*pow(100,d)

Buggy submission (verdict: Runtime Error):
D,N = map(int, raw_input().split( ))

if n < 100:
	print pow(100,D)*N
else:
	print (N+1)*pow(100,d)
Problem p03434 (python)

Fixed submission:
n = int(input())

a = sorted(list(map(int, input().split())), reverse=True)
ans = sum(a[::2]) - sum(a[1::2])
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())

a = sorted(list(map(int, input().split())), reversed=True)
ans = sum(a[::2]) - sum(a[1::2])
print(ans)
Problem p03485 (python)

Fixed submission:
a, b = map(int, input().split())
import math
x = (a + b) /2 
print(math.ceil(x))

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().sp;it())
print((a+b)//2)

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split)
print((a+b)//2)
Problem p03547 (python)

Fixed submission:
t=input().split(" ")
X=(t[0])
Y =(t[1])
if X>Y:
    print(">")
if X<Y:
    print("<")
if X==Y:
    print("=")

Buggy submission (verdict: Runtime Error):
t=input().split(" ")
X=int(t[0])
Y = int(t[1])
Z = int(t[2])
print((X-Z)//(Y+Z))
Problem p03759 (python)

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

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

Buggy submission (verdict: Runtime Error):
str1= input().split()
str2= input().split()

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

print (str3)

Buggy 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))

Buggy 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)
Problem p03323 (python)

Fixed submission:
a, b = map(int, input().split())
if(a > 8 or b > 8):
	print(":(")
else:
	print("Yay!")

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

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

Buggy 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")

Buggy 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)

Buggy 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))
Problem p03337 (python)

Fixed submission:
A, B = map(int, input().split())
print(max(A+B, A-B, A*B))

Buggy submission (verdict: Runtime Error):
A, B = map(int, input().split())
return max(A+B, A-B, A*B)
Problem p03385 (python)

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 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')
Problem p03400 (python)

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 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)
Problem p03408 (python)

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 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)))

Buggy 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)))
Problem p03424 (python)

Fixed submission:
N = int(input())
colors = list(input().split())
if len(set(colors)) == 3:
    print('Three')
else:
    print('Four')

Buggy submission (verdict: Runtime Error):
N = int(input())
colors = list(map(int, input().split()))
if len(set(colors)) == 3:
  print('Three')
else:
  print('Four')
Problem p03543 (python)

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 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')
Problem p03623 (python)

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 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)
Problem p03625 (python)

Fixed submission:
from collections import Counter

N = int(input())
A = list(map(int, input().split()))
c_dict = Counter(A)
B = []
C = []

for k, v in c_dict.items():
    if v >= 4:
        B.append(k)
    elif v >= 2:
        C.append(k)
B.sort(reverse=True)
C.sort(reverse=True)

if len(B) < 1 and len(C) < 2:
    print(0)
elif len(B) < 1 and len(C) >= 2:
    F = C[1] * C[0]
    print(F)
elif len(B) >= 1 and len(C) == 1:
    D = B[0] ** 2
    E = C[0] * B[0]
    print(max(D, E))
elif len(B) >= 1 and len(C) >= 2:
    D = B[0] ** 2
    E = C[0] * B[0]
    F = C[1] * C[0]
    print(max(D, E, F))

Buggy submission (verdict: Runtime Error):
from collections import Counter

N = int(input())
A = list(map(int, input().split()))
c_dict = Counter(A)
B = []
C = []

for k, v in c_dict.items():
    if v >= 4:
        B.append(k)
    elif v >= 2:
        C.append(k)
B.sort(reverse=True)
C.sort(reverse=True)
print(B[0])
print(C[0])

if len(B) < 1 and len(C) < 2:
    print(0)
elif len(B) < 1 and len(C) >= 2:
    print((C[0]*C[1]))
elif len(B) >= 1 and len(C) == 1:
    print(max(B[0] ** 2), (B[0] * C[0]))
elif len(B) >= 1 and len(C) >= 2:
    C = (B[0] ** 2)
    D = (B[0] * C[0])
    E = (C[0] * C[1])
    print(max(C, D, E))

Buggy 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) > 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)
Problem p03323 (python)

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 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(':(')
Problem p03323 (python)

Fixed submission:
a,b = map(int,input().split())
if (a <= 8 and b <= 8):
    print("Yay!")
else:
    print(":(")

Buggy 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)
Problem p03324 (python)

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

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

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

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

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

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

Buggy 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)
Problem p03323 (python)

Fixed submission:
a, b = map(int, input().split())
if a <= 8 and b<= 8:
    print("Yay!")
else:
    print(":(")

Buggy 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)
Problem p03324 (python)

Fixed submission:
D, N = map(int,input().split())
if N != 100:
    print(N*100**D)
else:
    print((N+1)*100**D)

Buggy 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)
Problem p03325 (python)

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 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)
Problem p03407 (python)

Fixed submission:
A, B, C = map(int,input().split())
if A + B >= C:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
A, B, C = input()
if A + B * 2 >= C:
    print('Yes')
else:
    print('No')
Problem p03469 (python)

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

Buggy submission (verdict: Runtime Error):
input = str(raw_input())

print("2018"+input[4:])
Problem p03359 (python)

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

if B >= A: print(int(A))
else: print((int(A)-1))

Buggy 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')
Problem p03361 (python)

Fixed submission:
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 k in range(1,W+1):
	for i in range(1,H+1):
		if t[i][k] == '#':
			marker = CheckBlock(i,k)
			if marker == 4:
				print('No')
				quit()
print('Yes')

Buggy 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')

Buggy 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)
			#ChangeBlock(i,k,marker)
			if marker == 4:
				print('No')
				quit()
print('Yes')

Buggy 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 issharp(block):
	if block == '#':
		return True
	else: return False

def CheckBlock(i,k):
#   0
# 1 X 2
#   3
	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 issharp(t[i][k]) == True:
			marker = CheckBlock(i,k)
			if marker == 4:
				print('No')
				quit()
print('Yes')
Problem p03473 (python)

Fixed submission:
M = int(input())

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

Buggy submission (verdict: Runtime Error):
M = int(nput())

print("{}".format(48-M))
Problem p03477 (python)

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 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")

Buggy 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")

Buggy 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")
Problem p03598 (python)

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 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)
Problem p03324 (python)

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 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)
Problem p03325 (python)

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 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)

Buggy 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)
Problem p03323 (python)

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

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

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

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

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

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

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

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

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 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)

Buggy 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)

Buggy 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)
Problem p03325 (python)

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 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)
Problem p03324 (python)

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 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='')
Problem p03693 (python)

Fixed submission:
x = list(map(int, input().split()))
y=x[0]*100+x[1]*10+x[2]
oyu=0

if y%4==0: 
    print('YES')
else:
    print('NO')


quit()

Buggy submission (verdict: Runtime Error):

inf=float('inf')
N = int(input())
x = list(map(int, input().split()))
a=[0]*8
b=0
for i in range(0,N):
    if x[i]>=3200:
        b +=1
for j in range(0,8):
    for i in range(0,N):
        if x[i]<400:
            a[j] +=1
            x[i] = inf
        x[i] -= 400

zerox=0
mincolar=0
 
for i in a:
    if i==0:
        zerox +=1  
    else:
        mincolar +=1

if(zerox<b):
    print(mincolar,mincolar+zerox)
else:
    print(mincolar,mincolar+b)


quit()

Buggy submission (verdict: Runtime Error):
N = int(input())
x = list(map(int, input().split()))
a=[0]*8
b=0
for i in range(0,N):
    if x[i]>=3200:
        b +=1
for j in range(0,8):
    for i in range(0,N):
        if x[i]<400:
            a[j] +=1
            x[i] = inf
        x[i] -= 400

zerox=0
mincolar=0
 
for i in a:
    if i==0:
        zerox +=1  
    else:
        mincolar +=1

if(zerox<b):
    print(mincolar,mincolar+zerox)
else:
    print(mincolar,mincolar+b)


quit()
Problem p03695 (python)

Fixed submission:
inf=float('inf')
N = int(input())
x = list(map(int, input().split()))
a=[0]*8
b=0
for i in range(0,N):
    if x[i]>=3200:
        b +=1
        x[i]=inf
for j in range(0,8):
    for i in range(0,N):
        if x[i]<400:
            a[j] +=1
            x[i] = inf
        x[i] -= 400
 
 
mincolar=0
for i in a:
    if i!=0:
        mincolar +=1
if mincolar!=0:
    print(mincolar,mincolar+b)
else:
    print(1,b)
quit()

Buggy submission (verdict: Runtime Error):
N = int(input())
x = list(map(int, input().split()))
a=[0]*8
b=0
for i in range(0,N):
    if x[i]>=3200:
        b +=1
for j in range(0,8):
    for i in range(0,N):
        if x[i]<400:
            a[j] +=1
            x[i] = inf
        x[i] -= 400

zerox=0
mincolar=0
 
for i in a:
    if i==0:
        zerox +=1  
    else:
        mincolar +=1

if(zerox<b):
    print(mincolar,mincolar+zerox)
else:
    print(mincolar,mincolar+b)


quit()
Problem p03711 (python)

Fixed submission:
group=[[1,3,5,7,8,10],[4,6,9,11]\
	,[2]]

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


for i in group:
	for j in i:
		if (x[0]==j):
			for l in i:
				if(x[1]==l):
					print("Yes")
					
					quit()
					
print("No")

Buggy submission (verdict: Runtime Error):

x = list(map(int, input().split()))
a=[input() for i in range(x[0])]

for i in range(x[1]):
    print('#',end="")
print('')
for i in a:
    print('#{0}#'.format(i))
for i in range(x[1]):
    print('#',end="")
print('')