Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
B = [-1 for i in range(51)]
P = [-1 for i in range(51)]

def buns(L):
    if L == 0:#再帰終了条件
        B[L] = 0
        return B[L]
    else:
        if B[L] == -1:
            B[L] = buns(L-1)*2 + 2
            return B[L]
        else:
            return B[L]

def patty(L):
    if L == 0:#再帰終了条件
        P[L] = 1        
        return P[L]
    else:
        if P[L] == -1:
            P[L] = patty(L-1)*2 + 1
            return P[L]
        else:
            return P[L]

buns(N)
patty(N)
memo = [B[i] + P[i] for i in range(51)]

def func(L,X):

    if L == 0:
        if X <= 0:
            return 0
        else:
            return 1
    elif X <= memo[L-1]+1:
        return func(L-1,X-1)
    else :
        return P[L-1] + 1 + func(L-1,X-2-memo[L-1])


print(func(N,X))

Fixed submission:
D = input()

if D == "25":
  print("Christmas")
elif D == "24":
  print("Christmas Eve")
elif D == "23":
  print("Christmas Eve Eve")
elif D == "22":
  print("Christmas Eve Eve Eve")
else:
  pass
Buggy python submission (verdict: Runtime Error):
import math
 
N,M = map(int,input().split())
 
ans = 1
for i in range(1,M+1):
  if M % i != 0:#約数ではないとき
    continue
  B = M / i
  
  if (i * N <= M):
    ans = max(ans,i)
  if (B * N <= M):
    ans = max(ans,B)

print(ans)

Fixed submission:
N = int(input())
if N == 1 :
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print( A + B )
Buggy python submission (verdict: Runtime Error):
import math

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

ans = 1
for i in range(1,int(math.sqrt(M)+1)+1):
  if M % i != 0:#約数ではないとき
    continue
  B = M / i
  
  if (A * N <= M):
    ans = max(ans,A)
  if (B * N <= M):
    ans = max(ans,B)

print(ans)
  

Fixed submission:
import math
 
N,M = map(int,input().split())
 
ans = 1
for i in range(1,int(math.sqrt(M))+1+1):
  if M % i != 0:#約数ではないとき
    continue
  B = int(M / i)#intとらないと，N = 1 , M = 100 のとき　ans = 100.0になってエラー？
  
  if (i * N <= M):
    ans = max(ans,i)
  if (B * N <= M):
    ans = max(ans,B)

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
import bisect as bs
import sys
input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

A.sort()
B.sort()
C.sort()

second = [N - bs.bisect_right(C,B[i]) for i in range(N)]

ans = 0
for i in range(N):
    ans += np.sum(second[bs.bisect_right(B,A[i]):])

print(int(ans))

Fixed submission:
import numpy as np
import bisect
import sys
input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

A.sort()
B.sort()
C.sort()

ans=0
len_C = len(C)
for b in B:
    a = bisect.bisect_left(A,b)
    c = len_C - bisect.bisect_right(C,b)
    ans += a*c

print(int(ans))

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
import bisect as bs

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

A.sort()
B.sort()
C.sort()

first = [N - bs.bisect_right(B,A[i]) for i in range(N)]
second = [N - bs.bisect_right(C,B[i]) for i in range(N)]

ans = 0
for i in range(N):
    ans += np.sum(second[N - first[i]:])

print(int(ans))

Fixed submission:
import numpy as np
import bisect
import sys
input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

A.sort()
B.sort()
C.sort()

ans=0
len_C = len(C)
for b in B:
    a = bisect.bisect_left(A,b)
    c = len_C - bisect.bisect_right(C,b)
    ans += a*c

print(int(ans))
Buggy python submission (verdict: Runtime Error):
s = input()
s = s.replace("/","")
print("Heisei" if s <= 20190430 else "TBD")

Fixed submission:
s = input()
s = s.replace("/","")
s = int(s)
print("Heisei" if s <= 20190430 else "TBD")
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [int(i) for i in input().split()]
print("Yes" if max(s) < (sum(s) -max(s)) else "No")

Fixed submission:
t,x = map(int,input().split())
print(t/x)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(input()) for i in range(n)]
a = sorted(a)
print((max(a) // 2) + sum(a) -max(a))

Fixed submission:
print('Christmas' + ' Eve'*(25-int(input())))
Buggy python submission (verdict: Runtime Error):
S = input().split(" ")
sum = 0
for i in S:
  sum = sum + i
if(sum >21):
  print("bust")
else:
  print("win")

Fixed submission:
S = input().split(" ")
sum = 0
for i in S:
  sum = sum + int(i)
if(sum >21):
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Runtime Error):
n,m = map(int, input().split())
a = [input() for _ in range(m)]
b = set(a)
c = [list(map(int, ai.split())) for ai in a]
d = dict(c)

if len(d) != len(b):
    print(-1)
else:
    if n == 1:
        print(d[1])
    else:
        if d[1] == 0:
            print(-1)
        else:
            ans = ["0"] * n
            for k in d:
                ans[k-1] = str(d[k])
            print(int("".join(ans)))


Fixed submission:
n,m = map(int, input().split())
a = [input() for _ in range(m)]

x = 10 ** (n - 1)
if n == 1: x = 0
ans = [-1]

while x < 10 ** n:
    s = str(x)
    if all(s[int(ai[0]) - 1] == ai[2] for ai in a):
        ans.append(x)
        break
    x += 1

print(ans[-1])

Buggy python submission (verdict: Runtime Error):
n,m = map(int, input().split())
a = [input() for _ in range(m)]
b = set(a)
c = [list(map(int, ai.split())) for ai in a]
d = dict(c)

if len(d) != len(b):
    print(-1)
else:
    if n == 1:
        print(d[0])
    else:
        if d[0] == 0:
            print(-1)
        else:
            ans = ["0"] * n
            for k in d:
                ans[k-1] = str(d[k])
            print("".join(ans))


Fixed submission:
n,m = map(int, input().split())
a = [input() for _ in range(m)]

x = 10 ** (n - 1)
if n == 1: x = 0
ans = [-1]

while x < 10 ** n:
    s = str(x)
    if all(s[int(ai[0]) - 1] == ai[2] for ai in a):
        ans.append(x)
        break
    x += 1

print(ans[-1])

Buggy python submission (verdict: Runtime Error):
n,m = map(int, input().split())
a = [input() for _ in range(m)]
b = set(a)
c = [list(map(int, ai.split())) for ai in a]
d = dict(c)

if len(d) != len(b):
    print(-1)
else:
    if n == 1:
        print(d[1])
    else:
        if d[1] == 0:
            print(-1)
        else:
            ans = ["0"] * n
            for k in d:
                ans[k-1] = str(d[k])
            print("".join(ans))

Fixed submission:
n,m = map(int, input().split())
a = [input() for _ in range(m)]

x = 10 ** (n - 1)
if n == 1: x = 0
ans = [-1]

while x < 10 ** n:
    s = str(x)
    if all(s[int(ai[0]) - 1] == ai[2] for ai in a):
        ans.append(x)
        break
    x += 1

print(ans[-1])
Buggy python submission (verdict: Runtime Error):
i = 1
while n >= k**i:
    i += 1

print(i)

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

i = 1
while n >= k**i:
    i += 1

print(i)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [input() for _ in range(n)]

ss = set(s)
sd = {}
for i in ss:
    sd[i] = s.count(i)
    
x = max(sd.values())
dl = []

for i in sd.items():
    if i[1] != x:
        dl.append(i[0])
        
for i in dl:
    del sd[i]
        
for i in sorted(sd):
    print(i)

Fixed submission:
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]

scount = Counter(s)
scsort = scount.most_common()
x = scsort[0][1]
anss = []
for i in scsort:
    if i[1] != x:
        break
    anss.append(i[0])

for i in sorted(anss):
    print(i)
Buggy python submission (verdict: Runtime Error):
import numpy as np
n, k = map(int, input().split())
a = np.array(list(map(int, input().split())), dtype="int64")

size = n*(n-1)//2

asort = np.sort(a)
x = np.multiply.outer(asort, asort)
xtril = np.tril(x, -1)

xunder0 = np.sort(xtril[xtril < 0])
xunsize = xunder0.size
xupper0 = np.sort(xtril[xtril > 0])
xupsize = xupper0.size
x0size = size - xunsize - xupsize
### print(x0size, xunsize, xupsize) ###

if k <= xunsize:
    print(xunder0[k-1])
elif k <= xunsize + x0size:
    print(0)
else:
    print(xupper0[k-xunsize-x0size-1])

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

A = np.sort(A)
zero = A[A == 0]
pos = A[A > 0]
neg = A[A < 0]

def f(x):
    cnt_tpl = 0
    if x >= 0: cnt_tpl += len(zero) * N
    cnt_tpl += np.searchsorted(A, x // pos, side='right').sum()
    cnt_tpl += (N - np.searchsorted(A, (-x - 1) // (-neg), side='right')).sum()
    cnt_tpl -= np.count_nonzero(A * A <= x)
    # assert cnt_tpl % 2 == 0
    return cnt_tpl // 2

left = -10 ** 18
right = 10 ** 18
while left + 1 < right:
    x = (left + right) // 2
    if f(x) >= K:
        right = x
    else:
        left = x

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

################ DANGER ################
test = ""
#test = \
"""
5 2
8 7 6
rsrpr
ans 27
"""

"""
7 1
100 10 1
ssssppr
ans 211
"""

"""
30 5
325 234 123
rspsspspsrpspsppprpsprpssprpsr
ans 4996
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
########################################  
        
n, k = map(int, input2().split())
r, s, p = map(int, input2().split())
t = list(input2())

rsp = {"r", "s", "p"}

for i in range(k, n):
    if t[i] == t[i-k]:
        t[i] = rsp - {t[i], t[i+1]}

ans = (t.count("r") * p +
       t.count("s") * r +
       t.count("p") * s)

print(ans)



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

################ DANGER ################
test = ""
#test = \
"""
5 2
8 7 6
rsrpr
ans 27
"""

"""
7 1
100 10 1
ssssppr
ans 211
"""

"""
30 5
325 234 123
rspsspspsrpspsppprpsprpssprpsr
ans 4996
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
########################################  
        
n, k = map(int, input2().split())
r, s, p = map(int, input2().split())
t = list(input2())

rsp = {"r", "s", "p"}

for i in range(k, n-1):
    if t[i] == t[i-k]:
        t[i] = rsp - {t[i], t[i+1]}
        
if t[n-1] == t[n-1-k]:
    t[n-1] = rsp - {t[n-1]}

ans = (t.count("r") * p +
       t.count("s") * r +
       t.count("p") * s)

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

test = ""
#test = \
"""
123 456
"""
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
    

a, b = map(int, input2().strip().split())
print(a * b // math.gcd(a, b))


Fixed submission:
import fractions

test = ""
#test = \
"""
123 456
"""
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
    

a, b = map(int, input2().strip().split())
print(a * b // fractions.gcd(a, b))
Buggy python submission (verdict: Runtime Error):
from collections import deque

N, AB = map(int, open(0).read().split())
B = AB[1::2]

E = [[] for _ in range(N + 1)]
for a, b in zip([iter(AB)] * 2):
    E[a].append(b)

Q = deque([1])
C = [0] * (N + 1)
while Q:
    v = Q.popleft()
    c = 0
    for u in E[v]:
        c += 1 + (c + 1 == C[v])
        C[u] = c
        Q.append(u)

print(max(C))
for b in B:
    print(C[b])


Fixed submission:
a = input()

if a == "SUN":
    print(7)
if a == "MON":
    print(6)
if a == "TUE":
    print(5)
if a == "WED":
    print(4)
if a == "THU":
    print(3)
if a == "FRI":
    print(2)
if a == "SAT":
    print(1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
s1 = []

alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for a in s:
    s1.append(alph[alph.index(a) + n])

print("".join(s1))

Fixed submission:
n = int(input())
s = input()
s1 = []

alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for a in s:
    s1.append(alph[(alph.index(a) + n)%26])

print("".join(s1))
Buggy python submission (verdict: Runtime Error):
from itertools import combinations as comb
from math import sqrt
n = int(input())
xy = [[*map(int, input().split())] for _ in range(n)]


s = sum(sqrt((xy[i][0] - xy[j][0])**2 + (xy[i][1] - xy[j][1])**2) for i,j in comb(range(n), 2))
print(s * 2 / n)

Fixed submission:
from itertools import combinations as comb
from math import sqrt
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]


s = sum(sqrt((xy[i][0] - xy[j][0])**2 + (xy[i][1] - xy[j][1])**2) for i,j in comb(range(n), 2))
print(s * 2 / n)
Buggy python submission (verdict: Runtime Error):
n=int(input);print((n-n//2)/n)

Fixed submission:
n = int(input())
print((n - n//2) / n)
Buggy python submission (verdict: Time Limit Exceeded):
chars = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v",
         "w", "x", "y", "z"]


def eratosthenes_sieve(n):
    primes = [2]
    for odd in range(3, n + 1, 2):
        for p in primes:
            if odd % p == 0:
                break
            if p ** 2 > odd:
                primes.append(odd)
                break
    return primes


era = eratosthenes_sieve(150)

n = int(input())
array = [None] * n
for i in range(n):
    new = input()
    var = 1

    for j in range(10):
        h = chars.index(new[j])
        var *= era[h]

    array[i] = var

ans = 0
pool = set(array)
for ele in pool:
    m = array.count(ele)
    ans += m * (m - 1) // 2

print(ans)


Fixed submission:
import collections

chars = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v",
         "w", "x", "y", "z"]


def eratosthenes_sieve(n):
    primes = [2]
    for odd in range(3, n + 1, 2):
        for p in primes:
            if odd % p == 0:
                break
            if p ** 2 > odd:
                primes.append(odd)
                break
    return primes


era = eratosthenes_sieve(150)
n = int(input())
array = [0] * n
for i in range(n):
    new = input()
    var = 1

    for j in range(10):
        h = chars.index(new[j])
        var *= era[h]

    array[i] = var

c = collections.Counter(array)
cv = list(c.values())
ans = 0
for i in range(len(c)):
    ans += cv[i] * (cv[i] - 1) // 2

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
chars = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v",
         "w", "x", "y", "z"]


def eratosthenes_sieve(n):
    primes = [2]
    for odd in range(3, n + 1, 2):
        for p in primes:
            if odd % p == 0:
                break
            if p ** 2 > odd:
                primes.append(odd)
                break
    return primes


n = int(input())
array = [None] * n
for i in range(n):
    new = input()
    var = 1

    for j in range(10):
        h = chars.index(new[j])
        var *= eratosthenes_sieve(150)[h]

    array[i] = var

ans = 0
pool = set(array)
for ele in pool:
    m = array.count(ele)
    ans += m * (m - 1) // 2

print(ans)


Fixed submission:
import collections

chars = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v",
         "w", "x", "y", "z"]


def eratosthenes_sieve(n):
    primes = [2]
    for odd in range(3, n + 1, 2):
        for p in primes:
            if odd % p == 0:
                break
            if p ** 2 > odd:
                primes.append(odd)
                break
    return primes


era = eratosthenes_sieve(150)
n = int(input())
array = [0] * n
for i in range(n):
    new = input()
    var = 1

    for j in range(10):
        h = chars.index(new[j])
        var *= era[h]

    array[i] = var

c = collections.Counter(array)
cv = list(c.values())
ans = 0
for i in range(len(c)):
    ans += cv[i] * (cv[i] - 1) // 2

print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
a.append(0)
b = list(map(int, input().split()))

count = 0
for i in range(n):
    if a[i] < b[i]:
        count += a[i]
        d = b[i] - a[i]

        if a[i + 1] < d:
            count += a[i + 1]
            a[i + i] = 0
        else:
            count += d
            a[i + 1] -= d

    else:
        count += b[i]

print(count)


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

count = 0
for i in range(n):
    if a[i] < b[i]:
        count += a[i]
        d = b[i] - a[i]

        if a[i + 1] < d:
            count += a[i + 1]
            a[i + 1] = 0
        else:
            count += d
            a[i + 1] -= d

    else:
        count += b[i]

print(count)
Buggy python submission (verdict: Runtime Error):
n,a,b=map(int(input().split()));print(min([n*a,b]))

Fixed submission:
n,a,b=map(int,input().split());print(min([n*a,b]))

Buggy python submission (verdict: Runtime Error):
n,a,b=map(int(input()));print(min([n*a,b]))

Fixed submission:
n,a,b=map(int,input().split());print(min([n*a,b]))
Buggy python submission (verdict: Runtime Error):
from itertools import accumulate
n,x = map(int, input().split())
a = [0, *map(int, input().split())]
print(len([i for i in accumulate(a) if i < x+1]))

Fixed submission:
from itertools import accumulate
n,x = map(int, input().split())
a = [0] + list(map(int, input().split()))
print(len([i for i in accumulate(a) if i < x+1]))
Buggy python submission (verdict: Runtime Error):
input()
li = list(map(int, input().split()))
li.sort(reverse=True)
alice = [i for index,i in enumerate(li) if index % 2 == 0]
ans = alice * 2 - sum(li)
print(alice)

Fixed submission:
input()
li = list(map(int, input().split()))
li.sort(reverse=True)
alice = sum([i for index,i in enumerate(li) if index % 2 == 0])
ans = alice * 2 - sum(li)
print(ans)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
X = int(input())
cnt = 0
for a in A:
  for b in B:
    for c in C:
      if a*500+b*100+c*50 == X:
        cnt += 1
print(cnt)


Fixed submission:
A = int(input())
B = int(input())
C = int(input())
X = int(input())
cnt = 0
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if a*500+b*100+c*50 == X:
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
li = list(map(int, input().split()))
ans = 0
for i in range(li[0] + 1):
  s = sum(list(map(int, str(i))))
  if sum >= li[1] and sum <= li[2]:
    ans += s
print(ans)

Fixed submission:
li = list(map(int, input().split()))
ans = 0
for i in range(li[0]):
  i += 1
  s = sum(list(map(int, str(i))))
  if s >= li[1] and s <= li[2]: ans += i
print(ans)

Buggy python submission (verdict: Runtime Error):
li = list(map(int, input().split()))
ans = 0
for i in range(li[0] + 1):
  sum = sum(list(map(int, str(i))))
  if sum >= a and sum <= b:
    ans += sum
print(ans)

Fixed submission:
li = list(map(int, input().split()))
ans = 0
for i in range(li[0]):
  i += 1
  s = sum(list(map(int, str(i))))
  if s >= li[1] and s <= li[2]: ans += i
print(ans)
Buggy python submission (verdict: Runtime Error):
input()
num_list = list(map(int, input().split()))
min_cnt = 0
for num in num_list:
  min_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: min_cnt = num_cnt
      break
    else:
      num = num / 2
      min_cnt += 1
print(min_cnt)

Fixed submission:
input()
num_list = list(map(int, input().split()))
min_cnt = 999
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: min_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(min_cnt)

Buggy python submission (verdict: Runtime Error):
input()
num_list = list(map(int, input().split()))
min_cnt = 0
for num in num_list:
  min_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: max_cnt = num_cnt
      break
    else:
      num = num / 2
      min_cnt += 1
print(min_cnt)

Fixed submission:
input()
num_list = list(map(int, input().split()))
min_cnt = 999
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: min_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(min_cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
max_cnt = 0
num_list = [] 
for i in range(n):
  num_list.append(int(input()))
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt > max_cnt: max_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(max_cnt)
 

Fixed submission:
input()
num_list = list(map(int, input().split()))
min_cnt = 999
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: min_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(min_cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
max_cnt = 0
num_list = [] 
for i in range(n):
  num_list.append(int(input()))

for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt > max_cnt: max_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(max_cnt)
 

Fixed submission:
input()
num_list = list(map(int, input().split()))
min_cnt = 999
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: min_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(min_cnt)
Buggy python submission (verdict: Runtime Error):
import numpy as np
input_l = list(map(int,input().split()))
a = input_l[0]
b = input_l[1]
print(np.lcm(a,b))

Fixed submission:
import fractions
input_l = list(map(int,input().split()))
a = input_l[0]
b = input_l[1]
print(a * b // fractions.gcd(a, b))

Buggy python submission (verdict: Runtime Error):
input_l = list(map(int,input().split()))
a = input_l[0]
b = input_l[1]
x = np.array([a,b])
import numpy as np

print(np.lcm(a,b))


Fixed submission:
import fractions
input_l = list(map(int,input().split()))
a = input_l[0]
b = input_l[1]
print(a * b // fractions.gcd(a, b))
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n%2 = 1:
    print(0)
    exit()
else:
    i = n/2
    count = 0
    while i > 0:
        i = i//5
        count += i
    print(count)

Fixed submission:
n = int(input())
if n%2 == 1:
    print(0)
    exit()
else:
    i = n//2
    count = 0
    while i > 0:
        i = i//5
        count += i
    print(count)
Buggy python submission (verdict: Runtime Error):
# c
import numpy as np
n = int(input())
a = {}
xy = {}
for i in range(n):
    a[i] = int(input())
    xy[i] = {}
    for j in range(a[i]):
        xy[i][j] = list(map(int,input().split()))

### 自分についての情報を付け加える
for s in range(n):
    xy[s][a[i]] = [s+1,1]

# pさんによる証言とqさんによる証言を比較する
pq_list = [[0 for inki in range(n)] for jinjin in range(n)]
for p in range(n):
    for q in range(n):
        for l in range(len(xy[p])):
            for m in range(len(xy[q])):
                if xy[p][l][0] == xy[q][m][0] and xy[p][l][1] != xy[q][m][1]:
                    pq_list[p][q] += 1

pq_list = np.array(pq_list)
count = 0
while np.sum(pq_list) >= 1:
    max_index = 0
    for i in range(len(pq_list)):
        if sum(pq_list[max_index]) <= sum(pq_list[i]):
            max_index = i
    if sum(pq_list[max_index]) == 0:
        break
    pq_list = np.delete(pq_list,max_index,0)
    pq_list = np.delete(pq_list, max_index, 1)
    count += 1
    
print(n-count)

Fixed submission:
n = int(input())
a = {}
xy = {}
for i in range(n):
    a[i] = int(input())
    xy[i] = {}
    for j in range(a[i]):
        xy[i][j] = list(map(int,input().split()))
ans = []
for i in range(2 ** n):
    flag = []
    k_low = bin(i)[2:]
    if len(k_low) < n:
        k_low = "0" * (n-len(k_low)) + k_low
    for k in k_low:
        flag.append(int(k))
    mujun = 0
    for x in range(len(xy)):
        if flag[x] == 1:
            for y in range(len(xy[x])):
                if flag[xy[x][y][0]-1] != xy[x][y][1]:
                    mujun = 1
    if mujun == 0:
        ans.append(flag)
sum_list = []
for answer in ans:
    sum_list.append(sum(answer))
print(max(sum_list))