Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,d = map(int,input().split())
total = b-a+1

def count(x):
    flag = False
    if x>b:
        x_count = 0
    else:
        for i in range(a,b+1):
            if i%x==0:
                x_begininng = i-a
                flag = True
                break
        else:
            x_count = 0

        if flag:
            x_count = 1 + (b-a-x_begininng)//x

    return x_count

def lcd(x,y):
    x,y = sorted([x,y])

    if x==1:
        gcd = 1
    elif x>1:
        gcd = 1
        for i in range(2,x+1):
            if x%i==0:
                if y%i==0:
                    gcd = i

    x_tmp = x//gcd
    y_tmp = y//gcd
    lcd = (gcd*x_tmp*y_tmp)

    return lcd


cd_count = count(c)+count(d)-count(lcd(c,d))
answer = (total-cd_count)

print(answer)

Fixed submission:
import fractions

a,b,c,d = map(int,input().split())
total = b-a+1

def count(x):
    if x>b:
        x_count = 0
    elif x<a:
        if a%x==0:
            tmp = 1
        else:
            tmp = 0

        x_count = (b-x)//x - (a-x)//x +tmp

    else:
        x_count = 1 + (b-x)//x

    return x_count

def lcd(x,y):
    return(x*y//fractions.gcd(x,y))

cd_count  = count(c)+count(d)-count(lcd(c,d))
answer = total-cd_count

print(answer)
Buggy python submission (verdict: Runtime Error):
def main():
    n = int(input())
    ab_lst = [list(map(int, input().split())) for _ in range(n)]

    ba_lst = [0] * n
    for i in range(n):
        a = ab_lst[i][0]
        b = ab_lst[i][1]
        ba = [b, a]
        ba_lst[i] = ba
    ba_lst.sort()

    lst = []
    b = ba_lst[0][0]
    a = ba_lst[0][1]
    for i in range(n):
        b_tmp = ba_lst[i][0]
        a_tmp = ba_lst[i][1]

        if b == b_tmp:
            if i != 0:
                a += a_tmp
            if i == n - 1:
                lst.append([b, a])

        else:
            lst.append([b, a])
            b = b_tmp
            a = a_tmp

    if ba_lst[-1][0] != ba_lst[-2][0]:
        lst.append([ba_lst[-1][0], ba_lst[-1][1]])

    print(lst)

    accumulate = 0
    flag = True
    for i in range(len(lst)):
        accumulate += lst[i][1]
        if accumulate > lst[i][0]:
            flag = False
            break

    if flag:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    n = int(input())
    ab_lst = [list(map(int, input().split())) for _ in range(n)]

    ba_lst = [0] * n
    for i in range(n):
        a = ab_lst[i][0]
        b = ab_lst[i][1]
        ba = [b, a]
        ba_lst[i] = ba
    ba_lst.sort()

    lst = []
    b = ba_lst[0][0]
    a = ba_lst[0][1]
    for i in range(n):
        b_tmp = ba_lst[i][0]
        a_tmp = ba_lst[i][1]

        if b == b_tmp:
            if i != 0:
                a += a_tmp
            if i == n - 1:
                lst.append([b, a])

        else:
            lst.append([b, a])
            b = b_tmp
            a = a_tmp

    if len(lst) > 1:
        if ba_lst[-1][0] != ba_lst[-2][0]:
            lst.append([ba_lst[-1][0], ba_lst[-1][1]])


    accumulate = 0
    flag = True
    for i in range(len(lst)):
        accumulate += lst[i][1]
        if accumulate > lst[i][0]:
            flag = False
            break

    if flag:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
a_lst = [int(input()) for i in range(m)]
dp = [0]*(n+1)
dp[0] = 1
x = 10**9 + 7

for i in range(1,n+1):
    if i in a_lst:
        continue
    else:
        if i==1:
            dp[i] = dp[i-1]
        elif i>1:
            dp[i] = (dp[i-2] + dp[i-1]) % x

answer = dp[-1]

print(answer)

Fixed submission:
n,m = map(int,input().split())
a_lst = set(int(input()) for i in range(m))
dp = [0]*(n+1)
dp[0] = 1
x = 10**9 + 7

for i in range(1,n+1):
    if i in a_lst:
        continue
    else:
        if i==1:
            dp[i] = dp[i-1]
        elif i>1:
            dp[i] = (dp[i-2] + dp[i-1]) % x

answer = dp[-1]

print(answer)

Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
a_lst = [int(input()) for i in range(m)]
dp = [0]*(n+1)
dp[0] = 1
x = 10**9 + 7

for i in range(1,n+1):
    if i in a_lst:
        continue
    else:
        if i==1:
            dp[i] = dp[i-1]
        elif i>1:
            dp[i] = (dp[i-2] + dp[i-1]) % x

answer = dp[-1]

print(answer)

Fixed submission:
n,m = map(int,input().split())
a_lst = set(int(input()) for i in range(m))
dp = [0]*(n+1)
dp[0] = 1
x = 10**9 + 7

for i in range(1,n+1):
    if i in a_lst:
        continue
    else:
        if i==1:
            dp[i] = dp[i-1]
        elif i>1:
            dp[i] = (dp[i-2] + dp[i-1]) % x

answer = dp[-1]

print(answer)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
s_lst = [list(map(int,input().split())) for i in range(m)]
k_lst = []
for i in range(m):
    k = s_lst.pop(s_lst[i][0])
    k_lst.append(k)
p_lst = list(map(int,input().split()))
answer = 0

for i in range(2**n): #各電球がonかoffかビット全探索
    on_lst =[0]*n
    flag = True
    for j in range(n):
        if (i>>j) & 1:
            on_lst[j] = 1
    for l in range(m): ##　一つ一つの電球について確認
        number = 0
        s = s_lst[l]
        for sw in s:
            if on_lst[sw-1]==1:
                number += 1
        if number%2 != p[i]:
            flag = False
            break
    if flag:
        answer += 1

print(answer)

Fixed submission:
n,m = map(int,input().split())
s_lst = [list(map(int,input().split())) for i in range(m)]
for i in range(m):
    del s_lst[i][0]
p_lst = list(map(int,input().split()))
answer = 0

for i in range(2**n): #各電球がonかoffかビット全探索
    on_lst =[0]*n
    flag = True
    for j in range(n):
        if (i>>j) & 1:
            on_lst[j] = 1
    for l in range(m): ##　一つ一つの電球について確認
        number = 0
        s = s_lst[l]
        for sw in s:
            if on_lst[sw-1]==1:
                number += 1
        if number%2 != p_lst[l]:
            flag = False
            break
    if flag:
        answer += 1

print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
move_lst = [int(input()) for _ in range(5)]
time = 0
people_lst = [n] + [0]*5

while people_lst[-1]!=n:
    time += 1

    for i in range(4,-1,-1):
        people = people_lst[i]
        move = move_lst[i]

        people_lst[i] -= min(people, move)
        people_lst[i+1] += min(people, move)

print(time)

Fixed submission:
def need(x,y):
    if x%y==0:
        answer = x//y
    else:
        answer = x//y + 1

    return answer

n = int(input())
move_lst = [int(input()) for _ in range(5)]
min_move = min(move_lst)

answer = need(n, min_move) + 4
print(answer)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
move_lst = [int(input()) for _ in range(5)]
time = 0
people_lst = [n] + [0]*5

while people_lst[-1]!=n:
    time += 1

    for i in range(4,-1,-1):
        people = people_lst[i]
        move = move_lst[i]

        people_lst[i] -= min(people, move)
        people_lst[i+1] += min(people, move)

print(time)

Fixed submission:
def need(x,y):
    if x%y==0:
        answer = x//y
    else:
        answer = x//y + 1

    return answer

n = int(input())
move_lst = [int(input()) for _ in range(5)]
min_move = min(move_lst)

answer = need(n, min_move) + 4
print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
n,q = map(int,input().split())
s = str(input())
lr_lst = [list(map(int,input().split())) for i in range(q)]

for i in range(q):
    start = lr_lst[i][0] - 1
    end = lr_lst[i][1]

    str = s[start:end]
    answer = str.count('AC')
    print(answer)

Fixed submission:
n,q = map(int,input().split())
s = str(input())
lr_lst = [list(map(int,input().split())) for i in range(q)]

ac_lst = [0] * (n+1)

for i in range(n):
    if s[i:i+2]=='AC':
        ac_lst[i+1] = ac_lst[i] + 1
    else:
        ac_lst[i+1] = ac_lst[i]

for i in range(q):
    start = lr_lst[i][0]
    end = lr_lst[i][1]

    print(ac_lst[end-1] - ac_lst[start-1])
Buggy python submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
a, b = sorted([a, b])
lst = []

if b != 1:
    for i in range(1, b):
        if a%i==b%i==0:
            lst.append(i)

else:
    lst.append(1)

lst.reverse()
print(lst[k-1])

Fixed submission:
a, b, k = map(int, input().split())
a, b = sorted([a, b])
lst = []

if b != 1:
    for i in range(1, a+1):
        if a%i==b%i==0:
            lst.append(i)

else:
    lst.append(1)

lst.reverse()
print(lst[k-1])

Buggy python submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
a, b = sorted([a, b])
lst = []

if b != 1:
    for i in range(1, b):
        if a%i==b%i==0:
            lst.append(i)

else:
    lst.append(1)

print(lst[k-1])

Fixed submission:
a, b, k = map(int, input().split())
a, b = sorted([a, b])
lst = []

if b != 1:
    for i in range(1, a+1):
        if a%i==b%i==0:
            lst.append(i)

else:
    lst.append(1)

lst.reverse()
print(lst[k-1])
Buggy python submission (verdict: Runtime Error):
s = str(input())
year = ''
month = ''
day = ''

for i in range(4):
    y = s[i]
    year += y
for i in range(5, 7):
    m = s[i]
    month += m
for i in range(9, 11):
    d = s[i]
    day += d

year = int(year)
month = int(month)
day = int(day)

if year < 2019:
    answer = 'Heisei'

elif year == 2019 and month <= 4:
    answer = 'Heisei'

else:
    answer = 'TBD'
    
print(answer)

Fixed submission:
s = str(input())

year = ''
for i in range(4):
    y = s[i]
    flag1 = True
    if y == '0':
        if len(year) == 0:
            flag1 = False
        if flag1:
            year += y
    else:
        year += y
year = int(year)

month = ''
for i in range(5, 7):
    m = s[i]
    if i == 5 and m == '0':
        continue
    else:
        month += m
month = int(month)


if year < 2019:
    answer = 'Heisei'

elif year == 2019 and month <= 4:
    answer = 'Heisei'

else:
    answer = 'TBD'

print(answer)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = list(map(int, input().split()) for _ in range(n))

print('Yes' if max(l) < sum(l)-max(l) else 'No')

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

print('Yes' if max(l) < sum(l)-max(l) else 'No')
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
x_lst = list(map(int,input().split()))
x_lst.sort()

if m==1:
    print(0)
else:
    remainder_lst = []
    for i in range(m-1):
        x1 = x_lst[i]
        x2 = x_lst[i+1]

        remainder = x2 - x1
        remainder_lst.append(remainder)

    remainder1_lst = sorted(remainder_lst, reverse=True)
    delete = 0

    if n==1:
        answer = sum(remainder_lst)
    else:
        for i in range(n-1):
            remainder1 = remainder1_lst[i]
            delete += remainder1
        answer = sum(remainder_lst) - delete

    print(answer)

Fixed submission:
n,m = map(int,input().split())
x_lst = list(map(int,input().split()))
x_lst.sort()

if n>=m:
    answer = 0
else:
    remainder_lst = []
    for i in range(m-1):
        x1 = x_lst[i]
        x2 = x_lst[i+1]

        remainder = x2 - x1
        remainder_lst.append(remainder)

    remainder1_lst = sorted(remainder_lst, reverse=True)
    delete = 0

    for i in range(n-1):
        remainder1 = remainder1_lst[i]
        delete += remainder1
    answer =  sum(remainder_lst) - delete

print(answer)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
x_lst = list(map(int,input().split()))
x_lst.sort()

if m==1:
    print(0)
else:
    remainder_lst = []
    for i in range(m-1):
        x1 = x_lst[i]
        x2 = x_lst[i+1]

        remainder = x2 - x1
        remainder_lst.append(remainder)

    remainder1_lst = sorted(remainder_lst, reverse=True)
    delete = 0

    for i in range(n-1):
        remainder1 = remainder1_lst[i]
        delete += remainder1

    answer = sum(remainder_lst) - delete
    print(answer)

Fixed submission:
n,m = map(int,input().split())
x_lst = list(map(int,input().split()))
x_lst.sort()

if n>=m:
    answer = 0
else:
    remainder_lst = []
    for i in range(m-1):
        x1 = x_lst[i]
        x2 = x_lst[i+1]

        remainder = x2 - x1
        remainder_lst.append(remainder)

    remainder1_lst = sorted(remainder_lst, reverse=True)
    delete = 0

    for i in range(n-1):
        remainder1 = remainder1_lst[i]
        delete += remainder1
    answer =  sum(remainder_lst) - delete

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


def main():
    n, x = map(int, input().split())
    x_lst = list(map(int, input().split()))
    x_lst.sort()

    if n == 1:
        minimum = abs(x_lst[0] - x)
    else:
        lst1 = []
        for i in range(n):
            if i != n - 1:
                lst1.append(abs(x_lst[i + 1] - x_lst[i]))

        minimum = math.gcd(lst1[0], lst1[1])
        for i in range(n - 1):
            if i != n - 2:
                minimum = min(minimum, math.gcd(lst1[i], lst1[i + 1]))

        lst2 = []
        for i in range(n):
            lst2.append(abs(x_lst[i] - x))

        lst2.sort()
        lst2.reverse()
        for i in range(n):
            if minimum % lst2[i] == 0:
                minimum = lst2[i]
                break

    print(minimum)


if __name__ == '__main__':
    main()

Fixed submission:
import math


def main():
    n, x = map(int, input().split())
    x_lst = list(map(int, input().split()))
    x_lst.sort()

    if n == 1:
        minimum = abs(x_lst[0] - x)
    elif n == 2:
        minimum = abs(x_lst[1] - x_lst[0])
        lst = [abs(x_lst[1] - x), abs(x_lst[0] - x)]
        lst.sort()
        lst.reverse()
        for i in range(2):
            if minimum % lst[i] == 0:
                minimum = lst[i]
                break
    else:
        lst1 = []
        for i in range(n):
            if i != n - 1:
                lst1.append(abs(x_lst[i + 1] - x_lst[i]))

        minimum = math.gcd(lst1[0], lst1[1])
        for i in range(n - 1):
            if i != n - 2:
                minimum = min(minimum, math.gcd(lst1[i], lst1[i + 1]))

        lst2 = []
        for i in range(n):
            lst2.append(abs(x_lst[i] - x))

        lst2.sort()
        lst2.reverse()
        for i in range(n):
            if minimum % lst2[i] == 0:
                minimum = lst2[i]
                break

    print(minimum)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
n = int(input())
lst = [135, 189, 105, 165, 195]
tmp = 0

for i in range(5):
    if n<=lst[i]:
        tmp += 1

print(tmp)

Fixed submission:
a, b = map(int, input().split())
print(a * b - a - b + 1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
lst = [135, 189, 105, 165, 195]
tmp = 0

for i in range(6):
    if n<=lst[i]:
        tmp += 1

print(tmp)

Fixed submission:
n = int(input())
lst = [135, 189, 105, 165, 195]
tmp = 0
x = []

for i in range(5):
    x.append(n-lst[i])

for i in range(5):
    if x[i]>=0:
        tmp += 1

print(tmp)
Buggy python submission (verdict: Time Limit Exceeded):
import copy


def center(lst):
    lst.sort()
    value = lst[(len(lst) - 1) // 2]
    return value


def main():
    n = int(input())
    x_lst = list(map(int, input().split()))

    ans_lst = []
    for i in range(n):
        lst = copy.deepcopy(x_lst)
        del lst[i]
        ans_lst.append(center(lst))

    for i in range(n):
        print(ans_lst[i])


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    n = int(input())
    x_lst = list(map(int, input().split()))
    x_sorted_lst = sorted(x_lst)

    median1 = x_sorted_lst[n // 2 - 1]
    median2 = x_sorted_lst[n // 2]

    if median1 == median2:
        lst = [median1] * n

    else:
        lst = []
        for i in range(n):
            x = x_lst[i]

            if x <= median1:
                lst.append(median2)
            elif median2 <= x:
                lst.append(median1)

    for i in range(n):
        print(lst[i])


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
a, b, c = int(input())
if a +  b >= c:
    print('Yes')
else:
    print('No')

Fixed submission:
a, b, c = map(int, input().split())
if a +  b >= c:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
s = str(input())
cnt = 0

for i in range(a):
    if int(s[i]) in range(0, 10):
        cnt += 1
if s[a]=='-':
    cnt += 1
for i in range(b):
    if int(s[a+1+i]) in range(0, 10):
        cnt += 1

if cnt == a+b+1:
    print('Yes')
else:
    print('No')

Fixed submission:
a, b = map(int, input().split())
s = str(input())
cnt = 0

if s.count('-')==1 and s[a]=='-':
    for i in range(a):
        if int(s[i]) in range(0, 10):
            cnt += 1
    if s[a]=='-':
        cnt += 1
    for i in range(b):
        if int(s[a+1+i]) in range(0, 10):
            cnt += 1

    if cnt == a+b+1:
        print('Yes')
    else:
        print('No')

else:
    print('No')
Buggy python submission (verdict: Runtime Error):
def main():
    n = int(input())
    a_lst = list(map(int, input().split()))
    a_lst.sort()
    a_set_lst = list(set(a_lst))
    a_set_lst.sort()

    count_lst = []
    count = 1
    if n == 1:
        count_lst.append(count)
    else:
        for i in range(n - 1):
            a1 = a_lst[i]
            a2 = a_lst[i + 1]

            if a1 == a2:
                count += 1
                if i == n - 2:
                    count_lst.append(count)
            else:
                count_lst.append(count)
                count = 1

    minimum = 0
    for i in range(len(a_set_lst)):
        number = a_set_lst[i]
        count = count_lst[i]

        if count < number:
            minimum += count
        else:
            minimum += count - number

    print(minimum)


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    n = int(input())
    a_lst = list(map(int, input().split()))
    a_lst.sort()
    a_set_lst = list(set(a_lst))
    a_set_lst.sort()

    count_lst = []
    count = 1
    if n == 1:
        count_lst.append(count)
    else:
        for i in range(n - 1):
            a1 = a_lst[i]
            a2 = a_lst[i + 1]

            if a1 == a2:
                count += 1
                if i == n - 2:
                    count_lst.append(count)
            else:
                count_lst.append(count)
                count = 1
        if a_lst[-1] != a_lst[-2]:
            count_lst.append(count)

    minimum = 0
    for i in range(len(a_set_lst)):
        number = a_set_lst[i]
        count = count_lst[i]

        if count < number:
            minimum += count
        else:
            minimum += count - number

    print(minimum)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    a_lst = [int(input()) for _ in range(n)]

    new_lst = []
    for i in range(n):
        a = a_lst[i]
        if a not in new_lst:
            new_lst.append(a)
        else:
            new_lst.remove(a)

    count = len(new_lst)
    print(count)


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    n = int(input())
    a_lst = [int(input()) for _ in range(n)]
    a_lst.sort()

    count = 0
    tmp = 0
    number = a_lst[0]

    for i in range(n):

        if a_lst[i] == number:
            tmp += 1

            if i == n - 1:
                if tmp % 2 != 0:
                    count += 1

        else:
            number = a_lst[i]

            if tmp % 2 == 0:
                tmp = 1
                continue
            else:
                count += 1
                tmp = 1

    if n > 1:
        if a_lst[-1] != a_lst[-2]:
            count += 1

    print(count)


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    a_lst = [int(input()) for _ in range(n)]

    new_lst = []
    for i in range(n):
        a = a_lst[i]
        if a not in new_lst:
            new_lst.append(a)
        else:
            new_lst.remove(a)

    count = len(new_lst)
    print(count)


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    n = int(input())
    a_lst = [int(input()) for _ in range(n)]
    a_lst.sort()

    count = 0
    tmp = 0
    number = a_lst[0]

    for i in range(n):

        if a_lst[i] == number:
            tmp += 1

            if i == n - 1:
                if tmp % 2 != 0:
                    count += 1

        else:
            number = a_lst[i]

            if tmp % 2 == 0:
                tmp = 1
                continue
            else:
                count += 1
                tmp = 1

    if n > 1:
        if a_lst[-1] != a_lst[-2]:
            count += 1

    print(count)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    a_lst = list(map(int, input().split()))
    a_min = min(a_lst)
    a_max = max(a_lst)

    count_lst = []
    for num in range(a_min, a_max + 1):
        count = 0
        count += a_lst.count(num - 1)
        count += a_lst.count(num)
        count += a_lst.count(num + 1)
        count_lst.append(count)

    maximum = max(count_lst)
    print(maximum)


if __name__ == '__main__':
    main()

Fixed submission:
n = int(input())
a_lst = list(map(int, input().split()))
for i in range(n):
    a_lst[i] += 1

max_a = max(a_lst)
count_lst = [0] * (max_a + 2)


for i in range(n):
    a = a_lst[i]
    index1 = a - 1
    index2 = a
    index3 = a + 1

    count_lst[index1] += 1
    count_lst[index2] += 1
    count_lst[index3] += 1

maximum = max(count_lst)
print(maximum)

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    a_lst = list(map(int, input().split()))
    a_min = min(a_lst)
    a_max = max(a_lst)

    count_lst = []
    for num in range(a_min, a_max + 1):
        count = 0
        count += a_lst.count(num - 1)
        count += a_lst.count(num)
        count += a_lst.count(num + 1)
        count_lst.append(count)

    maximum = max(count_lst)
    print(maximum)


if __name__ == '__main__':
    main()

Fixed submission:
n = int(input())
a_lst = list(map(int, input().split()))
for i in range(n):
    a_lst[i] += 1

max_a = max(a_lst)
count_lst = [0] * (max_a + 2)


for i in range(n):
    a = a_lst[i]
    index1 = a - 1
    index2 = a
    index3 = a + 1

    count_lst[index1] += 1
    count_lst[index2] += 1
    count_lst[index3] += 1

maximum = max(count_lst)
print(maximum)
Buggy python submission (verdict: Runtime Error):
import math


def lcm(x, y):
    return x * y / math.gcd(x, y)


def main():
    n = int(input())
    t_lst = [int(input()) for _ in range(n)]
    t_lst.sort()
    answer = t_lst[0]
    for i in range(1, n):
        t = t_lst[i]
        answer = lcm(answer, t)
        answer = int(answer)

    print(answer)


if __name__ == '__main__':
    main()

Fixed submission:
import math


def lcm(x, y):
    return x * y // math.gcd(x, y)


def main():
    n = int(input())
    t_lst = [int(input()) for _ in range(n)]
    t_lst.sort()
    answer = t_lst[0]
    for i in range(1, n):
        t = t_lst[i]
        answer = lcm(answer, t)

    print(answer)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
s = list(str(input()))
s1 = list(set(s1))

print('yes' if len(s)==len(s1) else 'no')

Fixed submission:
s = list(str(input()))
s1 = list(set(s))

print('yes' if len(s)==len(s1) else 'no')
Buggy python submission (verdict: Runtime Error):
a. b = map(int, input().split())
print((a + b) % 24)

Fixed submission:
a, b = map(int, input().split())
print((a + b) % 24)

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

Fixed submission:
a, b = map(int, input().split())
print((a + b) % 24)