Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#n=6 k=4
#
# 3 1 2 4 5 6


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

id_of_one = lst.index(1) #リスト内の最小値1のインデックスを取得

left = len(lst[0:id]) #1より左側にある数列の長さ
right = len(lst[id+1:]) #1より右側にある数列の長さ
total = left + right

amari = max(left%(k-1),right%(k-1))
total -= amari



counter = 0
while total > 0:
    counter += 1
    total -= k - 1

print(counter)

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

id = lst.index(1)

left = len(lst[0:id])
right = len(lst[id+1:])
mod = max(left%(k-1),right%(k-1))

total = left + right

counter = 0
while total > 0:
    counter += 1
    total -= k - 1

print(counter)

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

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

id_one = lst.index(1)
left_length = len(lst[0:id_one]-1)
right_length = len(lst[id_one:]-1)

counter = 0

if left_length > 0:
    left_length -= k
    counter += 1

while left_length > 0:
    counter += 1
    left_length -= k-1

if right_length > 0:
    counter += 1
    right_length -= k

while right_length > 0:
    counter += 1
    right_length -= k-1

print(counter)

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

id = lst.index(1)

left = len(lst[0:id])
right = len(lst[id+1:])
mod = max(left%(k-1),right%(k-1))

total = left + right

counter = 0
while total > 0:
    counter += 1
    total -= k - 1

print(counter)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input())
print(max(max(a+b,a-b),a*B))

Fixed submission:
def main():
    a,b = map(int,input().split())
    print(max(a+b,a-b,a*b))

if __name__ == '__main__':
    main()

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input())
print(max(a+b,a-b,a*b))

Fixed submission:
def main():
    a,b = map(int,input().split())
    print(max(a+b,a-b,a*b))

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    center = (n+1)//2
    x_s = list(map(int,input().split()))
    sorted_x_s = sorted(x_s)

    for i in x_s:
        if sorted_x_s.index(i) < center:
            print(sorted_x_s[center])
        else:
            print(sorted_x_s[center-1])






if __name__ == '__main__':
    main()


Fixed submission:
def main():
    n = int(input())
    center = (n+1)//2
    x_s = list(map(int,input().split()))
    sorted_x_s = sorted(x_s)
    center_num = sorted_x_s[center]

    for i in x_s:
        if i < center_num:
            print(sorted_x_s[center])
        else:
            print(sorted_x_s[center-1])






if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
from functools import reduce
def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return a


#最小公倍数
def lcm(a,b):
  return a * b//gcd(a,b) a


if __name__ == "__main__":
    n = int(input())
    lst = []
    for i in range(n):
        lst.append(int(input()))
    print(reduce(lcm,lst))





Fixed submission:
from functools import reduce
def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return a


#最小公倍数
def lcm(a,b):
  return b//gcd(a,b) * a


if __name__ == "__main__":
    n = int(input())
    lst = []
    for i in range(n):
        lst.append(int(input()))
    print(reduce(lcm,lst))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())

if a % 3 == 0 or b % 3 == 0 or (a+b)%3 == 0:
  print("Possible")
else:
  print("Impossible")

Fixed submission:
a,b = map(int,input().split())
     
if a % 3 == 0 or b % 3 == 0 or (a+b)%3 == 0:
      print("Possible")
else:
      print("Impossible")
Buggy python submission (verdict: Runtime Error):

from collections import  deque
n = int(input())
lst = list(map(int,input().split()))
reverse = False
b = deque()
for a in lst:
	if reverse:
		b.appendleft(a)
	else:
		b.append(a)
	reverse = not reverse

answer =[]
if reverse:
	while b:
		answer.append(b.pop())
else:
	while b:
		answer.append(b.popleft())

print(" ".join(answer))

Fixed submission:

from collections import  deque
n = int(input())
lst = list(input().split())
reverse = False
b = deque()
for a in lst:
	if reverse:
		b.appendleft(a)
	else:
		b.append(a)
	reverse = not reverse

answer =[]
if reverse:
	while b:
		answer.append(b.pop())
else:
	while b:
		answer.append(b.popleft())

print(" ".join(answer))
Buggy python submission (verdict: Runtime Error):
    rgb = int(input().replace(" ",""))
     
    if rgb % 4 == 0:
      print("YES")
    else:
      print("NO")

Fixed submission:
rgb = int(input().replace(" ",""))
     
if rgb % 4 == 0:
      print("YES")
else:
      print("NO")

Buggy python submission (verdict: Runtime Error):
rgb = int(input().replace(" ","").)

if rgb % 4 == 0:
  print("YES")
else:
  print("NO")

Fixed submission:
rgb = int(input().replace(" ",""))
     
if rgb % 4 == 0:
      print("YES")
else:
      print("NO")
Buggy python submission (verdict: Runtime Error):
a,b= map(int,inpit()split())
print(a+b if a+b<10 else "error")

Fixed submission:

a,b= map(int,input().split())
print(a+b if a+b<10 else "error")
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split(" "))

city_road_count = [0] * m
for i in range(m):
  a,b = map(int,input.split(" "))
  city_road_count[a-1] += 1
  city_road_count[b-1] += 1
  
for c in city_road_count:
  print(c)

Fixed submission:
n,m = map(int,input().split(" "))

city_road_count = [0] * n
for i in range(m):
      a,b = map(int,input().split(" "))
      city_road_count[a-1] += 1
      city_road_count[b-1] += 1
      
for c in city_road_count:
      print(c)

Buggy python submission (verdict: Runtime Error):


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

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

def count_road(n,m,str_roads):
    city_roads_count = [0] * m
    for road in str_roads:
        a,b = map(int,input().split(" "))
        city_roads_count[a-1] += 1
        city_road_count[b-1] += 1
    return city_roads_count

roads_count = count_road(n,m,roads)

for road_count in roads_count:
    print(road)

Fixed submission:
n,m = map(int,input().split(" "))

city_road_count = [0] * n
for i in range(m):
      a,b = map(int,input().split(" "))
      city_road_count[a-1] += 1
      city_road_count[b-1] += 1
      
for c in city_road_count:
      print(c)

Buggy python submission (verdict: Runtime Error):

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

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

def count_road(n,m,str_roads):
    city_roads_count = [0] * m
    for road in str_roads:
        a,b = map(int,input().split(" "))
        city_roads_count[a-1] += 1
        city_road_count[b-1] += 1
    return city_roads_count


for road_cout in roads_count:
    print(road)

Fixed submission:
n,m = map(int,input().split(" "))

city_road_count = [0] * n
for i in range(m):
      a,b = map(int,input().split(" "))
      city_road_count[a-1] += 1
      city_road_count[b-1] += 1
      
for c in city_road_count:
      print(c)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split(" "))
city_road_counts = [0] * m
for i in range(m):
  a,b = map(int,input().split(" "))
  a = a-1
  b = b-1
  city_road_counts[a] += 1
  city_road_counts[b] += 1

for road_count in city_road_counts:
  print(road_count)

Fixed submission:
n,m = map(int,input().split(" "))

city_road_count = [0] * n
for i in range(m):
      a,b = map(int,input().split(" "))
      city_road_count[a-1] += 1
      city_road_count[b-1] += 1
      
for c in city_road_count:
      print(c)
Buggy python submission (verdict: Runtime Error):
食べた回数=int(input())
値段=800
ボーナス=200
支払うお金=食べた回数 * 値段
もらうお金=食べた回数//15 * ボーナス
     
    print(支払うお金-もらうお金)

Fixed submission:
n = int(input())

give = n * 800
take = n // 15 * 200

print(give - take)

Buggy python submission (verdict: Runtime Error):
食べた回数= int(input())
値段=800
ボーナス=200
支払うお金= 食べた回数 * 値段
もらうお金=　食べた回数//15 * ボーナス

print(支払うお金 - もらうお金)

Fixed submission:
n = int(input())

give = n * 800
take = n // 15 * 200

print(give - take)
Buggy python submission (verdict: Runtime Error):
    n = int(input())
    temp = 1
     
    for i in range(1,n+1):
      temp = temp + i
      temp = temp % (10**10)
     
    print(int(temp % (10 ** 9 + 7)))

Fixed submission:
n = int(input())
temp = 1
     
for i in range(1,n+1):
  temp = temp * i
  temp = temp % ((10**9)+7)
     
print(temp % (10 ** 9 + 7))

Buggy python submission (verdict: Runtime Error):
n = int(input())
temp = 1
for i in range(1,n+1):
  temp = temp * i
  
 print(temp)


Fixed submission:
n = int(input())
temp = 1
     
for i in range(1,n+1):
  temp = temp * i
  temp = temp % ((10**9)+7)
     
print(temp % (10 ** 9 + 7))
Buggy python submission (verdict: Runtime Error):
a,op,b= map(int,onput().split())

func = lambda x,y:x + y if op =="+" else lambda x,y:x-y

print(func(a,b))

Fixed submission:

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


func = (lambda x,y:x+y) if op =="+" else (lambda x,y:x-y)
print(func(a,b))
Buggy python submission (verdict: Runtime Error):
%%time
n = int(input())

# c = N - a*b
cnt = 0
for a in range(1, n, 1):
    for b in range(1, n, 1):
        if n <= a*b:
            break
        else:
            if a != b:
                cnt += 2
            else:
                cnt += 1
                break

print(cnt)

Fixed submission:
n = int(input())

# c = N - a*b
cnt = 0
for a in range(1, n, 1):
    for b in range(1, n, 1):
        if n <= a*b:
            break
        else:
            if a != b:
                cnt += 2
            else:
                cnt += 1
                break

print(cnt)

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

# c = N - a*b
cnt = 0
for a in range(1, n, 1):
    for b in range(1, n, 1):
        if n <= a*b:
            break
        else:
            cnt += 1

print(cnt)

Fixed submission:
n = int(input())

# c = N - a*b
cnt = 0
for a in range(1, n, 1):
    for b in range(1, n, 1):
        if n <= a*b:
            break
        else:
            if a != b:
                cnt += 2
            else:
                cnt += 1
                break

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

while k > 0:
  if b <= a:
    b *= 2
    k -= 1
  else:
    break
if k > 0:
  multiplier = 2 ** k
  if c * multiplier > b:
    ans = 'Yes'
  else:
    ans = 'No'

print(ans)


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

if b > a:
  multiplier = 2 ** k
  if c * multiplier > b:
    ans = 'Yes'
  else:
    ans = 'No'
else:
  while b <= a:
    b *= 2
    k -= 1
  multiplier = 2 ** k
  if c * multiplier > b:
    ans = 'Yes'
  else:
    ans = 'No'

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
a, b, c = map(int, input().split())
k = int(input())

while k > 0:
  if b < a:
    b *= 2
    k -= 1
  elif c < b:
    c *= 2
    k -= 1

if a < b and b < c:
  print('Yes')
else:
  print('No')

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

if b > a:
  multiplier = 2 ** k
  if c * multiplier > b:
    ans = 'Yes'
  else:
    ans = 'No'
else:
  while b <= a:
    b *= 2
    k -= 1
  multiplier = 2 ** k
  if c * multiplier > b:
    ans = 'Yes'
  else:
    ans = 'No'

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
scores = list(map(int, input().split()))

evals = []
eval = scores[0:k]
for i in range(k, n, 1):
    new = scores[i-k+1:i+1]
    if eval[0] < new[-1]:
        evals.append('Yes')
    else:
        evals.append('No')
    eval = new

for ans in evals:
    print(ans)

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

evals = []
cnt = 0

for i in range(k, n, 1):
    edge = scores[cnt]
    new_edge = scores[i]
    if edge < new_edge:
        print('Yes')
    else:
        print('No')
    cnt += 1

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
scores = list(map(int, input().split()))

evals = []
for i in range(k-1, n, 1):
    eval = scores[i+1-k:i+1]
    sum = 1
    for j in eval:
        sum *= j
    evals.append(sum)

for k in range(1, len(evals), 1):
    print('Yes' if evals[k-1] < evals[k] else 'No')

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

evals = []
cnt = 0

for i in range(k, n, 1):
    edge = scores[cnt]
    new_edge = scores[i]
    if edge < new_edge:
        print('Yes')
    else:
        print('No')
    cnt += 1

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
scores = list(map(int, input().split()))

evals = []
for i in range(0, n-k+1, 1):
  for_eval = scores[i:k+i]
  eval = 1
  for j in for_eval:
    eval *= j
  evals.append(eval)

for i in range(1, n-k+1, 1):
  print('Yes' if evals[i-1] < evals[i] else 'No')

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

evals = []
cnt = 0

for i in range(k, n, 1):
    edge = scores[cnt]
    new_edge = scores[i]
    if edge < new_edge:
        print('Yes')
    else:
        print('No')
    cnt += 1
Buggy python submission (verdict: Time Limit Exceeded):
import math

n = int(input())
answer_list = []
for x in range(1, int(math.sqrt(n+1)), 1):
    for y in range(1, int(math.sqrt(n+1)), 1):
        for z in range(1, int(math.sqrt(n+1)), 1):
            formula = (x+y+z)**2 - (x*y + y*z + z*x)
            if formula <= n:
                answer_list.append(formula)
            else:
                break
for i in range(1, n+1, 1):
    print(answer_list.count(i))

Fixed submission:
import math

n = int(input())
answer_lists = [0 for i in range(10001)]
for x in range(1, int(math.sqrt(n+1)), 1):
    for y in range(1, int(math.sqrt(n+1)), 1):
        for z in range(1, int(math.sqrt(n+1)), 1):
            formula = (x+y+z)**2 - (x*y + y*z + z*x)
            if formula <= n:
                answer_lists[formula] += 1
            else:
                break
for i in range(1, n+1, 1):
    print(answer_lists[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
answer_list = []
for x in range(1, 99, 1):
    for y in range(1, 99, 1):
        for z in range(1, 99, 1):
            formula = (x+y+z)**2 - (x*y + y*z + z*x)
            if formula <= n:
                answer_list.append(formula)
            else:
                break
for i in range(1, n+1, 1):
    print(answer_list.count(i))

Fixed submission:
import math

n = int(input())
answer_lists = [0 for i in range(10001)]
for x in range(1, int(math.sqrt(n+1)), 1):
    for y in range(1, int(math.sqrt(n+1)), 1):
        for z in range(1, int(math.sqrt(n+1)), 1):
            formula = (x+y+z)**2 - (x*y + y*z + z*x)
            if formula <= n:
                answer_lists[formula] += 1
            else:
                break
for i in range(1, n+1, 1):
    print(answer_lists[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
answer_list = []
for x in range(1, 99, 1):
    for y in range(1, 99, 1):
        for z in range(1, 99, 1):
            formula = (x+y+z)**2 - (x*y + y*z + z*x)
            if formula <= n:
                answer_list.append(formula)
            else:
                break
for i in range(1, n+1, 1):
    print(answer_list.count(i))

Fixed submission:
import math

n = int(input())
answer_lists = [0 for i in range(10001)]
for x in range(1, int(math.sqrt(n+1)), 1):
    for y in range(1, int(math.sqrt(n+1)), 1):
        for z in range(1, int(math.sqrt(n+1)), 1):
            formula = (x+y+z)**2 - (x*y + y*z + z*x)
            if formula <= n:
                answer_lists[formula] += 1
            else:
                break
for i in range(1, n+1, 1):
    print(answer_lists[i])
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
prices = list(map(int, input().split()))

prices = prices.sorted()

answer = 0
for i in range(0, k, 1):
  answer = answer + prices[i]
print(answer)

Fixed submission:
import numpy as np

n, k = map(int, input().split())
prices = list(map(int, input().split()))
prices.sort()

prices_arr = np.array(prices)
answer = prices_arr[0:k].sum()

print(answer)
Buggy python submission (verdict: Runtime Error):
import numpy as np

x, n = map(int, input().split())
if n == 0:
    print(x)
else:
    lists = list(map(int, input().split()))
    lists_arr = np.array(lists)

    max = lists_arr.max()
    min = lists_arr.min()
    number_lists = list(range(min, max+1, 1))
    existing = number_lists.copy()
    for i in lists:
        existing.remove(i)
    existing_arr = np.array(existing)
    if x > max or x < min:
        print(x)
    else:
        if x <= existing_arr.min():
            print(existing_arr.min())
        elif x >= existing_arr.max():
            print(existing_arr.max())

Fixed submission:
import numpy as np

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

all_num = list(range(0, 102, 1))
lists = [i for i in all_num if i not in num_lists]

lists_arr = np.array(lists)
diff_arr = lists_arr - x
abs_arr = np.abs(diff_arr)
index = np.where(abs_arr == abs_arr.min())
answer_list = lists_arr[index]
print(answer_list[0])

Buggy python submission (verdict: Runtime Error):
import numpy as np

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

lists_arr = np.array(lists)

max = lists_arr.max()
min = lists_arr.min()
number_lists = list(range(min, max+1, 1))
existing = number_lists.copy()
for i in lists:
    existing.remove(i)
existing_arr = np.array(existing)
if x > max or x < min:
    print(x)
else:
    if x <= existing_arr.min():
        print(existing_arr.min())
    elif x >= existing_arr.max():
        print(existing_arr.max())

Fixed submission:
import numpy as np

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

all_num = list(range(0, 102, 1))
lists = [i for i in all_num if i not in num_lists]

lists_arr = np.array(lists)
diff_arr = lists_arr - x
abs_arr = np.abs(diff_arr)
index = np.where(abs_arr == abs_arr.min())
answer_list = lists_arr[index]
print(answer_list[0])
Buggy python submission (verdict: Runtime Error):
import math
A, B, H, M = map(int, input().spli3t())
 
H_degree = (30 * H) + (0.5 * M)
M_degree = 6 * M
diff = abs(H_degree - M_degree)
if diff > 180:
  diff = 360 - diff
else:
  diff = diff
 
length = math.sqrt(A**2 + B**2 - 2*A*B*math.cos(math.radians(diff)))
 
print(length)

Fixed submission:
import math
A, B, H, M = map(int, input().split())
 
H_degree = (30 * H) + (0.5 * M)
M_degree = 6 * M
diff = abs(H_degree - M_degree)
if diff > 180:
  diff = 360 - diff
else:
  diff = diff
 
length = math.sqrt(A**2 + B**2 - 2*A*B*math.cos(math.radians(diff)))
 
print(length)

Buggy python submission (verdict: Runtime Error):
import math
A, B, H, M = map(int, input(), split())
 
H_degree = (30 * H) + (0.5 * M)
M_degree = 6 * M
diff = math.abs(H_degree - M_degree)
if diff > 180:
  diff = 360 - diff
else:
  diff = diff
 
length = math.sqrt(A**2 + B**2 - 2*A*B*math.cos(math.radians(diff)))
 
print(length)

Fixed submission:
import math
A, B, H, M = map(int, input().split())
 
H_degree = (30 * H) + (0.5 * M)
M_degree = 6 * M
diff = abs(H_degree - M_degree)
if diff > 180:
  diff = 360 - diff
else:
  diff = diff
 
length = math.sqrt(A**2 + B**2 - 2*A*B*math.cos(math.radians(diff)))
 
print(length)

Buggy python submission (verdict: Runtime Error):
import math
A, B, H, M = map(int, input(), split())

H_degree = (30 * H) + (0.5 * M)
M_degree = 6 * M
diff = H_degree - M_degree
if diff > 180:
  diff = 360 - diff
else:
  diff = diff

length = math.sqrt(A**2 + B**2 - 2*A*B*math.cos(math.radians(diff)))

print(length)

Fixed submission:
import math
A, B, H, M = map(int, input().split())
 
H_degree = (30 * H) + (0.5 * M)
M_degree = 6 * M
diff = abs(H_degree - M_degree)
if diff > 180:
  diff = 360 - diff
else:
  diff = diff
 
length = math.sqrt(A**2 + B**2 - 2*A*B*math.cos(math.radians(diff)))
 
print(length)
Buggy python submission (verdict: Runtime Error):
s, t = input().split()
 
if t.startswith(s):
  print('Yes')
else:
  print('No')

Fixed submission:
s = input()
t = input()
 
if t.startswith(s):
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
s, t = map(input().split())

if t.startswith(s):
  print('Yes')
else:
  print('No')

Fixed submission:
s = input()
t = input()
 
if t.startswith(s):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a, b, c, k = map(int, input().split())

if k =< a:
  print(1 * k)
elif a < k and k <= (a+b):
  print(a)
else:
  print(a - ((k -(a+b)) * -1))

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

if k <= a:
    print(1 * k)
elif a < k and k <= (a + b):
    print(a)
else:
    print(a - ((k - (a + b)) * 1))
Buggy python submission (verdict: Runtime Error):
import numpy as np

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

arr = np.array(lists)
days = arr.sum()

if days >= 0:
  print(int(n - days))
else:
  print('-1')

Fixed submission:
import numpy as np

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

arr = np.array(lists)
days = arr.sum()

if n - days >= 0:
    print(int(n - days))
else:
    print('-1')
Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

k = int(input())

def find_gcd(*numbers):
    return reduce(math.gcd, numbers)

ans = 0
for a in range(1, k+1, 1):
    for b in range(1, k+1, 1):
        for c in range(1, k+1, 1):
            gcd = find_gcd(a, b, c)
            ans += gcd

print(ans)

Fixed submission:
import math
from functools import reduce

k = int(input())

def find_gcd(*numbers):
    return reduce(math.gcd, numbers)

ans = 0
for a in range(1, k+1, 1):
    for b in range(1, k+1, 1):
        for c in range(1, k+1, 1):
            gcd = find_gcd(a, b, c)
            ans += gcd

print(ans)
Buggy python submission (verdict: Runtime Error):
import numpy as np

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

vote_arr = np.array(vote_lists)
total_vote = vote_arr.sum()
is_popular = total_vote / (4 * m)

answer_lists = []

for i in vote_lists:
  if i >= is_popular:
    answer_lists.append(i)

if len(answer_lists) >= m:
  print('Yes')
else:
  Print('No')

Fixed submission:
import numpy as np

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

vote_arr = np.array(vote_lists)
total_vote = vote_arr.sum()
is_popular = total_vote / (4 * m)

answer_lists = []

for i in vote_lists:
  if i >= is_popular:
    answer_lists.append(i)

if len(answer_lists) >= m:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s = input()

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

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