Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
h, w = map(int, input().split())
s_input = []
for i in range(h):
    s_input.append(input())

can_draw = True

for i in range(h):
    for j in range(w):
        if s_input[i][j] == '#':
            if i - 1 >= 0:
                if s_input[i-1][j] == '#':
                    #ok
                    continue
            if j - 1 >= 0:
                if s_input[i][j - 1] == '#':
                    #ok
                    continue
            if j + 1 <= w:
                if s_input[i][j + 1] == '#':
                    #ok
                    continue
            if i + 1 <= h:
                if s_input[i + 1][j] == '#':
                    #ok
                    continue
            can_draw = False
            break
    if not can_draw:
        break

print('Yes' if can_draw else 'No')

Fixed submission:
h, w = map(int, input().split())
s_input = []
for i in range(h):
    s_input.append(input())

can_draw = True

for i in range(h):
    for j in range(w):
        if s_input[i][j] == '#':
            if i - 1 >= 0:
                if s_input[i - 1][j] == '#':
                    #ok
                    continue
            if j - 1 >= 0:
                if s_input[i][j - 1] == '#':
                    #ok
                    continue
            if j + 1 < w:
                if s_input[i][j + 1] == '#':
                    #ok
                    continue
            if i + 1 < h:
                if s_input[i + 1][j] == '#':
                    #ok
                    continue
            can_draw = False
            break
    if not can_draw:
        break

print('Yes' if can_draw else 'No')
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

s_len = len(s)
t_len = len(t)

result = ''
for i in range(s_len - t_len, -1, -1):
    match = False
    s_part = s[i:i + t_len]
    for j in range(t_len + 1):
        if j == t_len:
            result = (s[0:i] + t + s[i + t_len:]).replace('?', 'a')
            match = True
            break
        if s_part[j] == '?':
            continue
        if s_part[j] != t[j]:
            match = False
            break
    if match:
        break

print(result if match else 'UNRESTORABLE')

Fixed submission:
s = input()
t = input()

s_len = len(s)
t_len = len(t)

result = ''
match = False
for i in range(s_len - t_len, -1, -1):
    match = False
    s_part = s[i:i + t_len]
    for j in range(t_len + 1):
        if j == t_len:
            result = (s[0:i] + t + s[i + t_len:]).replace('?', 'a')
            match = True
            break
        if s_part[j] == '?':
            continue
        if s_part[j] != t[j]:
            match = False
            break
    if match:
        break

print(result if match else 'UNRESTORABLE')

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

s_len = len(s)
t_len = len(t)

result = ''
for i in range(s_len - t_len, -1, -1):
    match = False
    s_part = s[i:i + t_len]
    for j in range(t_len + 1):
        if j == t_len:
            result = (s[0:i] + t + s[i + 5:]).replace('?', 'a')
            match = True
            break
        if s_part[j] == '?':
            continue
        if s_part[j] != t[j]:
            match = False
            break
    if match:
        break

print(result if match else 'UNRESTORABLE')

Fixed submission:
s = input()
t = input()

s_len = len(s)
t_len = len(t)

result = ''
match = False
for i in range(s_len - t_len, -1, -1):
    match = False
    s_part = s[i:i + t_len]
    for j in range(t_len + 1):
        if j == t_len:
            result = (s[0:i] + t + s[i + t_len:]).replace('?', 'a')
            match = True
            break
        if s_part[j] == '?':
            continue
        if s_part[j] != t[j]:
            match = False
            break
    if match:
        break

print(result if match else 'UNRESTORABLE')
Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
count = 0
for i in range(k + 1):
    for j in range(k + 1):
        for l in range(k + 1):
            if i + j + l == s:
                count += 1

print(count)

Fixed submission:
k, s = map(int, input().split())
count = 0
for i in range(k + 1):
    for j in range(k + 1):
        l = s - i - j
        if l >= 0 and l <= k:
            count += 1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
count = 0
for i in range(k + 1):
    for j in range(k + 1):
        for l in range(k + 1):
            if i + j + l == s:
                count += 1

print(count)

Fixed submission:
k, s = map(int, input().split())
count = 0
for i in range(k + 1):
    for j in range(k + 1):
        l = s - i - j
        if l >= 0 and l <= k:
            count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
s = input()
n = len(s) - 1
sum = 0

if n == 0:
    print(s)
    return

for bit in range(1 << n):
    eval_str = ''
    for i in range(n):
        eval_str += s[i]
        if bit & (1 << i):
            eval_str += '+'
    eval_str += s[i + 1]
    sum += eval(eval_str)

print(sum)

Fixed submission:
s = input()
n = len(s) - 1
sum = 0

for bit in range(1 << n):
    eval_str = ''
    eval_str += s[0]
    for i in range(n):
        if bit & (1 << i):
            eval_str += '+'
        eval_str += s[i + 1]
    sum += eval(eval_str)

print(sum)

Buggy python submission (verdict: Runtime Error):
s = input()
n = len(s) - 1
sum = 0

for bit in range(1 << n):
    eval_str = ''
    for i in range(n):
        eval_str += s[i]
        if bit & (1 << i):
            eval_str += '+'
    eval_str += s[i + 1]
    sum += eval(eval_str)

print(sum)

Fixed submission:
s = input()
n = len(s) - 1
sum = 0

for bit in range(1 << n):
    eval_str = ''
    eval_str += s[0]
    for i in range(n):
        if bit & (1 << i):
            eval_str += '+'
        eval_str += s[i + 1]
    sum += eval(eval_str)

print(sum)
Buggy python submission (verdict: Runtime Error):
#!C:\Users\daichi\Anaconda3/python.exe
# -*- coding: utf-8 -*-

C = input().split()
a = C[0]
b = C[1]
c = C[1]

if(a == b and a == c):
    k = 3
if(a == c and a != b):
    k = 2 
if(a != b and c != b):
    k = 1

print(k)

Fixed submission:
#!C:\Users\daichi\Anaconda3/python.exe
# -*- coding: utf-8 -*-

C = input().split()
a = C[0]
b = C[1]
c = C[2]

k=3
if(a == b and b == c):
    k = 1
elif(a == b and b != c):
    k = 2
elif(a == c and b != c):
    k = 2
elif(b == c and a != c):
    k = 2
else:
    k=3
print(k)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools as it
import math

K = int(input())

gcd_list = []
for i in range(1, K+1):
    for j in range(1, K+1):
        for k in range(1, K+1):
            gcd_ = math.gcd(math.gcd(i, j), k)
            gcd_list.append(gcd_)
print(sum(gcd_list))


Fixed submission:
import itertools as it
import math

K = int(input())

itr = range(1, K+1)
gcd_ = sum([math.gcd(math.gcd(i, j), k)
            for i, j, k in it.product(itr, itr, itr)])
print(gcd_)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools as it
import math

K = int(input())

gcd_list = []
for i, j, k in it.product(range(1, K+1), range(1, K+1), range(1, K+1)):
    gcd_ = math.gcd(math.gcd(i, j), k)
    gcd_list.append(gcd_)
print(sum(gcd_list))


Fixed submission:
import itertools as it
import math

K = int(input())

itr = range(1, K+1)
gcd_ = sum([math.gcd(math.gcd(i, j), k)
            for i, j, k in it.product(itr, itr, itr)])
print(gcd_)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools as it
import fractions

K = int(input())

gcd_list = []
for i, j, k in it.product(range(1, K+1), range(1, K+1), range(1, K+1)):
    gcd_ = fractions.gcd(fractions.gcd(i, j), k)
    gcd_list.append(gcd_)
print(sum(gcd_list))


Fixed submission:
import itertools as it
import math

K = int(input())

itr = range(1, K+1)
gcd_ = sum([math.gcd(math.gcd(i, j), k)
            for i, j, k in it.product(itr, itr, itr)])
print(gcd_)
Buggy python submission (verdict: Runtime Error):
m, n = list(map(int, input().split(" ")))
a_list = list(map(int, input().split(" "))).sort(reverse=True)
if m == 0:
    print('Yes')
else:
    if a_list[m-1] >= sum(a_list) / (4 * m):
        print('Yes')
    else:
        print('No')

Fixed submission:
n, m = list(map(int, input().split(" ")))
a_list = sorted(list(map(int, input().split(" "))), reverse=True)
if m == 0:
    print('Yes')
else:
    if a_list[m-1] >= sum(a_list) / (4 * m):
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
n, k = list(map(int, input().split(" ")))
a = abs(n - k)
n = n - a * (n // a)
n_last = abs(n - k)
if n_last < n:
    n = n_last
print(n)

Fixed submission:
n, k = list(map(int, input().split(" ")))
n = n - k * (n // k)
n_last = abs(n - k)
if n_last < n:
    n = n_last
print(n)

Buggy python submission (verdict: Runtime Error):
n, k = list(map(int, input().split(" ")))
a = abs(n-k)
n = n - a * (n // a)
print(n)

Fixed submission:
n, k = list(map(int, input().split(" ")))
n = n - k * (n // k)
n_last = abs(n - k)
if n_last < n:
    n = n_last
print(n)

Buggy python submission (verdict: Time Limit Exceeded):
n, k = list(map(int, input().split(" ")))
while True:
    a = abs(n-k)
    if n <= a:
        break
    else:
        n = a
print(n)

Fixed submission:
n, k = list(map(int, input().split(" ")))
n = n - k * (n // k)
n_last = abs(n - k)
if n_last < n:
    n = n_last
print(n)
Buggy python submission (verdict: Runtime Error):
x, y, a, b, c = list(map(int, input().split(' ')))
p_list = sorted(list(map(int, input().split(' '))), reverse=True)
q_list = sorted(list(map(int, input().split(' '))), reverse=True)
r_list = sorted(list(map(int, input().split(' '))), reverse=True)

xy_list = sorted(p_list[:x] + q_list[:y])

i = 0
for r in range(c):
    if r_list[r] > xy_list[0]:
        i += 1
    else:
        break

if i == 0:
    print(sum(xy_list))
else:
    print(sum(xy_list[i:] + r_list[:i]))


Fixed submission:
s = input()

s_list = [i for i in s]

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import itertools as it
import collections
 
n, x, y = list(map(int, input().split(' ')))
 
dist_list = []
dist_a = dist_list.append
for i, j in it.combinations(list(range(n)), 2):
    warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))
    if abs(j - i) < warp_dist:
        dist_a(abs(j - i))
    else:
        dist_a(warp_dist)
 
dist_c = collections.Counter(dist_list)
 
for i in range(1, n):
    print(dist_c[i])

Fixed submission:
s = input()

s_list = [i for i in s]

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import itertools as it
import collections

n, x, y = list(map(int, input().split(' ')))

dist_list = []
dist_a = dist_list.append
for i, j in it.combinations(list(range(n)), 2):
    warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))
    if abs(j - i) < warp_dist:
        dist_a(abs(j - i))
    else:
        dist_a(warp_dist)

dist_c = collections.Counter(dist_list)

for i in range(1, n):
    print(dist_c[i])


Fixed submission:
s = input()

s_list = [i for i in s]

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
import itertools as it

n, x, y = list(map(int, input().split(' ')))

dist_list = []
dist_a = dist_list.append
for i, j in it.combinations(list(range(n)), 2):
    warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))
    if abs(j - i) < warp_dist:
        dist_a(abs(j - i))
    else:
        dist_a(warp_dist)

for i in range(1, n):
    print(dist_list.count(i))


Fixed submission:
import itertools as it
import collections
 
n, x, y = list(map(int, input().split(' ')))
 
dist_list = []
dist_a = dist_list.append
for i, j in it.combinations(list(range(n)), 2):
    warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))
    if abs(j - i) < warp_dist:
        dist_a(abs(j - i))
    else:
        dist_a(warp_dist)
 
dist_c = collections.Counter(dist_list)
 
for i in range(1, n):
    print(dist_c[i])

Buggy python submission (verdict: Time Limit Exceeded):
import itertools as it

n, x, y = list(map(int, input().split(' ')))

dist_list = []
for i, j in it.combinations(list(range(n)), 2):
    warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))
    if abs(j - i) < warp_dist:
        dist_list.append(abs(j - i))
    else:
        dist_list.append(warp_dist)

for i in range(1, n):
    print(dist_list.count(i))


Fixed submission:
import itertools as it
import collections
 
n, x, y = list(map(int, input().split(' ')))
 
dist_list = []
dist_a = dist_list.append
for i, j in it.combinations(list(range(n)), 2):
    warp_dist = abs(i - (x - 1)) + 1 + abs(j - (y - 1))
    if abs(j - i) < warp_dist:
        dist_a(abs(j - i))
    else:
        dist_a(warp_dist)
 
dist_c = collections.Counter(dist_list)
 
for i in range(1, n):
    print(dist_c[i])
Buggy python submission (verdict: Runtime Error):
import sys
a = sys.argv[1]
if '7' in a:
	print("Yes")
else:
	print("No")

Fixed submission:
a = input()
if '7' in a:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
import sys
a = sys.argv[1]
t= sum([i for i in range(int(a)+1) if i %5 != 0 and i %3 != 0])
print(t)

Fixed submission:

a = input()
t= sum([i for i in range(int(a)+1) if i %5 != 0 and i %3 != 0])
print(t)
Buggy python submission (verdict: Runtime Error):
print(eval("*".join(list(map(int, input().split()))[:2]))//2)

Fixed submission:
a, b, c = list(map(int, input().split()))
print(a*b//2)
Buggy python submission (verdict: Runtime Error):
   def solve(A):
    cumsum = [0]
    for elem in A:
        cumsum.append(cumsum[-1]+elem)
    d = dict()
    for i in cumsum:
        try:
            d[i] += 1
        except:
            d[i] = 1
    res = 0
    for value in d.values():
        res += (value * (value - 1)) // 2
    return res

def main():
    N = int(input())
    A = list(map(int, input().split()))
    res = solve(A)
    print(res)

main()

Fixed submission:
def solve(A):
    cumsum = [0]
    for elem in A:
        cumsum.append(cumsum[-1]+elem)
    d = dict()
    for i in cumsum:
        try:
            d[i] += 1
        except:
            d[i] = 1
    res = 0
    for value in d.values():
        res += (value * (value - 1)) // 2
    return res

def main():
    N = int(input())
    A = list(map(int, input().split()))
    res = solve(A)
    print(res)

main()
Buggy python submission (verdict: Time Limit Exceeded):
from itertools import product

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

def adding(sign, lst):
    res = 0
    for i in range(len(sign)):
        if sign[i] == 0:
            res += lst[i]
        else:
            res -= lst[i]
    return res

a = [0, 1]

fs = s.split("T")
f_num = [len(f) for f in fs]

dir_lst = [[], []]

for i in range(len(f_num)):
    dir_lst[i%2].append(f_num[i])

x_lst = dir_lst[0]
y_lst = dir_lst[1]

aosx = product(a, repeat=len(x_lst)-1)
aosy = product(a, repeat=len(y_lst))

flag = True

for signx in aosx:
    if x_lst[0] + adding(signx, x_lst[1:]) == x:
        for signy in aosy:
            if adding(signy, y_lst) == y:
                print("Yes")
                flag = False
                break

if flag:
    print("No")

Fixed submission:
from itertools import product

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

a = [0, 1]

fs = s.split("T")
f_num = [len(f) for f in fs]

dir_lst = [[], []]

for i in range(len(f_num)):
    dir_lst[i%2].append(f_num[i])

x_lst = dir_lst[0].copy()
y_lst = dir_lst[1].copy()

nowx = x_lst.pop(0)
x_lst.sort()
while x_lst != []:
    if nowx > x:
        nowx -= x_lst.pop()
    else:
        nowx += x_lst.pop()

y_lst.sort()
nowy = 0
while y_lst != []:
    if nowy > y:
        nowy -= y_lst.pop()
    else:
        nowy += y_lst.pop()

if x == nowx and y == nowy:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
pos = []
che = []
for i in range(n):
    a,b=map(int,input().split())
    pos.append([a,b])
for i in range(m):
    a,b=map(int,input().split())
    che.append([a,b])

for i in range(n):
    dis = []
    for j in range(m):
        dis.append(abs(pos[i][0]-che[i][0])+abs(pos[i][1]-che[i][1]))
    print(dis.index(min(dis))+1)

Fixed submission:
n, m = map(int, input().split())
pos = []
che = []
for i in range(n):
    a, b = map(int,input().split())
    pos.append([a,b])
for i in range(m):
    a, b = map(int,input().split())
    che.append([a,b])
 
for i in range(n):
    dis = []
    for j in range(m):
        dis.append(abs(pos[i][0]-che[j][0])+abs(pos[i][1]-che[j][1]))
    print(dis.index(min(dis))+1)

Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
print(n,m)
pos = []
che = []
for i in range(n):
    a,b=map(int,input().split())
    pos.append([a,b])
for i in range(m):
    a,b=map(int,input().split())
    che.append([a,b])

for i in range(n):
    dis = []
    for j in range(m):
        dis.append(abs(pos[i][0]-che[i][0])+abs(pos[i][1]-che[i][1]))
    print(dis.index(min(dis))+1)

Fixed submission:
n, m = map(int, input().split())
pos = []
che = []
for i in range(n):
    a, b = map(int,input().split())
    pos.append([a,b])
for i in range(m):
    a, b = map(int,input().split())
    che.append([a,b])
 
for i in range(n):
    dis = []
    for j in range(m):
        dis.append(abs(pos[i][0]-che[j][0])+abs(pos[i][1]-che[j][1]))
    print(dis.index(min(dis))+1)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
 
dx =[0, 1]
 
l = [0]
i = 0
 
while(n not in l):
    i += 1
    l = list(set(l))
    for j in range(len(l)):
        a = l[0]
        l.remove(l[0])
        for k in range(2):
            l.append(a + dx[k]*i)
 
 
print(i)


Fixed submission:
import math
n = int(input())
print(math.ceil((-1+(1+8*n)**(1/2))/2))

Buggy python submission (verdict: Time Limit Exceeded):

n = int(input())
 
dx =[-1, 0, 1]
 
l = [0]
i = 0
 
while(n not in l):
    i += 1
    l = list(set(l))
    for j in range(len(l)):
        a = l[0]
        l.remove(l[0])
        for k in range(3):
            l.append(a + dx[k]*i)
 
 
print(i)


Fixed submission:
import math
n = int(input())
print(math.ceil((-1+(1+8*n)**(1/2))/2))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

dx =[-1, 0, 1]

l = [0]
i = 0

while True:
    for x in l:
        if x == n:
            break
    for j in range(len(l)):
        a = l[0]
        l.pop(l[0])
        for k in range(3):
            l.append(a + dx[k]*(i+1))


print(i)

Fixed submission:
import math
n = int(input())
print(math.ceil((-1+(1+8*n)**(1/2))/2))
Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())
if 2*n >= m:
    print(int(m/2))
else:
    while True:
        if 2*n < m:
            n = n + 1
            m = m - 2
        else:
            print(int(m/2))
            break


Fixed submission:
n, m = map(int, input().split())
if 2*n >= m:
    print(int(m/2))
else:
    print((2*n + m)//4)
Buggy python submission (verdict: Runtime Error):
import sys

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

a = []
for i in range(n):
    a.append(list(input()))

b = []
for i in range(m):
    b.append(list(input()))

for i in range(n-m+1):
    for j in range(n-m+1):
        for k in range(m):
            if k <= m-2:
                if a[i+k][j:j+m] == b[k]:
                    continue
                else:
                    break
            else:
                if a[i+k][j:j+m] == b[k]:
                    print("Yes")
                    sys.exit()
                else:
                    break

print("No")


    

Fixed submission:
a, b = map(int, input().split())
l = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]

if l.index(a) > l.index(b):
    print("Alice")
elif l.index(a) == l.index(b):
    print("Draw")
else:
    print("Bob")
Buggy python submission (verdict: Runtime Error):
inp = input()

arr = ['Sunny','Cloudy','Rainy']

if inp == 'Sunny':
  print arr[1]
elif inp == 'Cloudy':
  print arr[2]
elif inp == 'Rainy':
  print arr[0]

Fixed submission:
inp = input()
 
arr = ['Sunny','Cloudy','Rainy']
 
if inp == 'Sunny':
  print (arr[1])
elif inp == 'Cloudy':
  print (arr[2])
elif inp == 'Rainy':
  print (arr[0])
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
h = list(map(int, input().split()))

if n <= k:
    print(0)

    exit()

H = sorted(h)

for i in range(k):
    H.remove(H[-1])

print(sum(H))

Fixed submission:
n, k = map(int, input().split())
H = sorted(list(map(int, input().split())), reverse=True)#reverse=Trueは逆順
# print(H)
# print(H[k:])#後ろからkこぶんとる
print(sum(H[k:]))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

c = a + b

if a == 1 and b == 2:
    print(3)
elif b == 1 and a == 2:
    print(3)
elif a == 1 and b == 3:
    print(2)
elif b == 1 and a == 3:
    print(2)
elif a == 2 and b == 3:
    print(1)
else b == 2 and a == 3:
    print(1)

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

c = A + B
 
if c == 3:
    print(3)
elif c == 4:
    print(2)
elif c == 5:
    print(1)

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

c = a + b

if a == 1 and b == 2:
    print(3)
elif b == 1 and a == 2:
    print(3)
elif a == 1 and b == 3:
    print(2)
elif b == 1 and a == 3:
    print(2)
elif a == 2 and b == 3:
    print(1)
elif b == 2 and a == 3:
    print(1)

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

c = A + B
 
if c == 3:
    print(3)
elif c == 4:
    print(2)
elif c == 5:
    print(1)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
c = A + B

if c == 3:
    print(3)
elif c == 4:
    print(2)
elif c == 5:
    print(1)

exit()

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

c = A + B
 
if c == 3:
    print(3)
elif c == 4:
    print(2)
elif c == 5:
    print(1)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
c = A + B

if c == 3:
    print(3)
elif c == 4:
    print(2)
elif c == 5:
    print(1)


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

c = A + B
 
if c == 3:
    print(3)
elif c == 4:
    print(2)
elif c == 5:
    print(1)
Buggy python submission (verdict: Runtime Error):
import math

def lcm(a, b):
	return a * b // math.gcd (a, b)

c, d = map(int, input().split())

print(lcm(c, d))

Fixed submission:
import fractions
a, b = map(int, input().split())
print(a * b // fractions.gcd(a, b))

Buggy python submission (verdict: Runtime Error):
import math
def lcm(a, b):
	return a * b // math.gcd (a, b)

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

print(lcm(a, b))

Fixed submission:
import fractions
a, b = map(int, input().split())
print(a * b // fractions.gcd(a, b))