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

Fixed submission:
def euclid(A,B):

    big = max(A,B)
    small = min(A,B)

    r = big % small
    while r != 0:
        big = small
        small = r
        r = big % small
    
    return small


def LCM(A,B):
    return A*B//euclid(A,B)
    

N = int(input())

time = 1
for i in range(N):
    T = int(input())
    time = LCM(time,T)

print(time)

Buggy submission (verdict: Runtime Error):
def euclid(A,B):

    big = max(A,B)
    small = min(A,B)

    r = big % small
    while r != 0:
        big = small
        small = r
        r = big % small
    
    return small


def LCM(A,B):
    return int(A*B/euclid(A,B))
    

N = int(input())

time = 1
for i in range(N):
    T = int(input())
    time = LCM(time,T)

print(time)

Buggy submission (verdict: Runtime Error):
N = int(input())
T = []
for i in range(N):
    T.append(int(input()))

T.sort(reverse = True)

def GCD(a,b):
    if a>=b:
        bigger = a
        smaller = b
    else:
        smaller = a
        bigger = b
        
    if smaller == 0:
        return bigger
    else:
        return GCD(smaller, bigger%smaller)

def GCF(a,b):
    return int((a*b)/GCD(a,b))

if N == 1:
    print(T[0])
elif N == 2:
    print(GCF(T[0],T[1]))
else:
    tmp = GCF(T[0],T[1])
    for i in range(2,N):
        tmp = GCF(tmp,T[i])
    print(tmp)
Problem p03760 (python)

Fixed submission:
O = input()
E = input()

olen = len(O)
elen = len(E)

word = ""

if olen==elen:
    for i in range(olen):
        word = word + O[i] + E[i]
else:
    for i in range(elen):
        word = word + O[i] + E[i]
    word = word + O[olen-1]

print(word)

Buggy submission (verdict: Runtime Error):
O = input()
E = input()

password = ""
for i in range(len(E)):
    password = password + O[i] + E[i]

if len(E)%2 == 1:
    print(password)
else:
    password = password + O[len(O)]
    print(password)

Buggy submission (verdict: Runtime Error):
O = input()
E = input()

password = ""
for i in range(len(E)):
    password = password + O[i] + E[i]

if len(E)%2 == 1:
    print(password)
else:
    password = password + O[len(O)]
    print(password)
Problem p03845 (python)

Fixed submission:
N = int(input())

t = input().split()
T = []
for i in range(N):
    T.append(int(t[i]))

M = int(input())

time = []
total = sum(T)
for k in range(M):
    p,x = (int(i) for i in input().split())
    time.append(total - T[p-1] + x)

for i in range(M):
    print(time[i])

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

t = input().split()
T = []
for i in range(N):
    T.append(int(t[i]))

M = int(input())

time = []
total = sum(T)
for k in range(M):
    p,x = (int(i) for i in input().split())
    time.append（total - T[p] + x)

print(time)

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

t = input().split()
T = []
for i in range(N):
    T.append(int(t[i]))

M = int(input())

time = []
total = sum(T)
for i in range(M):
    p,x = (int(i) for i in input().split())
    time.append（total - T[p] + x)

print(time)
Problem p03998 (python)

Fixed submission:
A = input()
B = input()
C = input()

throw = "a"
a = 0
b = 0
c = 0

while True:
    if throw == "a":
        if a == len(A):
            print("A")
            break       
        throw = A[a]
        a += 1
    elif throw == "b":
        if b == len(B):
            print("B")
            break
        throw = B[b]
        b += 1
    elif throw == "c":
        if c == len(C):
            print("C")
            break
        throw = C[c]
        c += 1

Buggy submission (verdict: Runtime Error):
SA = input()
SB = input()
SC = input()

A = []
for i in range(len(SA)):
    tmp = SA[i]
    A.append(tmp)

B = []
for i in range(len(SB)):
    tmp = SB[i]
    B.append(tmp)

C = []
for i in range(len(SC)):
    tmp = SC[i]
    C.append(tmp)

suteru = A[0]
A.remove(A[0])

lenA = len(A)

have = True
while have:
    if suteru == "a":
        suteru = A[0]
        A.remove(A[0])
        if len(A) == 0:
            moji = "A"
            have = False
    elif suteru == "b":
        suteru = B[0]
        B.remove(B[0])
        if len(B) == 0:
            moji = "B"
            have = False
    elif suteru == "c":
        suteru == C[0]
        C.remove(C[0])
        if len(C) == 0:
            moji = "C"
            have = False

if lenA == 1:
    print("A")
else:
    print(moji)
Problem p04043 (python)

Fixed submission:
A,B,C = (int(i) for i in input().split())

Addition = A+B+C
if Addition != 17:
    haiku = False
else:
    if ((A==5 or A==7) and (B==5 or B==7) and (C==5 or C==7)):
        haiku = True
    else:
        haiku = False
    
if haiku:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
A,B,C = (int(i) for i in input().split())

Aaddition = A+B+C
if Addition != 17:
  haiku = False
else:
  if ((A==5 or A==7) and (B==5 or B==7) and (C==5 or C==7)):
    haiku = True
  else:
    haiku = False
    
if haiku:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
A,B,C = (int(i) for i in input().split())

Aaddition = A+B+C
if Addition != 17:
  haiku = False
else:
  if((A==5 or A==7) and (B==5 or B==7) and (C==5 or C==7) ):
    haiku = True
  else:
    haiku = False
    
if haiku:
  print("YES")
else:
  print("NO")
Problem p02727 (python)

Fixed submission:
X,Y,A,B,C = map(int,input().split())
pList = [int(x) for x in input().split()]
qList = [int(x) for x in input().split()]
rList = [int(x) for x in input().split()]

pList.sort(reverse=True)
qList.sort(reverse=True)
rList.sort(reverse=True)

stackX=[]
stackY=[]
stackR=[]

for i in range(X):
    stackX.append(pList[i])

for i in range(Y):
    stackY.append(qList[i])

for i in range(C):
    if len(stackX)>0:
        x = stackX[-1]
    else:
        x = pow(10,10)

    if len(stackY)>0:
        y = stackY[-1]
    else:
        y = pow(10,10)

    r = rList[i]

    if r <= x and r <= y:
        break
    elif x < y:
        stackX.pop()
        stackR.append(r)
    else:
        stackY.pop()
        stackR.append(r)
print(sum(stackX) + sum(stackY) + sum(stackR))

Buggy submission (verdict: Runtime Error):
X,Y,A,B,C = map(int,input().split())
pList = [int(x) for x in input().split()]
qList = [int(x) for x in input().split()]
rList = [int(x) for x in input().split()]

pList.sort(reverse=True)
qList.sort(reverse=True)
rList.sort(reverse=True)

stackX=[]
stackY=[]
stackR=[]

for i in range(X):
    stackX.append(pList[i])

for i in range(Y):
    stackY.append(qList[i])

for i in range(C):
    if len(stackX)==0:
        x = pow(10,9)
    else:
        x = stackX[-1]

    if len(stackY)==0:
        y = pow(10,9)
    else:
        y = stackY[-1]
    r = rList[i]

    if r < x and r < y:
        break
    elif x < y:
        stackX.pop()
        stackR.append(r)
    else:
        stackY.pop()
        stackR.append(r)
print(sum(stackX) + sum(stackY) + sum(stackR))

Buggy submission (verdict: Runtime Error):
X,Y,A,B,C = map(int,input().split())
pList = [int(x) for x in input().split()]
qList = [int(x) for x in input().split()]
rList = [int(x) for x in input().split()]

pList.sort(reverse=True)
qList.sort(reverse=True)
rList.sort(reverse=True)

stackX=[]
stackY=[]
stackR=[]

for i in range(X):
    stackX.append(pList[i])

for i in range(Y):
    stackY.append(qList[i])

for i in range(C):
    x = stackX[-1]
    y = stackY[-1]
    r = rList[i]

    if r < x and r < y:
        break
    elif x < y:
        stackX.pop()
        stackR.append(r)
    else:
        stackY.pop()
        stackR.append(r)
print(sum(stackX) + sum(stackY) + sum(stackR))
Problem p02765 (python)

Fixed submission:
N,R = map(int, input().split())

if N >= 10:
    print(R)
else:
    print((100*(10-N))+R)

Buggy submission (verdict: Runtime Error):
N,R = map(int, input().split())

if N < 10:
    print(R)
else:
    print(100*(10-K))
Problem p02812 (python)

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

for i in range(N-2):
    if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":
        count += 1

print(count)

Buggy submission (verdict: Runtime Error):
count = 0
N = int(input())
S = input()

for i in range(N):
    if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":
        count += 1

print(count)
Problem p02705 (python)

Fixed submission:
num = int(input())
print(3.14 * 2 * num)

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

d = {}

for i in range(N - 1):
    if A[i] in d:
        d[A[i]].append(i + 2)
    else:
        d[A[i]] = [i + 2]

for i in range(1, N + 1):
    if i in d:
        print(len(d[i]))
    else:
        print(0)

Buggy submission (verdict: Runtime Error):
import numpy as np
n = int(input())
a = list(map(int, input().split()))
b = np.zeros(n)
for i in range(1,n):
    b[i-1] = a.count(i)
for i in b:
    print(int(i))
Problem p03434 (python)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
a_min = min(a)
alice = 0
bob = 0
while max(a) != 0:
    alice += max(a)
    for i in range(len(a)):
        if a[i] == max(a):
            a[i] = 0
            break
    bob += max(a)
    for i in range(len(a)):
        if a[i] == max(a):
            a[i] = 0
            break
if alice > bob:
    print(alice-bob)
else:
    print(bob-alice)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = sorted(list(map(int,input().split())) reverse=True)
print(sum(a[::2]) - sum(a[1::2]))
Problem p03493 (python)

Fixed submission:
num = input()
count = 0
for i in range(3):
    if num[i] == '1':
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
num = line(map(int,input().split()))
count = 0
for i in range(3):
    if num[i] == 1:
        count += 1
print(count)
Problem p03494 (python)

Fixed submission:
num = int(input())
line = list(map(int,input().split()))
count = True
count_num = 0
while count:
    for i in range(num):
        if line[i] % 2 != 0:
            count = False
    if count:
        for i in range(num):
            line[i] /= 2
    count_num += 1
print(count_num-1)

Buggy submission (verdict: Runtime Error):
num = int(input())
line = list(map(int,input().split()))
count = True
count_num = 0
while count:
    for i in range(num):
        if line[i] % 2 != 0:
            count = False
    if count:
        for i in range(num):
            line[i] /= 2
     count_num += 1     
print(count_num)
Problem p03854 (python)

Fixed submission:
s = input().replace("eraser","").replace("erase","").replace("dreamer","").replace("dream","")
if s:
    print('NO')
else:
    print('YES')

Buggy submission (verdict: Runtime Error):
s = input().replace("eraser","").replace("erase"."").replace("dreamer"."").replace("dream","")
if s:
    print("NO")
else:
    print("YES")
Problem p02706 (python)

Fixed submission:
N, M = map(int, input().split()) 
A = list(map(int, input().split()))
for i in range (M):
	N = N -A[i]
if N>=0:
	print (N)
else:
	print (-1)

Buggy submission (verdict: Runtime Error):

N, M = map(int, input().split()) 
A = list(map(int, input().split()))
for i in range (M)
	N = N -A[i]
if N>=0
	print (N)
else
	print (-1)
Problem p02817 (python)

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

Buggy submission (verdict: Runtime Error):
s,t = input().split
ans = t + s
print(ans)

Buggy submission (verdict: Runtime Error):
s,t = input().split
print(s + t)
Problem p02830 (python)

Fixed submission:
n = int(input())
s,t = input().split()
new = ''
for i in range(n):
  new += s[i]
  new += t[i]
print (new)

Buggy submission (verdict: Runtime Error):
n = int(input())
s,t = input().split()
new = ''
for i in range(0, n):
	new += s[i]
  	new += t[i]
print (new)

Buggy submission (verdict: Runtime Error):
n = int(input())
str_s, str_t = input().split()
new = ''
for i in range(0, n)
	new += str_s[i]
  	new += str_t[i]
print (new)

Buggy submission (verdict: Runtime Error):
n = int(input())
str_s, str_t = input.split
new = ''
for i in range(0, n)
	new += str_s[i]
  	new += str_t[i]
print (new)

Buggy submission (verdict: Runtime Error):
n = int(input())
strs, strt = [s for s in range(n)]
new = ''
for i in range(0, n)
	new += strs[i]
  	new += strt[i]
print (new)

Buggy submission (verdict: Runtime Error):
n, strs, strt = [s for s in input().split()]
new = []
for i in range(0, n)
	new.append(strs[i])
  	new.append(strt[i])
print (new)
Problem p03433 (python)

Fixed submission:
N = int(input())
A = int(input())
if (N % 500) > A:
  print('No')
else:
  print('Yes')

Buggy submission (verdict: Runtime Error):
# N,Aを入力
N = int(input)
A = int(input)
if (N % 500) > A:# Nを500で割った余りがAより大きいとき
  	print('No')
else: # Nを500で割った余りがAと等しいまたはAより小さいとき
  	print('Yes')

Buggy submission (verdict: Runtime Error):
# n,aを入力
n, a = map(int, input().split())
# nを500で割った余りを計算
if n % 500 == 0:
    print('Yes')
elif (n % 500) == a:
    print('yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
# n,aを入力
n, a = map(int, input().split())
# nを500で割り余りを計算
if n % 500 == 0: # nが500の倍数
	print('Yes')
elif (n % 500) == a: # nを500で割った余りがaと等しい
 	print('yes')
else:
  	print('No')
Problem p02705 (python)

Fixed submission:
import math
R = int(input())
print(2 * R * math.pi)

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

syain = []

for i in range(N):
    print(A.count(i+1))
Problem p03455 (python)

Fixed submission:
# -*- coding: utf-8 -*-
# 正の整数の入力
a, b = map(int, input().split())

if a*b % 2 == 0:
    ans = 'Even'
else:
    ans = 'Odd'

print("{}".format(ans))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 正の整数の入力
a = int(input())
b = int(input())

if a*b % 2 == 1:
    ans = 'Even'
else:
    ans = 'Odd'

print("{}".format(ans))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 正の整数の入力
a = int(input())
b = int(input())

if a*b % 2 == 1:
    ans = 'Even'
else:
    ans = 'Odd'

print(str(ans))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 正の整数の入力
a = int(input())
b = int(input())

if a*b % 2 == 1:
    ans = 'Even'
else:
    ans = 'Odd'

print(ans)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 正の整数の入力
a = int(input())
b = int(input())

if a*b % 2 == 1:
    ans = 'Even'
else:
    ans = 'Odd'

print(ans)
Problem p03456 (python)

Fixed submission:
import math

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

ab = int(str(a) + str(b)) 
root = math.sqrt(ab)

#print(ab)

#print(math.sqrt(ab))

#print(isinstance(root, float))
#print('1')
if isinstance(root, int) == True:
    ans = 'Yes' 
    #print('2')
elif isinstance(root, float) == True:
    #print('3')
    #print('float')
    #print(root.is_integer())
    if root.is_integer() == True:
        #print('4')
        ans = 'Yes' 
    #print(root.is_integer())
    else:
        ans = 'No'
        #print('5')

print(ans)

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

# 正の整数の入力
a = int(input())
b = int(input())

ab = int(str(a) + str(b))

if ab / math.sqrt(ab) == math.sqrt(ab):
    ans = 'Yes'
else:
    ans = 'No'

print(ans)
Problem p02705 (python)

Fixed submission:
R = int(input())

a = 2*3.1426*R

print(a)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(map(int,input().split()))
for i in a:
    n -= i
    if n<0:
        print(-1)
        exit()
print(n)
Problem p02713 (python)

Fixed submission:
import math

k = int(input())
n = 0

for i in range(1,k+1):
    for j in range(1,k+1):
        a = math.gcd(i,j)
        for l in range(1,k+1):
            b = math.gcd(a,l)
            n += b

print(n)

Buggy submission (verdict: Runtime Error):
import math

k = int(imput())
n = 0

for i in range(1,k+1)
    for j in range(1,k+1)
        a=math.gcd(i,j)
        for l in range(1,k+1)
            b=math.gcd(a,l)
            n += b

print(n)
Problem p03145 (python)

Fixed submission:
A = list(map(int, input().split()))
print((A[0]*A[1])//2)

Buggy submission (verdict: Runtime Error):
A = list(map(int, input().split()))
println((A[0]*A[1])//2)
Problem p03262 (python)

Fixed submission:
def gcd(a, b):
    m, n = max(a,b), min(a,b)
    while n != 0:
        m, n = n, m%n
    return m

n, x0 = map(int, input().split())
x = list(map(int, input().split())) + [x0]

x = list(set(x))
x.sort()
if len(x) >= 3:
    diff_x = [x[i+1] - x[i] for i in range(n)]
    ans = diff_x[0]
    for dx in diff_x[1:]:
        ans = int(gcd(ans, dx))
elif len(x) == 2:
    ans = x[1] - x[0]


print(ans)

Buggy submission (verdict: Runtime Error):
from numpy import gcd

n, x0 = map(int, input().split())
x = list(map(int, input().split())) + [x0]

x = list(set(x))
x.sort()
if len(x) >= 3:
    diff_x = [x[i+1] - x[i] for i in range(n-1)]
    ans = diff_x[0]
    for dx in diff_x[1:]:
        ans = int(gcd(ans, dx))
elif len(x) == 2:
    ans = x[1] - x[0]
else:
    ans = 0

print(ans)

Buggy submission (verdict: Runtime Error):
from numpy import gcd

n, x0 = map(int, input().split())
x = list(map(int, input().split())) + [x0]

x.sort()
diff_x = [x[i+1] - x[i] for i in range(n-1)]
ans = 1
for x_i in x:
    ans = int(gcd(ans, x_i))

print(ans)

Buggy submission (verdict: Runtime Error):
import math

n, x0 = map(int, input().split())
x = list(map(int, input().split())) + [x0]

x = list(set(x))
x.sort()
if len(x) >= 3:
    diff_x = [x[i+1] - x[i] for i in range(n-1)]
    ans = diff_x[0]
    for dx in diff_x[1:]:
        ans = math.gcd(ans, dx)
elif len(x) == 2:
    ans = x[1] - x[0]
else:
    ans = 0

print(ans)

Buggy submission (verdict: Runtime Error):
import math

n, x0 = map(int, input().split())
x = list(map(int, input().split())) + [x0]

x = list(set(x))
x.sort()
if len(x) >= 3:
    diff_x = [x[i+1] - x[i] for i in range(n-1)]
    ans = diff_x[0]
    for dx in diff_x[1:]:
        ans = math.gcd(ans, dx)
else:
    ans = x[1] - x[0]

print(ans)
Problem p03302 (python)

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

if a + b == 15:
    print("+")
elif a * b == 15:
    print("*")
else:
    print("x")

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

if a + b == 15:
    print("+"):
elif a * b == 15:
    print("*")
else:
    print("x")
Problem p03337 (python)

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

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()
max_shurui = 0
for n in range(1,N):
    X, Y = set(S[:n]), set(S[n:])
    max_shurui = max(len(X&Y), max_shurui)
print(max_shurui)

Buggy submission (verdict: Runtime Error):
A, B = map(int, input().split())
print(max(A+B, A−B, A×B))
Problem p03338 (python)

Fixed submission:
N = int(input())
S = input()
max_shurui = 0
for n in range(1,N):
    X, Y = set(S[:n]), set(S[n:])
    max_shurui = max(len(X&Y), max_shurui)
print(max_shurui)

Buggy submission (verdict: Runtime Error):
N = int(input())
S = int(input())
max_shurui = 0
for n in range(1,N):
    X, Y = set(S[:n]), set(S[n:])
    max_shurui = max(len(X&Y), max_shurui)
print(max_shurui)
Problem p03494 (python)

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

def 割れる回数(a):
    回数 = 0
    while a % 2 == 0:
        回数 += 1
        a = a // 2
    return 回数

割れる回数のリスト = [割れる回数(a_i) for a_i in a]
答え = min(割れる回数のリスト)
print(答え)

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

def 割れる回数(a):
    回数 = 0
    while a % 2 == 0:
        回数 += 1
        a = a // 2
    return 回数

割れる回数のリスト = [割れる回数(a_i) for a_i in a]
答え = min(割れる回数のリスト)
print(答え)
Problem p03659 (python)

Fixed submission:
import numpy as np
N = int(input())
A = list(map(int, input().split()))

A_r = A[::-1]

cumsum_A = np.cumsum(A)
cumsum_A_r = np.cumsum(A_r)

x = [abs(a - a_r) for (a, a_r) in zip(cumsum_A[:-1], cumsum_A_r[-2::-1])]
print(min(x))

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

A_r = A[::-1]

cumsum_A = np.cumsum(A)
cumsum_A_r = np.cumsum(A_r)

x = [abs(a - a_r) for (a, a_r) in zip(cumsum_A[:-1], cumsum_A_r[-2::-1])]
print(min(x))
Problem p02705 (python)

Fixed submission:
r = int(input())
print(2 * 3.14 * r)

Buggy submission (verdict: Runtime Error):
r = int(input())
return 2 * 3.14 * r
Problem p02811 (python)

Fixed submission:
k, x = map(int, input().split())
if k * 500 >= x:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
k, x = input().split()
if x % 500 == 0 and k * 500 <= x:
  print('Yes')
else:
  print('No')
Problem p03567 (python)

Fixed submission:
print('Yes' if 'AC' in input() else 'No')

Buggy submission (verdict: Runtime Error):
print(if 'AC' in input())
Problem p03000 (python)

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

curCoord = 0
n = 1

while (curCoord<=X):
    n = n+1
    
    if (n>N+1):
        break
    else:
        curCoord = curCoord+L[n-2]

print(n-1)

Buggy submission (verdict: Runtime Error):

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

curCoord = 0
n = 1

while (curCoord<=X and n<=(N+1)):
    n = n+1
    curCoord = curCoord+L[n-2]
    
print(n-1)

Buggy submission (verdict: Runtime Error):
N,X = map(int,input().split())
L = list(map(int,input().split()))

curCoord = 0
n = 1

while (curCoord<=X):
    n=n+1
    curCoord = curCoord+L[n-2]
    
print(str(n-1))

Buggy submission (verdict: Runtime Error):

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

curCoord = 0
n = 1

while (curCoord<=X):
    n=n+1
    curCoord = curCoord+L[n-2]
    
print(n-1)
Problem p02817 (python)

Fixed submission:
def connect(s):
  return s[1] + s[0]

s = input().split()
print(connect(s))

Buggy submission (verdict: Runtime Error):
def connect(a, b):
  return b + a

s = input()
t = input()
print(connect(s, t))
Problem p02705 (python)

Fixed submission:
a=input()
print(eval(a)*6.28318530717958623200)

Buggy submission (verdict: Runtime Error):
a = input()
print(6.28318530717958623200*a)
Problem p03493 (python)

Fixed submission:
a = input()
a_list = list(a)
print(a_list.count("1"))

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

def count_howmany_divide(val):
  result = 0

  while(True):
    if val % 2 != 0:
      break
    else:
      val /= 2
      result += 1

  return result
    

a_i_divided = list(map(count_howmany_divide, a_i))

print(min(a_i_divided))

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

counter = 0

break_flag = False

while(True):
  for a_i_item in a_i:
    if a_i_item % 2 != 0:
      break_flag = True
      break
  
  a_i = list(map(lambda val: val / 2, a_i))

  if break_flag == True:
    break

  counter += 1

print(counter)
Problem p02705 (python)

Fixed submission:
import math
r = int(input())
print(2*math.pi*r)

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

for i in range(n):
    buka = a.count(str(i+1))
    print(buka)
Problem p02812 (python)

Fixed submission:
n = int(input())
s = input()
flag = 0
for i in range(n-1):
    if i == n-2:
        break
    if s[i] == 'A':
        if s[i+1] == 'B':
            if s[i+2] == 'C':
                flag += 1
print(flag)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()
flag = 0
for i in range(n):
    if s[i] == 'A':
        if s[i+1] == 'B':
            if s[i+2] == 'C':
                flag =+ 1
print(flag)
Problem p03455 (python)

Fixed submission:
a,b = map(int, input().split())
if (a*b)% 2 == 1:
    print('Odd')
else:
    print('Even')

Buggy submission (verdict: Runtime Error):
a,b = map(int, input().split())
if (a*b)% == 1:
    print('Odd')
else:
    print('Even')
Problem p02741 (python)

Fixed submission:
list = ["1", "1", "1", "2", "1", "2", "1", "5", "2", "2", "1", "5", "1", "2", "1", "14", "1", "5", "1", "5", "2", "2", "1", "15", "2", "2", "5", "4", "1", "4", "1", "51"]
K = input()
a = int(K)-1
print(list[a])

Buggy submission (verdict: Runtime Error):
H = input()
W = input()
mas = int(H)*int(W)
h = mas%2

if h==0:
    print(int(mas/2))
else:
    print(int((mas+1)/2))