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

Fixed submission:
S,W = [int(x) for x in input().split()]
if S>W:
  print("safe")
else:
  print("unsafe")

Buggy submission (verdict: Runtime Error):
S = int(input())
total = 0
keta = len(str(S))
for i in range(keta):
  for j in range(i+3,keta):
    n = (S%10**(keta-i))//10**(keta-j-1)
    #print(n)
    if n % 2019 == 0:
      total += 1
print(total)

Buggy submission (verdict: Runtime Error):
S = int(input())
total = 0
S1 = str(S)
for i in range(0,S,2019):
  j = str(i)
  if j in S1:
    total+=1
print(total)
Problem p02712 (python)

Fixed submission:
A = int(input())
total = 0
for x in range(A+1):
  if x%5!=0 and x%3!=0:
    total += x
print(total)

Buggy submission (verdict: Runtime Error):
A = int(input())
total = 0L
for x in range(A+1):
  if x%5!=0 and x%3!=0:
    total += x
print(x)
Problem p03038 (python)

Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
BC = {}
result_m = 0
for m in range(M):
  B, C = map(int, input().split())
  if BC.get(C) != None:
    BC[C] += B
  else:
    BC[C] = B
A.sort()
BC = sorted(BC.items(), reverse=True)
count = 0
for m in range(len(BC)):
  if count>=len(A):
    break
  if A[count]>BC[m][0]:
    break
  for i in range(BC[m][1]):
    if count>=len(A):
      break
    if BC[m][0] > A[count]:
      A[count] = BC[m][0]
      count+=1
print(sum(A))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
BC = {}
result_m = 0
for m in range(M):
  B, C = map(int, input().split())
  if BC.get(C) != None:
    BC[C] += B
  else:
    BC[C] = B
A.sort()
BC = sorted(BC.items(), reverse=True)
count = 0
for m in range(len(BC)):
  if count=>len(A):
    break
  if A[count]>BC[m][0]:
    break
  for i in range(BC[m][1]):
    if count=>len(A):
      break
    if BC[m][0] > A[count]:
      A[count] = BC[m][0]
      count+=1
print(sum(A))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
BC = {}
result_m = 0
for m in range(M):
  B, C = map(int, input().split())
  if BC.get(C) != None:
    BC[C] += B
  else:
    BC[C] = B
A.sort()
BC = sorted(BC.items(), reverse=True)
count = 0
for m in range(len(BC)):
  if A[count]>BC[m][0]:
    break
  for i in range(BC[m][1]):
    if count>=len(A):
      break
    if BC[m][0] > A[count]:
      A[count] = BC[m][0]
      count+=1
print(sum(A))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
BC = {}
result_m = 0
for m in range(M):
  B, C = map(int, input().split())
  if BC.get(C) != None:
    BC[C] += B
  else:
    BC[C] = B
A.sort()
BC = sorted(BC.items(), reverse=True)
count = 0
for m in range(len(BC)):
  if A[count]>BC[m][0]:
    break
  for i in range(BC[m][1]):
    if count=>len(A):
      break
    if BC[m][0] > A[count]:
      A[count] = BC[m][0]
      count+=1
print(sum(A))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
BC = {}
result_m = 0
for m in range(M):
  B, C = map(int, input().split())
  if BC.get(C) != None:
    BC[C] += B
  else:
    BC[C] = B
A.sort()
BC = sorted(BC.items(), reverse=True)
count = 0
for m in range(len(BC)):
  if A[count]>BC[m][0]:
    break
  for i in range(BC[m][1]):
    if BC[m][0] > A[count]:
      A[count] = BC[m][0]
      count+=1
print(sum(A))
Problem p02624 (python)

Fixed submission:
n = int(input())
res = 0
for i in range(1,n+1):
	k = n//i
	res += i*(k*(k+1)//2)
print(res)

Buggy submission (verdict: Runtime Error):
n = int(input())
res = 0
for i in range(1,n+1):
    k = n//i
    res += i*(k*(k+1)//2)
print res
Problem p02689 (python)

Fixed submission:
import sys
input = sys.stdin.readline

def peaks(n,m,h,ab):
    g = [0] * n
    path = [ [] for i in range(n)]
    #print(ab)
    for l,r in ab:
        path[l-1].append(r)
        path[r-1].append(l)

    #print(path)

    for i,p in enumerate(path):
        if p == []:
            g[i] = 1
            continue
        
        for j in p:
            #print(i+1,j,h[i],h[j-1])
            if h[i] > h[j-1]:
                g[i] = 1
            else:
                g[i] = 0
                break
    print(sum(g))

if __name__ == "__main__":
    n,m = map(int,input().split())
    h = list(map(int,input().split()))
    ab = [list(map(int,input().split())) for _ in range(m)]
    ab_sorted = sorted(ab)
    peaks(n,m,h,ab_sorted)

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

def ppp(n,m,h,ab):
    g = [1] * n
    for l,r in ab:
        if h[l-1] >= h[r-1]:
            g[r-1] = 0
        if h[l-1] <= h[r-1]:
            g[l-1] = 0
    print(sum(g))
if __name__ == "__main__":
    n,m = map(int,input().split())
    h = list(map(int,input().split()))
    ab = [list(map(int,input().split())) for _ in range(m)]
    ppp(n,m,h,ab_sorted)
Problem p03013 (python)

Fixed submission:
big = 10**9 + 7

def typical_stairs(n,m,a):

    flag = [True]*(n+1)
    for i in range(m):
        tmp = a[i]
        flag[tmp] = False

    route = [0]*(n+1)
    route[0] = 1
    ans = route[0]
    if flag[1]:
        route[1] = 1
    else:
        route[1] = 0

    for i in range(2,n+1):
        if flag[i]:
            route[i] = route[i-1] + route[i-2]

        ans = route[i]

    return ans%big
if __name__ == '__main__':
    n,m = map(int,raw_input().split())
    a = [int(raw_input()) for _ in range(m)]
    print typical_stairs(n,m,a)

Buggy submission (verdict: Runtime Error):
big = 10**9 + 7

def typical_stairs(n,m,a):

    flag = [True]*(n+1)
    for i in range(m):
        tmp = a[i]
        flag[tmp] = False

    route = [0]*(n+1)
    route[0] = 1
    if flag[1]:
        route[1] = 1
    else:
        route[1] = 0

    for i in range(2,n+1):
        if flag[i]:
            route[i] = route[i-1] + route[i-2]

        ans = route[i]

    return ans%big
if __name__ == '__main__':
    n,m = map(int,raw_input().split())
    a = [int(raw_input()) for _ in range(m)]

    print typical_stairs(n,m,a)
Problem p03017 (python)

Fixed submission:
N, A, B, C, D = map(int, input().split())
S = input()	# .#

if "##" in S[A-1:C]:
	print("No")
elif "##" in S[B-1:D]:
	print("No")
elif D < C:	# A jumps over B
	if not "..." in S[B-2:D+1]:
		print("No")
	else:
		print("Yes")
else:
	print("Yes")

Buggy submission (verdict: Runtime Error):
if "##" in S[A-1:C]:
	print("No")
elif "##" in S[B-1:D]:
	print("No")
elif D < C:	# A jumps over B
	if not "..." in S[B-2:D+1]:
		print("No")
	else:
		print("Yes")
else:
	print("Yes")

Buggy submission (verdict: Runtime Error):
if "##" in S[A-1:C]:
	print("No")
elif "##" in S[B-1:D]:
	print("No")
elif D < C:	# A jumps over B
	if not "..." in S[B-1:C]:
		print("No")
	elif S[B-1:D].count("...") < 2:
		if S[D-2:D+1] == "#..":
			print("No")
		else:
			print("Yes")
	else:
		print("Yes")
else:
	print("Yes")
Problem p03209 (python)

Fixed submission:
N, X = map(int, input().split())
hight, paty = [0]*51, [0]*51
hight[0] = 1
paty[0] = 1

for i in range(1, 51):
	hight[i] = 2*hight[i-1] + 3
	paty[i] = 2*paty[i-1] + 1

def f(n, x):
	if x == 0: return 0
	elif n == 0: return 1

	elif x <= (hight[n-1]+1):
		return f(n-1, x-1)
	else:
		return paty[n-1] + 1 + f(n-1, x-hight[n-1]-2)

print(f(N, X))

Buggy submission (verdict: Runtime Error):
N, X = map(int, input().split())
hight, paty = [0]*51, [0]*51
hight[0] = 1
paty[0] = 1

for i in range(1, 51):
	hight[i] = 2*hight[i-1] + 3
	paty[i] = 2*paty[i-1] + 1

def f(n, x):
	if x == 0: return 0

	if x < hight[n]//2:
		return f(n-1, x-1)
	if x >= hight[n]//2 :
		return paty[n-1] + 1 + f(n-1, x-hight[n-1]-2)

print(f(N, X))

Buggy submission (verdict: Runtime Error):
T = [1]*(N + 1)
P = [1]*(N + 1)
for i in range(1, N+1):
	P[i] = P[i-1]*2 + 1
	T[i] = T[i-1]*2 + 3
def pate(n, x):
	if n == 0:
		if x > 0: return 1
		return 0
	mid = T[n]//2
	if x < mid:
		return pate(n-1, x-1)
	elif mid == x:
		return 1 + pate(n-1, x-2)
	else:
		return P[n-1] + 1 + pate(n-1, x-mid-1)

print(pate(N, X))
Problem p03821 (python)

Fixed submission:
N = int(input())
cnt = 0
L = []
for i in range(N):
	L.append(list(map(int, input().split())))

L = L[::-1]
 
for i in range(N):
	A, B = L[i]
	if A:
		cnt += -(A + cnt)%B

print(cnt)

Buggy submission (verdict: Runtime Error):
N = int(input())
cnt = 0
L = []
for i in range(N):
	L.append(list(map(int, input().split())))

for i in range(N):
	A, B = L[-i+1]
	cnt += -(A + cnt)%B
print(cnt)

Buggy submission (verdict: Runtime Error):
N = int(input())
cnt = 0
L = []
for i in range(N):
	L.append(list(map(int, input().split())))

for i in range(N):
	A, B = L[-i+1]
	cnt += -(A + cnt)%B
	print(cnt)
Problem p02595 (python)

Fixed submission:
import math
n, d = map(int, input().split()) 
cnt=0
for i in range(0,n):
  x, y = map(int, input().split()) 
  z=math.sqrt((x*x)+(y*y))
  if(z<=d):
    cnt+=1
    
print(cnt)

Buggy submission (verdict: Runtime Error):
n=int(input())
d=int(input())
cnt=0
for i in range(0,n):
  x=int(input())
  y=int(input())
  z=sqrt((x*x)+(y*y))
  if(z>=d):
    cnt+=1
    
print(cnt)
Problem p02623 (python)

Fixed submission:
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]
b = [0]
for i in range(N):
  a.append(a[i] + A[i])
for i in range(M):
  b.append(b[i] + B[i])
  
ans = 0
j = M
for i in range(N+1):
  if a[i] > K:
    break
  while b[j] > K - a[i]:
    j -= 1
  ans = max(ans,i+j)
print(ans)

Buggy submission (verdict: Runtime Error):
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]
b = [0]
for i in range(N):
  a.append(a[i] + A[i])
for i in range(M):
  b.append(b[i] + B[i])
  
ans = 0
j = M
for i in range(N+1):
  if a[i] > K:
    break
  while b[i] > K - a[i]:
    j -= 1
  ans = max(ans,i+j)
print(ans)

Buggy submission (verdict: Runtime Error):
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]
b = [0]
for i in range(N):
  a.append(a[i] + A[i])
for i in range(M):
  b.append(b[i] + B[i])
  
ans = 0
j = M
for i in range(N+1):
  if a[i] > K:
    break
  while b[i] > K - a[i]:
    j -= 1
  ans = max(ans,i+j)
print(ans)

Buggy submission (verdict: Runtime Error):
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
C = A + B
for i in range(len(C)):
  C[i] = min(A[i],B[i])
  
for i in range(len(C)):
  if K => C[i]:
    K -= C[i]
    ans +=1
  else:
    break
print(ans)

Buggy submission (verdict: Runtime Error):
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
C = A + B
for i in range(len(C)):
  C[i] = min(A[i],B[i])
  
for i in range(len(C)):
  if K >= C[i]:
    K -= C[i]
    ans +=1
  else:
    break
print(ans)
Problem p02682 (python)

Fixed submission:
A,B,C,K = map(int,input().split())
 
if K <= A:
    print(str(K))
elif K <= A + B:
    print(str(A))
else:
    print(str(A - (C - (A + B + C - K))))

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

    
if A > K:
  print(A)
elif A <= K and A + B > K:
  print(A):
elif A <= K and A + B <= K:
  print(A - (K - A - B))
Problem p02879 (python)

Fixed submission:
i = list(map(int, input().split()))
if 1 <= i[0] <= 9 and 1 <= i[1] <= 9:
  print(i[0] * i[1])
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
i = list(map(int, input().split()))
if 1 <= i[0] <= 9 and 1 <= i[1] <= 9:
  return i[0] * i[1]
else:
  return -1

Buggy submission (verdict: Runtime Error):
i = list(map(int, input().split()))
if 0 <= i[0] <= 9 and 0 <= i[1] <= 9:
  return i[0] * i[1]
else:
  return -1

Buggy submission (verdict: Runtime Error):
i = list(map(int, input().split()))
if 0 <= i[0] and i[0] <= 9 and 0 <= i[1] and i[1] <= 9:
  return i[0] * i[1]
else:
  return -1
Problem p02880 (python)

Fixed submission:
n = int(input())
for i in range(1,10):
    for j in range(1,10):
        if i * j == n:
            print('Yes')
            break
        else:
            continue
    if i * j == n:
        break
    elif i == 9 and i * j != n:
        print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
for i in range(9):
  if n % i == 0 and n / i < 10:
    print('Yes')
  else:
    print('No')
Problem p02987 (python)

Fixed submission:
s = str(input())

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

Buggy submission (verdict: Runtime Error):
import math
def c(x,y):
  if x < y or y < 0:
    return 0
  elif x == 0 or y == 0:
    return 1
  else:
    s = math.factorial(n)
    t = math.factorial(n-k)
    u = math.factorial(k)
    return s//(t*u)


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

for i in range(1,k+1):
  sol = c(n-k+1,i)*c(k-1,i-1)
  m = 10**9 +7
  ans = sol%m
  print(ans)

Buggy submission (verdict: Runtime Error):
import math
def c(x,y):
  if x < y or y < 0:
    return 0
  elif x == 0 or y == 0:
    return 1
  else:
    s = math.factorial(n)
    t = math.factorial(n-k)
    u = math.factorial(k)
    return s//(t*u)

n,k = map(int,input().split())
m = 10**9 +7

for i in range(1,k+1):
  sol = c(n-k+1,i)*c(k-1,i-1)
  ans = sol%m
  print(ans)

Buggy submission (verdict: Runtime Error):
s = str(input())

if (s[0] == s[1] and s[2] == s[3])or(s[0] == s[2] and s[1] == s[3])or(s[0] == s[3] and s[1] == s[2]):
  print(Yes)
elif s[0] == s[1] and s[0] == s[2] and s[0] == s[3]:
  print(No)
else:
   print(No)
Problem p02989 (python)

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

d.sort()

a = d[int(n/2)-1]
b = d[int(n/2)]

print(b-a)

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

t = d.sort()

a = t[(n/2)-1]
b = t[(n/2)]

print(b-a)
Problem p02594 (python)

Fixed submission:
x = int(input().strip())
if x>=30:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
x = int(input())
if x>=30:
  print("Yes")
  else:
    print("No")
Problem p03038 (python)

Fixed submission:
def main():
    N, M = map(int, input().split())
    A = sorted(list(map(int, input().split())))
    BC = []
    for _ in range(M):
        B, C = map(int, input().split())
        BC.append((B, C))
    BC = sorted(BC, key=lambda x: x[1], reverse=True)
    i = 0
    for b, c in BC:
        for _ in range(b):
            if i >= len(A) or A[i] >= c:
                break
            A[i] = c
            i += 1
    print(sum(A))


main()

Buggy submission (verdict: Runtime Error):
def main():
    N, M = map(int, input().split())
    A = sorted(list(map(int, input().split())))
    BC = []
    for _ in range(M):
        B, C = map(int, input().split())
        BC.append((B, C))
    BC = sorted(BC, key=lambda x: x[1], reverse=True)
    i = 0
    for b, c in BC:
        for _ in range(b):
            if A[i] >= c:
                break
            A[i] = c
            i += 1
    print(sum(A))


main()
Problem p03137 (python)

Fixed submission:
def main():
    N, M = map(int, input().split())
    X = sorted(list(map(int, input().split())))

    if M == 1:
        print(0)
    elif N == 1:
        print(max(X) - min(X))
    else:
        if N > M:
            N = M
        dx = sorted([abs(X[m] - X[m + 1]) for m in range(M - 1)])
        print(sum(dx[:M - N]))


main()

Buggy submission (verdict: Runtime Error):
def main():
    N, M = map(int, input().split())
    X = sorted(list(map(int, input().split())))

    if M == 1:
        print(0)
    elif N == 1:
        print(max(X) - min(X))
    else:
        dx = [abs(X[m] - X[m + 1]) for m in range(M - 1)]
        for _ in range(N - 1):
            dx.pop(dx.index(max(dx)))
        print(sum(dx))


main()
Problem p03208 (python)

Fixed submission:
def main():
    N, K = list(map(int, input().split()))
    hs = [int(input()) for i in range(N)]
    hs.sort()
    i = 0
    r = 10 ** 9
    while True:
        if i + K > N:
            break
        r = min(r, hs[i + K - 1] - hs[i])
        i += 1
    print(r)


if __name__ == '__main__':
    main()

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


def check(k, hs, mx, mn, r):
    if mx - mn > r:
        return r
    if k == 0:
        return min(r, mx - mn)
    for i, h in enumerate(hs):
        hs.remove(h)
        r = min(r, check(k - 1, hs, max(mx, h), min(mn, h), r))
        hs.insert(i, h)
    return r


def main():
    hs = [int(input()) for i in range(N)]
    print(check(K, hs, 0, 10 ** 9, 10 ** 9))


if __name__ == '__main__':
    main()

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


def check(k, hs, mx, mn, memo):
    if (k, mx, mn) in memo:
        return memo[(k, mx, mn)]
    if k == 0:
        return mx - mn
    r = []
    for i, h in enumerate(hs):
        hs.remove(h)
        r.append(check(k - 1, hs, max(mx, h), min(mn, h), memo))
        hs.insert(i, h)
    memo[(k, mx, mn)] = min(r)
    return min(r)


def main():
    hs = [int(input()) for i in range(N)]
    print(check(K, hs, 0, 10 ** 9, {}))


if __name__ == '__main__':
    main()

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


def check(k, hs, mx, mn):
    if k == 0:
        return mx - mn
    r = []
    for i, h in enumerate(hs):
        hs.remove(h)
        r.append(check(k - 1, hs, max(mx, h), min(mn, h)))
        hs.insert(i, h)
    return min(r)


def main():
    hs = [int(input()) for i in range(N)]
    print(check(K, hs, 0, 10 ** 9))


if __name__ == '__main__':
    main()

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


def check(k, hs, s):
    if k == 0:
        return max(s) - min(s)
    r = []
    for i, h in enumerate(hs):
        s.append(h)
        hs.remove(h)
        r.append(check(k - 1, hs, s[::]))
        s.pop(-1)
        hs.insert(i, h)
    return min(r)


def main():
    hs = [int(input()) for i in range(N)]
    print(check(K, hs, []))


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

Fixed submission:
def main():
    N, M = list(map(int, input().split()))

    pref = []
    for _ in range(M):
        P, Y = list(map(int, input().split()))
        pref.append((P, Y))

    pref_sorted = sorted(enumerate(pref), key=lambda x: x[1])

    idx = [1 for _ in range(N)]
    res = ['' for _ in range(M)]
    for j, (p, y) in pref_sorted:
        res[j] = str(p).zfill(6) + str(idx[p - 1]).zfill(6)
        idx[p - 1] += 1
    for r in res:
        print(r)


if __name__ == '__main__':
    main()

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

    pref = []
    for _ in range(M):
        P, Y = list(map(int, input().split()))
        pref.append((P, Y))

    pref_sorted = sorted(enumerate(pref), key=lambda x: x[1])

    idx = [1 for _ in range(M)]
    res = ['' for _ in range(M)]
    for j, (p, y) in pref_sorted:
        res[j] = str(p).zfill(6) + str(idx[p]).zfill(6)
        idx[p] += 1
    for r in res:
        print(r)


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

Fixed submission:
import sys
sys.setrecursionlimit(1000001)

N = int(input())
D = [[] for _ in range(N + 1)]
for _ in range(N - 1):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    D[a].append((b, c))
    D[b].append((a, c))
Q, K = map(int, input().split())
DS = [-1] * (N + 2)


def dfs(c, p, d):
    DS[c] = d
    for r in D[c]:
        if r[0] == p:
            continue
        dfs(r[0], c, d + r[1])


def main():
    dfs(K - 1, -1, 0)
    for _ in range(Q):
        x, y = map(int, input().split())
        print(DS[x - 1] + DS[y - 1])


main()

Buggy submission (verdict: Runtime Error):
N = int(input())
D = [[] for _ in range(N + 1)]
for _ in range(N - 1):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    D[a].append((b, c))
    D[b].append((a, c))
Q, K = map(int, input().split())
DS = [-1] * (N + 2)


def dfs(c, p, d):
    DS[c] = d
    for r in D[c]:
        if r[0] == p:
            continue
        dfs(r[0], c, d + r[1])


def main():
    dfs(K - 1, -1, 0)
    for _ in range(Q):
        x, y = map(int, input().split())
        print(DS[x - 1] + DS[y - 1])


main()

Buggy submission (verdict: Runtime Error):
N = int(input())
D = [[] for _ in range(N + 1)]
for _ in range(N - 1):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    D[a].append((b, c))
    D[b].append((a, c))
Q, K = map(int, input().split())
DS = [-1] * (N + 2)


def dfs(c, p, d):
    DS[c] = d
    for r in D[c]:
        if r[0] == p:
            continue
        dfs(r[0], c, d + r[1])


def main():
    dfs(K - 1, -1, 0)
    for _ in range(Q):
        x, y = map(int, input().split())
        print(DS[x - 1] + DS[y - 1])


main()

Buggy submission (verdict: Runtime Error):
N = int(input())
D = [[] for _ in range(N + 1)]
for _ in range(N - 1):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    D[a].append((b, c))
    D[b].append((a, c))
Q, K = map(int, input().split())
DS = [-1] * (N + 1)


def dfs(c, p, d):
    DS[c] = d
    for r in D[c]:
        if r[0] == p:
            continue
        dfs(r[0], c, d + r[1])


def main():
    dfs(K - 1, -1, 0)
    for _ in range(Q):
        x, y = map(int, input().split())
        print(DS[x - 1] + DS[y - 1])


main()
Problem p03804 (python)

Fixed submission:
def main():
    N, M = map(int, input().split())
    A = [input() for _ in range(N)]
    B = [input() for _ in range(M)]
    for i in range(N):
        for j in range(N):
            f = True
            for k in range(M):
                for l in range(M):
                    if i + k >= N or j + l >= N:
                        f = False
                        break
                    if A[i + k][j + l] != B[k][l]:
                        f = False
                        break
                if f is False:
                    break
            if f is True:
                print('Yes')
                exit()
    print('No')


main()

Buggy submission (verdict: Runtime Error):
def main():
    N, M = map(int, input().split())
    A = [input() for _ in range(N)]
    B = [input() for _ in range(M)]
    for i in range(N):
        for j in range(N):
            f = True
            for k in range(M):
                for l in range(M):
                    if A[i + k][j + l] != B[k][l]:
                        f = False
                        break
                if f is False:
                    break
            if f is True:
                print('Yes')
                exit()
    print('No')


main()
Problem p02572 (python)

Fixed submission:
n = input()
vals = list(map(int, input().split()))
s = sum(vals)
ret = 0
for i, val in enumerate(vals):
    ret += val * (s - val)

mod = 10 ** 9 + 7
print(int(ret//2) % mod)

Buggy submission (verdict: Runtime Error):
n = input()
vals = list(map(int, input().split()))
s = sum(vals)
ret = 0
for i, val in enumerate(vals):
    ret += val * (s - val)

mod = 10 ** 9 + 7
print(int(ret/2) % mod))

Buggy submission (verdict: Runtime Error):
n = input()
vals = list(map(int, input().split()))
s = sum(vals)
ret = 0
for i, val in enumerate(vals):
    ret += val * (s - val)

mod = 10 ** 9 + 7
print(int(ret/2) % mod))