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

Fixed submission:
import math

N,K = list(map(int,input().split()))
odd = 0

if N >= K:
  odd += (N-K+1)/N
  for i in range(K-1):
    if (math.log2(K/(i+1)))%1==0:
      odd += (i+1)/(K*N)
    else:
      odd += (1/N)*(0.5**(int(math.log2(K/(i+1)))+1))
else:
  for i in range(N):
    if (math.log2(K/(i+1)))%1==0:
      odd += (i+1)/(K*N)
    else:
      odd += (1/N)*(0.5**(int(math.log2(K/(i+1)))+1))
      
print(odd)

Buggy submission (verdict: Runtime Error):
import math

N,K = list(map(int,input().split()))
odd = 0

if N >= K:
  odd += (N-K+1)/N
  for i in range(K-1):
    if (math.log2(K/i))%1==0:
      odd += i/(K*N)
    else:
      odd += (1/N)*(0.5**(int(math.log2(K/i))+1))
else:
  for i in range(N):
    if (math.log2(K/i))%1==0:
      odd += i/(K*N)
    else:
      odd += (1/N)*(0.5**(int(math.log2(K/i))+1))
      
print(odd)
Problem p03076 (python)

Fixed submission:
import itertools
import math

A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())

tlist = [A, B, C, D, E]
l = itertools.permutations(tlist, 5)

t = []
count = 0

for i in l:
  count = 0
  for j in range(5):
    if j != 4 :
      count += int(math.ceil(i[j] / 10) * 10)
    else:
      count += i[j]
  t.append(count)
  
print(min(t))

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
 
min_list = [a,b,c,d,e]
min_q = [(a%10),(b%10),(c%10),(d%10),(e%10)]
q_min = min(min_q)
min_index = min_q.index(q_min)
new_min = min_list.pop(min_index)

minute = 0
for i in range(len(new_min)):
    if (new_min[i]%10)==0:
        minute += new_min[i]
    else:
        minute = 10-(new_min[i]%10)+new_min[i]
 
minute += min_list[min_index]
 
print(minute)

Buggy submission (verdict: Runtime Error):
int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
 
min_list = [a,b,c,d,e]
min_q = [(a%10),(b%10),(c%10),(d%10),(e%10)]
q_min = min(min_q)
min_index = min_q.index(q_min)
new_min = min_list.pop(min_index)

minute = 0
for i in range(len(min_list)):
    if (min_list[i]%10)==0:
        minute += min_list[i]
    else:
        minute = 10-(min_list[i]%10)+min_list[i]
 
minute += min_list[min_index]
 
print(minute)

Buggy submission (verdict: Runtime Error):
input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
 
min_list = [a,b,c,d,e]
 
minute = 0
for i in range(len(min_list-1)):
    if (min_list[i]%10)==0:
        minute += min_list[i]
    else:
        minute = 10-(min_list[i]%10)+min_list[i]

minute += min_list[4]
 
print(minute)

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())

min_list = [a,b,c,d,e]
amari_list = [(a%10),(b%10),(c%10),(d%10),(e%10)]
amari_list.sort()

minute = 0
for i in range(ren(amari_list)):
    if (amari_list[i]%10)==0:
        minute += amari_list[i]
    else:
        minute = 10-(amari_list[i]%10)+amari_list[i]

print(minute)


min_value = [i for i, x in enumerate(amari_list) if x == amari_min]
Problem p03086 (python)

Fixed submission:
string_list = list(input())
string_len = len(string_list)
renzoku_list = []

def find_letter():
  renzoku = 0
  for i in range(string_len):
    if string_list[i]=='A':
      renzoku += 1
    elif string_list[i]=='C':
      renzoku += 1
    elif string_list[i]=='G':
      renzoku += 1
    elif string_list[i]=='T':
      renzoku += 1
    else:
      renzoku_list.append(renzoku)
      renzoku = 0
  renzoku_list.append(renzoku)

find_letter()
  
if renzoku_list:
  max_len = max(renzoku_list)
  print(max_len)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
string_list = list(input())
string_len = len(string_list)
renzoku_list = []

def find_letter():
  renzoku = 0
  for i in range(string_len):
    if string_list[i]=='A':
      renzoku += 1
    elif string_list[i]=='C':
      renzoku += 1
    elif string_list[i]=='G':
      renzoku += 1
    elif string_list[i]=='T':
      renzoku += 1
    else:
      renzoku_list.append(renzoku)
      renzoku = 0

if 'A' in string_list:
  find_letter()
elif 'C' in string_list:
  find_letter()
elif 'G' in string_list:
  find_letter()
elif 'T' in string_list:
  find_letter()
else:
  print(0)
  
max_len = max(renzoku_list)
print(max_len)

Buggy submission (verdict: Runtime Error):
string_list = list(input())
string_len = len(string_list)
renzoku_list = []

def find_letter():
  renzoku = 0
  for i in string_len:
    if string_list[i]=='A':
      renzoku += 1
    elif string_list[i]=='C':
      renzoku += 1
    elif string_list[i]=='G':
      renzoku += 1
    elif string_list[i]=='T':
      renzoku += 1
    else:
      renzoku_list.append(renzoku)
      renzoku = 0

if 'A' in string_list:
  find_letter()
elif 'C' in string_list:
  find_letter()
elif 'G' in string_list:
  find_letter()
elif 'T' in string_list:
  find_letter()
else:
  print(0)
  
max_len = max(renzoku_list)
Problem p03087 (python)

Fixed submission:
N, Q = map(int,input().split())
S = list(input())
lr = [list(map(int,input().split())) for i in range(Q)]
ans = ''
a = [0]
count = 0
for i in range(N-1):
  if S[i] + S[i+1] == 'AC':
    ans += '1'
  else:
    ans += '0'
  if i == N - 2:
    ans += '0'
else:
  for i in range(N):
    if ans[i] == '1':
      count += 1
      a.append(count)
    else:
      a.append(count)
  else:
    for i in range(Q):
      l = lr[i][0]
      r = lr[i][1]
      print(a[r-1]-a[l-1])

Buggy submission (verdict: Runtime Error):
length = list(map(int,input().split()))	
string = input()
l_r = [list(map(int,input().split())) for i in range(length[1])]
answer = []

for i in range(length[1]):
  part_str = string[(l_r[i][0]-1):l_r[i][1]]
  for n in range(len(part_str)):
    answer.append(0)
    if part_str[n]=='A':
      if n != (len(part_str)-1):
        if part_str[n+1]=='C':
          answer[i] += 1
  print(answer[i])
Problem p03210 (python)

Fixed submission:
if int(input()) in [3, 5, 7]:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
#include <stdio.h>

int main() {
  int X;
  scanf("%d", &X);
  
  if (X == 3) {
    printf("YES");
  } else if (X == 5) {
    printf("YES");
  } else if (X == 7) {
    printf("YES");
  } else {
    printf("NO");
  }
  
  return 0;
  
}
Problem p03316 (python)

Fixed submission:
N = int(input())
S = 0

for i in range(len(str(N))):
  S += int(str(N)[i])
  
if N % S == 0:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
N = int(input())
S = 0

for i in range(len(str(N))):
  S += int(str(S)[i])
  
if N % S == 0:
  print('Yes')
else:
  print('No')
Problem p03160 (python)

Fixed submission:


n = int(input())

h = list(map(int, input().split()))

dp = [1000000000] * n
dp[0] = 0
for i in range(n):
    for j in [1, 2]:
        if i+j < n:
            dp[i+j] = min(dp[i+j], (dp[i] + abs(h[i] - h[i+j])))

print(dp[n-1])

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
 
h = list(map(int, input().split()))
 
dp = [1000000000] * n
dp[0] = 0
for i in range(n):
    for j in range(1, k+1):
        if i+j < n:
            dp[i+j] = min(dp[i+j], (dp[i] + abs(h[i] - h[i+j])))
 
print(dp[n-1])
Problem p02743 (python)

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

x = c - b - a
if x > 0 and a * b * 4 < x * x:
	print("Yes")
else:
    print("No")

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

x = c - b - a
if x > 0 && a * b * 4 < x * x:
	print("Yes")
else:
    print("No")
Problem p02657 (python)

Fixed submission:
lst=[int (x) for x in input().split(' ')]
print(lst[0]*lst[1])

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
PCM_Multiply=a*b
print(PCM_Multiply)

Buggy submission (verdict: Runtime Error):
a=int(input())
b=int(input())
num=a*b 
print(num)
Problem p02841 (python)

Fixed submission:
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if a[0]!=b[0]:
    print('1')
else:
    print('0')

Buggy submission (verdict: Runtime Error):
x = int(input())
n = x // 100

if x <= 105 * n:
  print(1)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
a=int(input())
for i in range(1,500001):
    if int(i*1.08)==a:
        print(i)
        break
else:
      print(':(')
Problem p02999 (python)

Fixed submission:
a=list(map(int,input().split()))
if a[0]<a[1]:
    print('0')
else:
    print('10')

Buggy submission (verdict: Runtime Error):
a=list(map(int,input().split()))
b=list(map(int,input().split()))
no=0
for i in range(0,a[0]):
    if b[i]<=a[1]:
        no+=1 
print(no)
Problem p03219 (python)

Fixed submission:
a=list(map(int,input().split()))
print(int(a[0]+(a[1]/2)))

Buggy submission (verdict: Runtime Error):
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
mn=abs(A-(T-H[0]*0.006))
c=0
for i in range(N):
    if mn>abs(A-(T-H[i]*0.006)):
        mn=abs(A-(T-H[i]*0.006))
        c=i
print(c+1)
Problem p02861 (python)

Fixed submission:
import math
import itertools

# 与えられた数値の桁数と桁値の総和を計算する.
def calc_digit_sum(num):
    digits = sums = 0
    while num > 0:
        digits += 1
        sums += num % 10
        num //= 10
    return digits, sums


n = int(input())
distances = []
for _ in range(n):
    points = list(map(int, input().split()))
    distances.append(points)

total = 0
routes = list(itertools.permutations(range(n), n))
for route in routes:
    distance = 0
    for index in range(len(route)-1):
        idx1 = route[index]
        idx2 = route[index+1]
        distance += math.sqrt((distances[idx1][0] - distances[idx2][0]) ** 2 + (distances[idx1][1] - distances[idx2][1]) ** 2)
    total += distance

print(total / len(routes))

Buggy submission (verdict: Runtime Error):
n = int(input())
distances = []
for _ in range(n):
    points = list(map(int, input().split()))
    distances.append(points)

total = 0
routes = list(itertools.permutations(range(n), n))
for route in routes:
    distance = 0
    for index in range(len(route)-1):
        idx1 = route[index]
        idx2 = route[index+1]
        distance += math.sqrt((distances[idx1][0] - distances[idx2][0]) ** 2 + (distances[idx1][1] - distances[idx2][1]) ** 2)
    total += distance

print(total / len(routes))
Problem p02603 (python)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
nums = []
nums.append(a[0])
for i in range(1, n):
    if a[i] != a[i-1]:
        nums.append(a[i])
    else:
        continue
val = nums[0]
maxs = []
for j in range(1, len(nums)):
    if nums[j] > val:
        maxs.append(j)
    else:
        pass
    val = nums[j]
pos = 0
money = 1000
for idx in maxs:
    minVal = min(nums[pos:idx])
    stocks = money // minVal
    money = money - minVal * stocks + nums[idx] * stocks
    pos = idx
print(money)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
money = 1000
nums = []
nums.append(a[0])
for i in range(1, n):
    if a[i] != a[i-1]:
        nums.append(a[i])
    else:
        continue
val = nums[0]
maxs = []
for j in range(1, len(nums)):
    if nums[j] > val:
        maxs.append(j)
    else:
        pass
    val = nums[j]
pos = 0
for idx in maxs:
    minVal = min(nums[pos:idx])
    stocks = money // minVal
    money = money - minVal * stocks + nums[idx] * stocks
    pos = idx + 1
print(money)
Problem p02621 (python)

Fixed submission:
a = int(input())
print(a + a**2 + a ** 3)

Buggy submission (verdict: Runtime Error):
import sys

n = sys.stdin.readlines()
print(n + n ** 2 + n ** 3)
Problem p02646 (python)

Fixed submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = abs(b - a) - (v - w) * t
if ans > 0:
    print('NO')
else:
    print('YES')

Buggy submission (verdict: Runtime Error):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = (b - a) - (v - w) * t
if ans > 0:
    print('NO')
elif ans <= 0 and (b - a) % (v - w) != 0:
    print('NO')
else:
    print('YES')
Problem p02741 (python)

Fixed submission:
nums = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k = int(input())
print(nums[k-1])

Buggy submission (verdict: Runtime Error):
nums = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k = int(input())
print(nums[k+1])
Problem p03000 (python)

Fixed submission:
n, x = map(int, input().split())
l = list(map(int, input().split()))
position = 0
cnt = 1
for i in range(n):
    position += l[i]
    if position <= x:
        cnt += 1
    else:
        break
print(cnt)

Buggy submission (verdict: Runtime Error):
n, x = map(int, input().split())
l = list(map(int, input().split()))
i = 0
position = 0
cnt = 0
while position <= x:
    cnt += 1
    position += l[i]
    i += 1
print(cnt)
Problem p03023 (python)

Fixed submission:
n = int(input())
ans = ( n - 2 ) * 180
print(ans)

Buggy submission (verdict: Runtime Error):
n = input()
print((n - 2)*180)
Problem p03076 (python)

Fixed submission:
five_dish = [int(input()) for _ in range(5)]
idx = 0
maxdiff = 0
result = 0
for i in range(len(five_dish)):
    tmp = five_dish[i] % 10
    if tmp != 0:
        if 10 - tmp > maxdiff:
            maxdiff = 10 - tmp
            idx = i
for j in range(len(five_dish)):
    if j == idx:
        continue
    else:
        if five_dish[j] % 10 == 0:
            result += five_dish[j]
        else:
            result += five_dish[j] + (10 - (five_dish[j] % 10))
result += five_dish[idx]
print(result)

Buggy submission (verdict: Runtime Error):
five_dish = [int(input()) for _ in range(5)]
idx = None
maxdiff = 0
result = 0
for i in range(len(five_dish)):
    tmp = five_dish[i] % 10
    if tmp == 0:
        pass
    else:
        if 10 - tmp > maxdiff:
            maxdiff = 10 - tmp
            idx = i
        else:
            pass
for j in range(len(five_dish)):
    if j == idx:
        pass
    else:
        if five_dish[j] % 10 == 0:
            result += five_dish[j]
        else:
            result += five_dish[j] + (10 - (five_dish[j] % 10))
result += five_dish[idx]
print(result)

Buggy submission (verdict: Runtime Error):
five_dish = [int(input()) for _ in range(5)]
idx = None
maxdiff = 0
result = 0
for i in range(len(five_dish)):
    tmp = five_dish[i] % 10
    if tmp == 0:
        continue
    else:
        if 10 - tmp >= maxdiff:
            maxdiff = 10 - tmp
            idx = i
        else:
            continue
for j in range(len(five_dish)):
    if j == idx:
        continue
    else:
        if five_dish[j] % 10 == 0:
            result += five_dish[j]
        else:
            result += five_dish[j] + (10 - five_dish[j] % 10)
result += five_dish[idx]
print(result)
Problem p02583 (python)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
ans = 0
l.sort(reverse=True)
for i in range(n-2):
  for j in range(i+1,n-1):
    for k in range(j+1,n):
      if(l[i]!=l[j])and(l[j]!=l[k])and(l[i]!=l[k])and(l[i]<l[j]+l[k]):
        ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
l = list(map(int,input().split()))
ans = 0
g = set(l)
m = list(g)
m.sort()
for i in range(n):
  judge = 0
  for j in range(i+1,n):
    for k in range(j+1,n):
      if(m[i]<m[j]+m[k]):
        ans += 1
      else:
        break
    if(judge==0):
      break
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
l = list(map(int,input().split()))
ans = 0
g = set(l)
m = list(g)
m.sort()
for i in range(n):
  judge = 0
  for j in range(i+1,n):
    for k in range(j+1,n):
      if(m[i]<[j]+[k]):
        ans += 1
      else:
        break
    if(judge==0):
      break
print(ans)
Problem p02584 (python)

Fixed submission:
x,k,d = map(int,input().split())
x = abs(x)
jud = x//d
if(k<=jud):
  print(abs(abs(x)-d*k))
else:
  if((k-jud)%2 == 1):
    print(abs(abs(x)-(jud+1)*d))
  else:
    print(abs(abs(x)-(jud)*d))

Buggy submission (verdict: Runtime Error):
x,k,d = map(int,input().split())
x = abs(x)
if (x<=k*d):
  print(x-k*d)
else:
  if((k-x//d)%2==1):
    print(abs(x-(x//d;1)*d))
  else:
    print(abs(x-(x//d)*d))

Buggy submission (verdict: Runtime Error):
x,k,d = map(int,input().split())
jud = x//d
if(k==1):
  print(abs(abs(x)-d))
elif(jud == 0):
  if((k%2 == 1):
    print(abs(abs(x)-d))
  else:
    print(abs(x))
elif(k<=jud+1):
  print(abs(abs(x)-d*k))
else:
  if((k-jud)%2 == 1):
    print(abs(abs(x)-(jud+1)*d))
  else:
    print(abs(abs(x)-(jud)*d))
Problem p02630 (python)

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
q = int(input())
num = []
summ = 0
for i in range(10**5):
  num.append(0)
for i in range(N):
  num[a[i]-1] += 1
  summ += a[i]
for i in range(q):
  b,c = map(int,input().split())
  summ += (c-b)*num[b-1]
  num[c-1] += num[b-1]
  num[b-1] = 0
  print(summ)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split()))
q = int(input())
num = []
summ = 0
for i in range(10**5):
  num.append(0)
for i in range(N):
  num[a[i]-1] += 1
  summ += a[i]
for i in range(q):
  b,c = map(int,input().split())
  summ += (c-b)*a[b-1]
  a[c-1] += a[b-1]
  a[b-1] = 0
  print(summ)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split()))
q = int(input())
num = []
summ = 0
for i in range(10**5):
  num.append(0)
for i in range(N):
  num[a[i]-1] += 1
  summ += 1
for i in range(q):
  b,c = map(int,input().split())
  summ += (c-b)*a[b-1]
  a[c-1] += a[b-1]
  a[b-1] = 0
  print(summ)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input()))
q = int(input())
for i in range(q):
  summ = 0
  b,c = map(int,input().split())
  for i in range(N):
    if(a[i]==b):
      a[i] = c
    summ += a[i]
  print(summ)
Problem p02641 (python)

Fixed submission:
x,n = map(int,input().split())
p = list(map(int,input().split()))
i = 0
ans = 0
while True:
  if(x-i in p):
    if(x+i in p):
      None
    else:
      ans = x+i
      break
  else:
    ans = x-i
    break
  i += 1
print(ans)

Buggy submission (verdict: Runtime Error):
x,n = map(int,input().split())
p = list(map(int,input.split()))
i = 0
ans = 0
while True:
  if(x-1 in p):
    if(x+1 in p):
      None
    else:
      ans = x+1
      break
  else:
    ans = x-1
    break
  i += 1
print(ans)

Buggy submission (verdict: Runtime Error):
x,n = map(int,input())
p = list(map(int,input.split()))
i = 0
ans = 0
while True:
  if(x-1 in p):
    if(x+1 in p):
      None
    else:
      ans = x+1
      break
  else:
    ans = x-1
    break
  i += 1
print(ans)
Problem p02658 (python)

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
ans = 1
if(0 in a):
  ans = 0
else:
  for i in range(N):
    ans*=a[i]
    if(ans>10**18):
      ans = -1
      break
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split()))
ans = 1
for i in range(n):
  ans *= a[i]
  if(ans>10**18):
    ans = -1
    break
print(ans)
Problem p02663 (python)

Fixed submission:
h_1,m_1,h_2,m_2,k = map(int,input().split())
H = 60*h_2+m_2-(60*h_1+m_1)-k
if(H<=0):
  print(0)
else:
  print(H)

Buggy submission (verdict: Runtime Error):
h_1,m_1_h_2,m_2,k = map(int,input().split())
H = 60*h_2+m_2-(60*h_1+m_1)-k
if(H<=0):
  print(0)
else:
  print(H)
Problem p02681 (python)

Fixed submission:
s=str(input())
t = str(input())
if(s==t[0:len(s)]):
  if(len(s)+1==len(t)):
    print("Yes")
  else:
    print("No")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
s＝ str(input())
t = str(input())
if(len(t)==len(s)+1):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
s＝str(input())
t = str(input())
if(len(t)==len(s)+1):
  print("Yes")
else:
  print("No")
Problem p02690 (python)

Fixed submission:
x = int(input())
judge = 0
for i in range(-200,200):
  for j in range(-200,200):
    if(i**5-j**5==x):
      print(i,j)
      judge += 1
      break
  if(judge == 1):
    break

Buggy submission (verdict: Runtime Error):
x = int(input())
judeg = 0
for i in range(-200,200):
  for j in range(-200,200):
    if(i**5-j**5==x):
      print(i,j)
      judge += 1
      break
  if(judge == 1):
    break
Problem p02706 (python)

Fixed submission:
n,m = map(int,input().split())
a = list(map(int,input().split()))
A = 0
for i in range(m):
  A += a[i]
k = n-A
if(k>=0):
  print(k)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(map(int,input.split()))
A = 0
for i in range(m):
  A += a[i]
if(A<=N):
  print(N-A)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
a = list(map(int,input()))
A = 0
for i in range(m):
  A += a[i]
if(A<=N):
  print(N-A)
else:
  print(-1)
Problem p02713 (python)

Fixed submission:
from math import gcd
k = int(input())
ans = 0
for i in range(1,k+1):
  for j in range(1,k+1):
    v = gcd(i,j)
    for m in range(1,k+1):
      ans += gcd(v,m)
print(ans)

Buggy submission (verdict: Runtime Error):
from math import gcd
k = int(input())
ans = 0
for i in range(1,k+1):
  for j in range(1,k+1):
    v = gcd(i,j)
    for m in range(1,k+1):
      ans += math.gcd(v,m)
print(ans)

Buggy submission (verdict: Runtime Error):
import math
k = int(input())
ans = 0
for i in range(1,k+1):
  for j in range(1,k+1):
    for m in range(1,k+1):
      ans += math.gcd(i,j,m)
print(ans)

Buggy submission (verdict: Runtime Error):
import math
k = int(input())
ans = 0
for i in range(1,k+1):
  ans += i
  for j in range(i+1,k+1):
    for m in range(m+1,k+1):
      ans += 3*math.gcd(math.gcd(i,j),m)
print(ans)
Problem p02718 (python)

Fixed submission:
N, M = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
K = 0
for i in range(N):
  K += a[i]
if(a[M-1]>=K/(4*M)):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
N, M = map(int,input().split())
a = list(map(int,input().split()))
a.sorted(reverse=True)
K = 0
for i in range(N):
  K += a[i]
if(a[M-1]>=K/(4*M)):
  print("Yes")
else:
  print("No")
Problem p02719 (python)

Fixed submission:
N,K = map(int,input().split())
H = 0
while True:
  if (N > K):
    H = N%K
  else:
    H = K-N
  if (H>N):
    break
  else:
    N = H
print(N)

Buggy submission (verdict: Runtime Error):
N,K = map(int,input().split())
int H = 0
while True:
  if (N > K):
    H = N-K
  else:
    H = K - N
  if (H>N):
    break
  else:
    N = H
print(N)
Problem p02760 (python)

Fixed submission:
a_1 = list(map(int,input().split()))
a_2 = list(map(int,input().split()))
a_3 = list(map(int,input().split()))
a = [a_1,a_2,a_3]
n = int(input())
for i in range(n):
  h = int(input())
  for j in range(3):
    for k in range(3):
      if(a[j][k]==h):
        a[j][k]=0
ans = "No"
for i in range(3):
  if(a[i][0]==0)and(a[i][0]==a[i][1])and(a[i][1]==a[i][2]):
    ans = "Yes"
for i in range(3):
  if(a[0][i]==0)and(a[0][i]==a[1][i])and(a[1][i]==a[2][i]):
    ans= "Yes"
if((a[0][0]==0)and(a[1][1]==a[2][2])and(a[0][0]==a[1][1]))or((a[0][2]==0)and(a[1][1]==a[2][0])and(a[0][2]==a[1][1])):
  ans = "Yes"
  
print(ans)

Buggy submission (verdict: Runtime Error):
a_1 = list(map(int,input().split()))
a_2 = list(map(int,input().split()))
a_3 = list(map(int,input().split()))
a = [a_1,a_2,a_3]
n = int(input())
for i in range(n):
  h = int(input())
  for j in range(3):
    for k in range(3):
      if(a[j][k]==h):
        a[j][k]=0
ans = "No"
for i in range(3):
  if(len(set(a[i]+[0]))==1):
    ans = "Yes"
for i in range(3):
  if(len(set([a[0][i],a[1][i],a[2][i],[0]]))==1):
    ans= "Yes"
if((a[0][0]==0)and(a[1][1]==a[2][2])and(a[0][0]==a[1][1]))or((a[0][2]==0)and(a[1][1]==a[2][0])and(a[0][2]==a[1][1])):
  ans = "Yes"
  
print(ans)

Buggy submission (verdict: Runtime Error):
a_1 = list(map(int,input().split()))
a_2 = list(map(int,input().split()))
a_3 = list(map(int,input().split()))
a = [a_1,a_2,a_3]
n = int(input()):
for i in range(n):
  h = int(input())
  for j in range(3):
    for k in range(3):
      if(a[j][k]==h):
        a[j][k]=0
ans = "No"
for i in range(3):
  if(a[i][0]==0)and(a[i][0]==a[i][1])and(a[i][1]==a[i][2]):
    ans = "Yes"
for i in range(3):
  if(a[0][i]==0)and(a[0][i]==a[1][i])and(a[1][i]==a[2][i]):
    ans= "Yes"
if((a[0][0]==0)and(a[1][1]==a[2][2])and(a[0][0]==a[1][1]))or((a[0][2]==0)and(a[1][1]==a[2][0])and(a[0][2]==a[1][1])):
  ans = "Yes"
  
print(ans)