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

Fixed submission:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

N, M = I()
H = l()
good = [1]*N
for k in range(M):
    A, B = map(int, input().split())
    if H[A - 1] >= H[B - 1]:
        good[B - 1] = 0
    if H[A - 1] <= H[B - 1]:
        good[A - 1] = 0
print(sum(good))

Buggy submission (verdict: Runtime Error):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

N = k()
count = 0
for i in range(1,N+1):
    t = N//i
    count += i * t*(t+1)/2
print(int(count))
Problem p02754 (python)

Fixed submission:
n,a,b=map(int,input().split())
k=n//(a+b)
mod=n%(a+b)
ans=a*k
if mod >=a:
    ans +=a
else:
    ans +=mod
print(ans)

Buggy submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
a = []

while len(a) != N:
    a.append("b" * A)
    a.append("a" * B)

a = "".join(a)

b = a[0: N]

c = b.count("b")
print(c)
Problem p02881 (python)

Fixed submission:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

N = k()
ans = N-1

for i in range(1,int(N**0.5)+1):
    if N % i == 0:
        b = N // i
        ans = min(ans, b+i-2)

print(ans)

Buggy submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

N = k()
ans = 1000000

for i in range(1,N**0.5+1):
    if N % i == 0:
        b = N // i
        ans = min(ans, b+i-2)

print(ans)

Buggy submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

N = k()
ans = 1000000

for i in range(1,N**0.5+1):
    if n % i == 0:
        b = n // i
        ans = min(ans, b+i-2)

print(ans)

Buggy submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

N = k()
ans = 1000000

for i in range(1,N**0.5+1):
    if n % i == 0:
        b = n // i
        ans = min(ans, b+a-2)

print(ans)
Problem p03013 (python)

Fixed submission:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

def dpp(n):
    for i in range(2,n+1):
        if a[i] == 0:
            dp[i] = 0
        else:
            dp[i] = dp[i-1]+dp[i-2]
    return dp[n]

N,M = I()
a = [1]*(N +1)
for i in range(M):
    x = k()
    a[x] = 0

dp = [0]*(N+1)
if a[1] == 0:
    dp[1] = 0
    dp[0] = 1
else:
    dp[0] = dp[1] =1

print(dpp(N) % mod)

Buggy submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

def dpp(n):
    for i in range(2,n+1):
        if a[i] = 0:
            dp[i] = 0
        else:
            dp[i] = dp[i-1]+dp[i-2]
    return dp[n]

N,M = I()
a = [1]*(N +1)
for i in range(M):
    x = k()
    a[x] = 0

dp = [0]*(N+1)
if 1 in a:
    dp[1] = 0
    dp[0] = 1
else:
    dp[0] = dp[1] =1

print(dpp(N) % mod)

Buggy submission (verdict: Runtime Error):
import sys
sys.stdin.readline

def fibo(n):
    if n == 1:
        return 1
    elif n == 2:
        return 2
    else:
        if n not in stars and n-1 not in stars and n-2 not in stars:
            return fibo(n-1) + fibo(n-2)
        elif n not in stars and n-1 not in stars and n-2 in stars:
            return fibo(n-1)
        elif n not in stars and n-1 in stars and n-2 not in stars:
            return fibo(n-2)
        elif n in stars:
            return 0
        else:
            print(0)
            sys.exit()

N, M = map(int, input().split())
stars = []

for i in range(M):
    a = int(input())
    stars.append(a)

print(fibo(N) % 1000000007)
Problem p03137 (python)

Fixed submission:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

N, M = I()
X = l()
X.sort()
kyori = []

if N >= M:
    print(0)
    sys.exit()

if M == 1:
    print(0)
    sys.exit()
for i in range(len(X)-1):
    s = X[i+1]-X[i]
    kyori.append(s)

kyori.sort()
kyori.reverse()

for j in range(N-1):
    kyori.pop(0)

print(sum(kyori))

Buggy submission (verdict: Runtime Error):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

N, M = I()
X = l()
X.sort()
kyori = []

if M == 1:
    print(0)
    sys.exit()
for i in range(len(X)-1):
    s = X[i+1]-X[i]
    kyori.append(s)

kyori.sort()
kyori.reverse()

for j in range(N-1):
    kyori.pop(0)

print(sum(kyori))
Problem p03631 (python)

Fixed submission:
N = input()
if N[0] == N[2]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N = int(input())
if N[0] == N[2]:
    print("Yes")
else:
    print("No")
Problem p03804 (python)

Fixed submission:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()

n,m = I()
a = []
b = []

for _ in range(n):
    a += [list(input())]
for _ in range(m):
    b += [list(input())]

for i in range(n-m+1):
    for j in range(n-m+1):
        if [k[j:m+j] for k in a[i:m+i]] == b:
            print('Yes')
            exit()
print('No')

Buggy submission (verdict: Runtime Error):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()

n,m = I()
a = [v() for i in range(n)]
b = [v() for i in range(m)]

for j in range(m):
    place = []
    for i in range(n-m):
        if b[j] in a[i]:
            m_place = re.match(b[j],a[i])
            xxx = m_place.span()
            place.append(xxx)
    ans = list(set(place))
    if len(ans) == 1:
        print("Yes")
        sys.exit()

print("No")
Problem p02595 (python)

Fixed submission:
import math

def dist(x, y):
  return math.sqrt(x ** 2 + y ** 2)

(n, d) = map(int, input().split())
res = 0

for _ in range(n):
  (x, y) = map(int, input().split())
  res += 1 if dist(x, y) <= d else 0

print(res)

Buggy submission (verdict: Runtime Error):
import math

def dist(x, y):
  math.sqrt(x ^ 2 + y ^ 2)

(n, d) = map(int, input().split())
res = 0

for _ in range(n):
  (x, y) = map(int, input().split())
  res += 1 if dist(x, y) <= d else 0
  
print(res)
Problem p02779 (python)

Fixed submission:
from collections import Counter

n = int(input())
c = Counter(map(int, input().split()))

print("YES" if c.most_common(1)[0][1] <= 1 else "NO")

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

n = int(input())
c = Counter(map(int, input().split()))

print("YES" if c.most_common(1)[1] <= 1 else "NO")
Problem p02580 (python)

Fixed submission:
h, w, m = map(int, input().split())
bord_x, bord_y = [0]*h, [0]*w
 
hw = []
for _i in range(m):
    s, t = map(int, input().split())
    s -= 1
    t -= 1
    bord_x[s] += 1
    bord_y[t] += 1
    hw.append([s, t])
 
x_max, y_max = max(bord_x), max(bord_y)
 
cnt = 0
for i, j in hw:
    if bord_x[i] == x_max and bord_y[j] == y_max:
        cnt += 1
 
if cnt == bord_x.count(x_max)*bord_y.count(y_max):
    x_max -= 1
 
print(x_max+y_max)

Buggy submission (verdict: Runtime Error):
h, w, m = map(int, input().split())
bord_x, bord_y = [0 for i in range(h)], [0 for i in range(w)]
bord = [[0]*w for _i in range(h)]

hw = [list(map(int, input().split())) for _i in range(m)]

for s, t in hw:
    s -= 1
    t -= 1
    bord[s][t] += 1
    bord_x[s] += 1
    bord_y[t] += 1
x_max, y_max = max(bord_x), max(bord_y)
a = [x for x, p in enumerate(bord_x) if x_max==p]
b = [y for y, p in enumerate(bord_y) if y_max==p]

r = x_max + y_max - 1
for i in a:
    for j in b:
        if bord[i][j] >= 1:
            continue
        else:
            r += 1
            break
print(r)
Problem p02598 (python)

Fixed submission:
n, k = map(int, input().split())
a = [i-1 for i in map(int, input().split())]

left, right = 0, 10**9
while left < right:
    middle = (left+right)//2
    if middle==0:
        left=1
        break
    count = 0
    for i in a:
        count += i//middle
    
    if count <= k:
        right = middle
    else:
        left = middle + 1

print(left)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
a = [i-1 for i in map(int, input().split())]

left, right = 0, 10**9
while left < right:
    middle = (left+right)//2
    count = 0
    for i in a:
        count += i//middle
    
    if count <= k:
        right = middle
    else:
        left = middle + 1

print(left)
Problem p02793 (python)

Fixed submission:
from collections import defaultdict
n = int(input())
a = list(map(int, input().split()))

mod = 10**9 + 7
memo = defaultdict(int)
base = 0
for i in a:
    base = (base+pow(i, mod-2, mod))%mod
    num = i
    for j in range(2, int(i**.5)+1):
        if num%j==0:
            c = 0
            while num%j==0:
                num //= j
                c += 1
            memo[j] = max(memo[j], c)
    if num != 1:
        memo[num] = max(memo[num], 1)
k = 1
for s, t in memo.items():
    k = (k*pow(s, t, mod))%mod

print((k*base)%mod)

Buggy submission (verdict: Runtime Error):
from math import gcd
mod = 10**9 +7
n = int(input())
a = list(map(int, input().split()))
r = a[0]
for i in range(1, n):
    r = r*a[i]//gcd(r, a[i])
result = 0
for i in a:
    result = (result+r//i)%mod
print(result)
Problem p02954 (python)

Fixed submission:
s = [i for i in  list(input())]
x = 0
i = 0
a = []
result = []
while x < len(s)-1:
    while s[x] == s[i]:
        i += 1
        if i > len(s)-1:
            break
    a.append([s[x],int(i-x)])
    x = i
if a[-1][0] != 'L':
    a.append(['L',1])
for p in range(len(a)):
    if a[p][0] == 'R':
        result.extend([0]*(a[p][1]+1))
        result[len(result)-2] += a[p][1]//2+a[p][1]%2
        result[len(result)-1] += a[p][1]//2
    elif a[p][0] == 'L':
        result[len(result)-2] += a[p][1]//2
        result[len(result)-1] += a[p][1]%2+a[p][1]//2
        result.extend([0]*(a[p][1]-1))
print(' '.join(map(str, result)))

Buggy submission (verdict: Runtime Error):
s = [i for i in  list(input())]
x = 0
i = 0
a = []
result = []
while x < len(s)-1:
    while s[x] == s[i]:
        i += 1
    a.append([s[x],int(i-x)])
    x = i
if a[-1][0] == 'L':
    a[-1][1] += 1
else:
    a.append(['L', int(1)])
for p in range(len(a)):
    if a[p][0] == 'R':
        n = 0
        n = [0 for q in range(a[p][1]+1)]
        result.extend(n)
        result[len(result)-2] += a[p][1]//2
        result[len(result)-1] += a[p][1]%2+a[p][1]//2
    elif a[p][0] == 'L':
        result[len(result)-2] += a[p][1]//2
        result[len(result)-1] += a[p][1]%2+a[p][1]//2
        n = 0
        n = [0 for q in range(a[p][1]-1)]
        result.extend(n)
print(' '.join(map(str, result)))
Problem p02959 (python)

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

sum_a = sum(a)
for i in range(n):
    if a[i] <= b[i]:
        b[i] -= a[i]
        a[i] = 0
        if a[i+1] <= b[i]:
            a[i+1] = 0
        else:
            a[i+1] -= b[i]
    else:
        a[i] -= b[i]
print(sum_a-sum(a))

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

result = 0
sum_a = sum(a)
for i in range(n):
    if a[i] <= b[i]:
        b[i] -= a[i]
        a[i] = 0
        if a[i+1] <= b[i]:
            a[i+1] = 0
        else:
            a[i+1] -= b[i]
    else:
        a[i] -= b[i]
    print('a',a)
    print('b',b)
print(sum_a-sum(a))
Problem p02970 (python)

Fixed submission:
nd = list(map(int, input().split(' ')))

a = nd[0] // (nd[1]*2+1)

if (nd[0]%(nd[1]*2+1)) != 0:
    a += 1

print(a)

Buggy submission (verdict: Runtime Error):
a = n // (2*d+1)

if n%(2*d+1) == 0:
    print(a)
else:
    print(a+1)

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

a = n // (2*d+1)

if n%((2*d+1)*a) == 0:
    print(a)
else:
    print(a+1)
Problem p02987 (python)

Fixed submission:
y = sorted(list(input()))

if (y[0] == y[1]) and(y[2]== y[3])and(y[0]!=y[2]):
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
y = sorted(input().split())
if (y[0] == y[1]) and(y[2]== y[3]):
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
s = list(input().split())
y = sorted(s)

if (y[0] == y[1]) and(y[2]== y[3]):
    print('YES')
else:
    print('NO')
Problem p02990 (python)

Fixed submission:
import math
from scipy.misc import comb

def com(s, t):
    mod = 10**9+7
    t = min(s-t, t)
    S = 1
    T = 1
    for i in range(t):
        S = ((s-i)*S)%mod
        T = ((i+1)*T)%mod
    return (S*pow(T, mod-2, mod))%mod

def main():
    n, k = map(int, input().split())
    mod = 10**9+7
    for i in range(1, k+1):
        print(comb(n-k+1, i, exact=True)*comb(k-1, i-1, exact=True)%mod)

if __name__=='__main__':
    main()

Buggy submission (verdict: Runtime Error):
import math
from scipy.special import comb

def com(s, t):
    mod = 10**9+7
    t = min(s-t, t)
    S = 1
    T = 1
    for i in range(t):
        S = ((s-i)*S)%mod
        T = ((i+1)*T)%mod
    return (S*pow(T, mod-2, mod))%mod

def main():
    n, k = map(int, input().split())
    mod = 10**9+7
    for i in range(1, k+1):
        print(comb(n-k+1, i, exact=True)*comb(k-1, i-1, exact=True)%mod)

if __name__=='__main__':
    main()
Problem p03017 (python)

Fixed submission:
import sys
n, a, b, c, d = map(int, input().split())
s = input()
if any(s[i]==s[i+1]=="#" for i in range(a-1, c-2)) or any(s[i]==s[i+1]=="#" for i in range(b-1, d-2)):
    print("No")
elif c<d:
    print("Yes")
else:
    for i in range(b-1, d):
        if s[i-1]==s[i]==s[i+1]==".":
            print("Yes")
            sys.exit()
    print("No")

Buggy submission (verdict: Runtime Error):
n, a, b, c, d = map(int, input().split())
s = input()
if any(s[i]==s[i+1]=="#" for i in range(a-1, c-2)) or any(s[i]==s[i+1]=="#" for i in range(b-1, d-2)):
    print("No")
elif c<d:
    print("Yes")
else:
    for i in range(b-1, d-1):
        if s[i-1]==s[i]==s[i+1]==".":
            print("Yes")
            sys.exit()
    print("No")
Problem p03042 (python)

Fixed submission:
s = list(input())
f = int(''.join(s[:2]))
r = int(''.join(s[2:]))
yymm = 0
mmyy = 0
if 0 <= f and f <= 99:
    if 1<=r and r<= 12:
        yymm = 1
if 1<=f and f<= 12:
    if 0 <= r and r <= 99:
        mmyy = 1
if mmyy == 1 and yymm == 1:
    print('AMBIGUOUS')
elif mmyy == 0 and yymm == 1:
    print('YYMM')
elif mmyy == 1 and yymm == 0:
    print('MMYY')
else:
    print('NA')

Buggy submission (verdict: Runtime Error):
s = list(input())
f = int(''.join(s[:2]))
r = int(''.join(s[2:]))
yymm = 0
mmyy = 0
if 0 <= f and f <= 99:
    if 1<=r and r<= 12:
        yymm = 1
if 1<=f and f<= 12:
    if 0 <= r and r <= 99:
        mmyy = 1
if mmyy == 1 and yymm == 1:
    print('AMBIGUOUS')
elif mmyy == 0 and yymm == 1:
    print('YYMM')
elif myy == 1 and yymm == 0:
    print('MMYY')
else:
    print('NA')
Problem p03108 (python)

Fixed submission:
n, m = map(int, input().split(' '))
a = [0]*m
b = [0]*m
for i in range(m):
    a[i], b[i] = list(map(int, input().split(' ')))

c = [-1]*(m+2)

def find(num):
    if c[num] < 0:
        return num
    else:
        k = find(c[num])
        c[num] = k
        return k

result = [int(n*(n-1)/2)]
for i in range(m-1, 0,-1):
    x = find(a[i])
    y = find(b[i])

    if x != y:
        result.append(result[-1]-c[x]*c[y])
        x, y = sorted([x,y])
        c[x] += c[y]
        c[y] = x
    else:
        result.append(result[-1])

for i in result[::-1]:
    print(int(i))

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split(' '))
a = [0]*m
b = [0]*m
for i in range(m):
    a[i], b[i] = list(map(int, input().split(' ')))

c = [-1]*(m+1)

def find(num):
    if c[num] < 0:
        return num
    else:
        k = find(c[num])
        c[num] = k
    return k

result = [int(n*(n-1)/2)]
for i in range(m-1, 0,-1):
    x = find(a[i])
    y = find(b[i])

    if x != y:
        result.append(result[-1]-c[x]*c[y])
        x, y = sorted([x,y])
        c[x] += c[y]
        c[y] = x
    else:
        result.append(result[-1])

for i in result[::-1]:
    print(int(i))

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split(' '))
a = [0]*m
b = [0]*m
for i in range(m):
    a[i], b[i] = list(map(int, input().split(' ')))

c = [-1]*(m+1)

def find(num):
    if c[num] < 0:
        return num
    else:
        k = find(c[num])
        c[num] = k
        return k

result = [int(n*(n-1)/2)]
for i in range(m-1, 0,-1):
    x = find(a[i])
    y = find(b[i])

    if x != y:
        result.append(result[-1]-c[x]*c[y])
        x, y = sorted([x,y])
        c[x] += c[y]
        c[y] = x
    else:
        result.append(result[-1])

for i in result[::-1]:
    print(int(i))

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split(' '))
s = [list(map(int, input().split(' '))) for _ in range(m)]

dic = [x for x in range(n)]
result = [int(n*(n-1)/2)]
for i in range(1,m):
    if dic[s[-1*i][0]-1] == dic[s[-1*i][1]-1]:
        result.append(result[-1])
    else:
#        p = [x for x in dic if x == dic[s[-1*i][0]-1]]
#        q = [x for x in dic if x == dic[s[-1*i][1]-1]]
        p = x.count(dic[s[-1*i][0]-1])
        p = x.count(dic[s[-1*i][1]-1])
        result.append(result[-1]-len(p)*len(q))
        if len(p) < len(q):
            dic = [dic[s[-1*i][1]-1] if x == dic[s[-1*i][0]-1] else x for x in dic]
        else:
            dic = [dic[s[-1*i][0]-1] if x == dic[s[-1*i][1]-1] else x for x in dic]
for i in range(1,m+1):
    print(result[-1*i])
Problem p02793 (python)

Fixed submission:
from fractions import gcd
import sys

input = sys.stdin.readline

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

MOD = 10 ** 9 + 7


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


l = A[0]
for a in A:
    l = lcm(l, a)

res = 0
for a in A:
    res = (res + (l * pow(a, MOD - 2, MOD)) % MOD) % MOD
    # res = (res + l // a) % MOD

print(res)

Buggy submission (verdict: Runtime Error):
from collections import defaultdict
import math

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

MOD = 10 ** 9 + 7

primes = defaultdict(int)

for a in A:
    x = a
    p = 2
    for p in range(2, int(math.sqrt(a)) + 1):
        cnt = 0
        while x % p == 0:
            x //= p
            cnt += 1
        primes[p] = max(primes[p], cnt)
    if x > 1:
        primes[x] = max(primes[x], 1)

l = 1
for p in primes:
    l = (l * pow(p, primes[p], MOD)) % MOD

res = 0
for a in A:
    res = (res + (l * pow(a, MOD - 2, MOD) % MOD) % MOD

print(res)