Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a = int(input())
b,c = map(int,input().split())
lis = input().split()

li = [int(l) for l in lis]

judge = True

d = 0

li.sort()

while judge:
    
    s = []
    s.append(min(li))
    li.remove(min(li))

    for n in li:
        if n >= b+1 and n<=c:
            s.append(n)
            li.remove(n)
            break
        else:judge = False

    for n in li:
        if n>=c+1:
            s.append(n)
            li.remove(n)
            break
        else:
            judge= False

    if len(s) == 3:
        d+=1
        judge = True
    else:judge=False

print(d)

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

li = [int(l) for l in lis]

judge = True

d = 0

li.sort()

while judge:
    if li == []:
        break
    
    s = []
    for n in li:
        if n <= b:
            s.append(n)
            li.remove(n)
            break
        else:judge = False

    for n in li:
        if n >= b+1 and n<=c:
            s.append(n)
            li.remove(n)
            break
        else:judge = False

    for n in li:
        if n>=c+1:
            s.append(n)
            li.remove(n)
            break
        else:
            judge= False

    if len(s) == 3:
        d+=1
        judge = True
    else:judge=False

print(d)
Buggy python submission (verdict: Runtime Error):
n = int(input())
t,a = map(int,input().split())
lis = list(map(int,input().split()))
 
li = abs((t-lis[0]*0.006)-a)
l = 0
for i in range(1,n):
    if abs((t-lis[i]*0.006)-a) < li:
        li=abs((t-lis[i]*0.006)-a)
        l=i
print(l+1)

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

Buggy python submission (verdict: Runtime Error):
n=int(input())
t,a=map(int,input().split())
lis=list(map(int,input().split()))
li=abs((t-lis[0]*0.006)-a)
l=0
for i in range(1,n):
    if abs((t-lis[i]*0.006)-a) < li:
        li=abs((t-lis[i]*0.006)-a)
        l=i
print(l+1)

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

Buggy python submission (verdict: Runtime Error):
n=int(input())
t,a=map(int,input().split())
lis=list(map(int,input().split()))
li=abs((t-lis[0]*0.006)-a)
l=0
for i in range(1,n):
    if abs((t-lis[i]*0.006)-a) < li:
        li=abs((t-lis[i]*0.006)-a)
        l=i
print(l+1)

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

Buggy python submission (verdict: Runtime Error):
n=int(input())
t,a=map(int,input().split())
lis=list(map(int,input().split()))
li=abs((t-lis[0]*0.006)-a)
l=0
for i in range(1,n):
    if abs((t-lis[i]*0.006)-a) < li:
        li=abs((t-lis[i]*0.006)-a)
        l=i
print(l+1)

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

Buggy python submission (verdict: Runtime Error):
n=int(input())
t,a=map(int,input().split())
lis=list(map(int,input().split()))
li,l=abs((t-lis[0]*0.006)-a),0
for i in range(1,n):
    b = abs((t-lis[i]*0.006)-a)
    if b < li:
        li=b
        l=i
print(l+1)

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

Buggy python submission (verdict: Runtime Error):
n=int(input());t,a=map(int,input().split())
lis=list(map(int,input().split()))
li,l=abs((t-lis[0]*0.006)-a),0
for i in range(1,n):
    b = abs((t-lis[i]*0.006)-a)
    if b < li:
        li=b
        l=i
print(l+1)

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

Buggy python submission (verdict: Runtime Error):
n=int(input());t,a=map(int,input().split())
lis=list(map(int,input().split()));li,l=abs((t-lis[0]*0.006)-a),0
for i in range(1,n):if abs((t-lis[i]*0.006)-a) < li:li,l=abs((t-lis[i]*0.006)-a),i
print(l+1)

Fixed submission:
a,b = map(int,input().split())
print(a+int(b/2))
Buggy python submission (verdict: Runtime Error):
n=int(input());t,a=map(int,input().split())
lis=list(map(int,input().split()));li,l=abs((t-lis[0]*0.006)-a),0
for i in range(1,n):if abs((t-lis[i]*0.006)-a) < li:li,l=abs((t-lis[i]*0.006)-a),i
print(l+1)

Fixed submission:
n = int(input())
t,a = map(int,input().split())
lis = list(map(int,input().split()))

li = abs((t-lis[0]*0.006)-a)
l = 0
for i in range(1,n):
    if abs((t-lis[i]*0.006)-a) < li:
        li=abs((t-lis[i]*0.006)-a)
        l=i
print(l+1)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split());lis=[a,b]
for i in range(c):
    if lis[i%2]%2==1:lis[i%2]-=1
    lis[(i+1)%2]+=lis[i%2]/2;lis[i%2]/=2
print(int(lis[0]),int(lis[1]))

Fixed submission:
a = input();print("".join(reversed(a)) if len(a) == 3 else a)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

if a > 8 or b > 8:
    print(":(")



else:
    print("Yay!")

Fixed submission:
num = input()

num = num.split(" ")

for i in range(len(num)-1):
    if int(num[i]) <= 8 and int(num[i+1]) <= 8:
        print("Yay!")

    else:
        print(":(")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

if a > 8:
    print(":(")

elif b > 8:
    print(":(")

else:
    print("Yay!")

Fixed submission:
num = input()

num = num.split(" ")

for i in range(len(num)-1):
    if int(num[i]) <= 8 and int(num[i+1]) <= 8:
        print("Yay!")

    else:
        print(":(")
Buggy python submission (verdict: Runtime Error):
s,t = map(int,input().split());print(max( for i in range(3))

Fixed submission:
number = input()
lis = number.split()


for num in range(len(lis)-1):
    add = int(lis[num]) + int(lis[num+1])
    pull = int(lis[num]) - int(lis[num+1])
    product = int(lis[num]) * int(lis[num+1])


mostbig = max([add,pull,product])
print(mostbig)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split( ))
k = int(input())


lis = [A,B,C]
max_num = max(A,B,C)

lis.remove(max_num)

rui = 2 ** k

nibai = max_num * rui


a = lis[0]
b = lis[1]
print(a + b + nibai)


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

if a < b:
    print(a)

elif a > b:
    a = a - 1
    print(a)

elif a == b:
    print(a)

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


lis = [A,B,C]
max_num = max(A,B,C)

lis.remove(max_num)

rui = 2 ** k

nibai = max_num * rui


a = lis[0]
b = lis[1]
print(a + b + nibai)



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

if a < b:
    print(a)

elif a > b:
    a = a - 1
    print(a)

elif a == b:
    print(a)

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

lis = [A,B,C]
max_num = max(A,B,C)

lis.remove(max_num)

nibai = max_num * 2

nibai = nibai*k

a = lis[0]
b = lis[1]
print(a + b + nibai)



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

if a < b:
    print(a)

elif a > b:
    a = a - 1
    print(a)

elif a == b:
    print(a)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

if a < b:
    print(a,"日")

elif a > b:
    a = a - 1
    print(a,"日")

elif a == b:
    print(a,"日")


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

if a < b:
    print(a)

elif a > b:
    a = a - 1
    print(a)

elif a == b:
    print(a)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
j = 0
if a == b:
    print("高橋は",a,"日")



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

if a < b:
    print(a)

elif a > b:
    a = a - 1
    print(a)

elif a == b:
    print(a)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

seki = a*b

if seki % 2 == 0:
    print("Even")

elif seki % 2 ==1:
    print("Odd")


Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

seki = a*b

if seki % 2 == 0:
    print("Even")

elif seki % 2 ==1:
    print("Odd")


Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
seki = a*b

if seki % 2 == 0:
    print("Even")

elif seki % 2 == 1:
  	print("Odd")

Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b = map(int(input()))

seki = a*b

if seki % 2 == 0:
    print("Even")

elif seki % 2 == 1:
  	print("Odd")

Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b = int(input())

seki = a*b

if seki % 2 == 0:
    print("Even")

elif seki % 2 == 1:
  	print("Odd")

Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
print((a+b))//2 if (a+b) % 2 == 0 else (a+b)//2+1))

Fixed submission:
num,numsecond = map(int,input().split())
number = num + numsecond
answer = number // 2
if number / 2 - number //2 > 0:
    answer += 1

print(answer)
Buggy python submission (verdict: Runtime Error):
a=input()
print("Yes"if int(a)%sum([int(a[i]) for i in range(len(a))])==0 else "No")


Fixed submission:
money,time,allmoney = map(int,input().split())
product = money * time
print(product if product < allmoney else allmoney)
Buggy python submission (verdict: Runtime Error):
a= input()
print("Yes" if int(a) % (int(a[0])+int(a[1])) == 0 else "No")

Fixed submission:
a= input()
print("Yes" if int(a) % sum([int(a[i]) for i in range(len(a))]) == 0 else "No")
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
print((a-1)*(b-1) if (a-1)*(b-1) >= 4)

Fixed submission:
numone,numtwo = map(int,input().split())
answer = (numone -1) * (numtwo -1)
print(answer)

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input())
print((a-1)*(b-1) if (a-1)*(b-1) >= 4 else 0)

Fixed submission:
numone,numtwo = map(int,input().split())
answer = (numone -1) * (numtwo -1)
print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
a=int(input())
b = 1
for i in range(1,a+1):
    b *= i
print(b%1000000007)

Fixed submission:
from math import factorial
print(factorial(int(input()))%(10**9+7))
Buggy python submission (verdict: Runtime Error):
a,b = int(input()),input()
j,l=0,[0]
for i in b:
	if i == "I":
		j+=1
	else:
		j-=1
	l.append(j)
print(max(l))

Fixed submission:
a,b,c,d = map(int,input().split())
print(a*b if a*b > c*d else c*d)

Buggy python submission (verdict: Runtime Error):
a,b = int(input()),input()
j,l=0,[0]
for i in b:
	if i == "I":j+=1
	else:j-=1
	l.append(j)
print(max(l))

Fixed submission:
a,b,c,d = map(int,input().split())
print(a*b if a*b > c*d else c*d)
Buggy python submission (verdict: Runtime Error):
a = input()
b = a.replace("ST","")
if a[0] =="S" and b[-1] =="T":
    print(0)
while "ST" in b:
    b = b.replace("ST","")
print(len(b))

Fixed submission:
a = input()
s,t = 0,0
for i in a:
    if i == "S":
        s += 1
    else:
        if s==0:
            t += 1
        else:
            s -=1
print(s+t)

Buggy python submission (verdict: Time Limit Exceeded):
a = input()
b = a.replace("ST","")
while "ST" in b:
    b = b.replace("ST","")
print(len(b))

Fixed submission:
a = input()
s,t = 0,0
for i in a:
    if i == "S":
        s += 1
    else:
        if s==0:
            t += 1
        else:
            s -=1
print(s+t)
Buggy python submission (verdict: Runtime Error):
upperbase,bottom,high = map(int,input().split())
print((upperbase + bottom) * high /　2)

Fixed submission:
lis = [int(input()) for i in range(3)]
print((lis[0]+lis[1]) * lis[2] // 2)

Buggy python submission (verdict: Runtime Error):
upperbase,bottom,high = map(int,input().split())
print((upperbase + bottom) * high /　2)

Fixed submission:
lis = [int(input()) for i in range(3)]
print((lis[0]+lis[1]) * lis[2] // 2)

Buggy python submission (verdict: Runtime Error):
upperbase,bottom,high = map(int,input().split())
print((upperbase + bottom) * high // 2)

Fixed submission:
lis = [int(input()) for i in range(3)]
print((lis[0]+lis[1]) * lis[2] // 2)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
if A > 0 and B > 0:
    print("Positive")
elif A <= 0 <= B:
    pritn("Zero")
else:
    print("Positive" if (A-B)%2== 0 else "Negative")

Fixed submission:
A, B = map(int, input().split())
if A > 0:
    print("Positive")
elif A <= 0 <= B:
    print("Zero")
else:
    print("Positive" if (B-A+1)%2== 0 else "Negative")
Buggy python submission (verdict: Runtime Error):
lengh,num = map(int,input().split())
lis = [input() for i in range(num)]
print("".join(sorted(lis)))

Fixed submission:
num,lengh = map(int,input().split())
lis = [input() for i in range(num)]
print("".join(sorted(lis)))
Buggy python submission (verdict: Runtime Error):
from statistics import mode
N = int(input())
a = list(map(int, input().split()))
for i in range(N):
    a[i] = a[i] - (i + 1)
if len(a) == len(set(a)):
    b = 0
else:
    b = mode(a)
for i in range(N):
    a[i] = abs(a[i] - b)
print(sum(a))


Fixed submission:
from statistics import median
N = int(input())
a = list(map(int, input().split()))
for i in range(N):
    a[i] = a[i] - (i + 1)
b = int(median(a))
for i in range(N):
    a[i] = abs(a[i] - b)
print(sum(a))
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = list(input())

reS = S[::-1]

wSum = [0 for i in range(N)]
eSum = [0 for i in range(N)]

for i in range(N):
    if i == 0:
        if S[i] == 'W':
            wSum[i] = 1
        if reS[i] == 'E':
            eSum[i] = 1
    else:
        if S[i] == 'W':
            wSum[i] = wSum[i-1] + 1
        else:
            wSum[i] = wSum[i-1]
        if reS[i] == 'E':
            eSum[i] = eSum[i-1] + 1
        else:
            eSum[i] = eSum[i-1]

eSum = eSum[::-1]

cost = eSum[1]

for i in range(1,N):
    if i == N - 1:
        if cost > wSum[N-2]:
            cost = wSum[N-2]
    else:
        if cost > wSum[i-1] + eSum[i+1]:
            cost = wSum[i-1] + eSum[i+1]
print(cost)


Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

Buggy python submission (verdict: Runtime Error):
n=int(input());s=input();print(max(len(set(s[:i])&set(s[i:]))for i in range(n)))

Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

Buggy python submission (verdict: Runtime Error):
n=int(input());s=input();print(max(len(set(s[:i])&set(s[i:]))for i in range(n)))


Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

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

x = 0

for i in range(len(s)):
  a = s[0:i]
  b = s[i:]
  
  x = max(x, len(set(a) & set(b)))

print(x)


Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

Buggy python submission (verdict: Runtime Error):
input()
s = input()
x = 0
for i in range(len(s)):
    a = s[:i]
    b = s[i:]
    x = max(x, len(set(a) & set(b)))

print(x)

Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
x = 0
for i in range(n):
    a = s[0:i]
    b = s[i:]
    x = max(x, len(set(a) & set(b)))

print(x)

Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = list(input())
x = 0
for i in range(n):
    a = s[0:i]
    b = s[i:]
    x = max(x, len(set(a) & set(b)))

print(x)

Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = list(input())
x = 0
for i in range(n):
    a = s[:i]
    b = s[i:]
    x = max(x, len(set(a) & set(b)))

print(x)

Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = list(input())
x = 0
for i in range(n):
    a = s[:i]
    b = s[i:]
    temp_set = set(a) & set(b)
    x = max(x, len(temp_set))

print(x)

Fixed submission:
a, b = map(int, input().split())
calcs = [a + b, a - b, a * b]
print(max(calcs))
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
K = int(input())
sub = set(S)
for step in range(2, len(S) + 1):
    for i in range(0, len(S) - step + 1):
        sub.add(S[i:i+step])
print(sorted(sub)[K - 1])


Fixed submission:
S = input()
K = int(input())
sub = set(S)
for step in range(2, 6):
    for i in range(0, len(S) - step + 1):
        sub.add(S[i:i+step])
print(sorted(sub)[K - 1])

Buggy python submission (verdict: Time Limit Exceeded):
S = list(input())
K = int(input())
sub = set(S)
for step in range(2, len(S) + 1):
    for i in range(0, len(S) - step + 1):
        st = ''
        for s in S[i:i + step]:
            st += s
        sub.add(st)
substring = list(sub)
substring.sort()
print(substring[K - 1])


Fixed submission:
S = input()
K = int(input())
sub = set(S)
for step in range(2, 6):
    for i in range(0, len(S) - step + 1):
        sub.add(S[i:i+step])
print(sorted(sub)[K - 1])
Buggy python submission (verdict: Runtime Error):
ABC = list(map(int,input().split()))
K = int(input())
print(max(ABC) * 2**K + sum(ABC) - max(ABC))

Fixed submission:
m,d = map(int, input().split())
if (m <= d):
    print(m)
else:
    print(m-1)
Buggy python submission (verdict: Time Limit Exceeded):
class DFS:
    def __init__(self, N):
        self.N = N
        self.visited = []
        self.depth = [0 for i in range(N)]
        self.edge = [[] for i in range(N)]
        self.graph = [[False for i in range(N)] for j in range(N)]

    def dfs2(self, v, p, d):
        self.depth[v] = d
        for e in self.edge[v]:
            if (e[0] == p):
                continue
            self.dfs2(e[0], v, d+e[1])

N = int(input())
dfs = DFS(N)
for i in range(N-1):
    a,b,c = map(int, input().split())
    dfs.edge[a-1].append((b-1,c))
    dfs.edge[b-1].append((a-1,c))

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


Fixed submission:
n = int(input())
 
graph = [[] for x in range(n)]
 
for i in range(n - 1):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    graph[a].append((b, c))
    graph[b].append((a, c))
 
q, k = map(int, input().split())
k -= 1
 
costs = [0 for x in range(n)]
que = []
que.append((k, 0))
while que:
    now, cost = que.pop()
    costs[now] = cost
    for node in graph[now]:
        if graph[node[0]] is not None:
            que.append((node[0], cost + node[1]))
    graph[now] = None
 
result = ""
for i in range(q):
    x, y = map(int, input().split())
    result += str(costs[x - 1] + costs[y - 1])
    result += "\n"
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
li = list(map(int, input().split()))
li.sort()


S = 1
for i in range(N-1):
    S = S*( li[i+1] - li[i] )

if S == 0:
    print('NO')
else:
    print('YES')

Fixed submission:
N = int(input())
li = list(map(int, input().split()))
li.sort()


S = 1
for i in range(N-1):
    if  li[i+1] == li[i]:
        S = S*0
    else:
        S = S
if S == 0:
    print('NO')
else:
    print('YES')

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
li = list(map(int, input().split()))
li.sort()


S = 1
for i in range(N-1):
    S = S*( li[i+1] - li[i] )

if S == 0:
    print('NO')
else:
    print('YES')

Fixed submission:
N = int(input())
li = list(map(int, input().split()))
li.sort()


S = 1
for i in range(N-1):
    if  li[i+1] == li[i]:
        S = S*0
    else:
        S = S
if S == 0:
    print('NO')
else:
    print('YES')

Buggy python submission (verdict: Time Limit Exceeded):
#入力
N = int(input())
li = list(map(int,input().split()))

S = 0
for i in range(N):
    S = S + li.index(li[i])

if S == N*(N-1)/2:
    print('YES')
else:
    print('NO')

Fixed submission:
N = int(input())
li = list(map(int, input().split()))
li.sort()


S = 1
for i in range(N-1):
    if  li[i+1] == li[i]:
        S = S*0
    else:
        S = S
if S == 0:
    print('NO')
else:
    print('YES')

Buggy python submission (verdict: Time Limit Exceeded):
#入力
N = int(input())
li = list(map(int,input().split()))

S = 0
for i in range(N):
    for j in range(N):
        if li[i] == li[j]:
            S = S + 1
        else:
            S = S

if S == N:
    print('YES')
else:
    print('NO')

Fixed submission:
N = int(input())
li = list(map(int, input().split()))
li.sort()


S = 1
for i in range(N-1):
    if  li[i+1] == li[i]:
        S = S*0
    else:
        S = S
if S == 0:
    print('NO')
else:
    print('YES')
Buggy python submission (verdict: Runtime Error):
import numpy as np
#入力
N, K = map(int, input().split())
li = list(map(int,input().split()))
list.sort(li, reverse = True)

#出力
a = list(np.zeros(K))
b = list(np.ones(N-K))
a.extend(b)

print(np.dot(a, li))

Fixed submission:
#入力
H, A = map(int, input().split())

#出力
s = 1
counter = 1
while counter>0:
    if H - A >0:
        H = H - A
        s = s + 1
        counter = counter
    else:
        H = H - A
        s = s
        counter = counter - 1
        print(s)

Buggy python submission (verdict: Runtime Error):
import numpy as np
#入力
N, K = map(int, input().split())
li = list(map(int,input().split()))
list.sort(li, reverse = True)

#出力
a = list(np.zeros(K))
b = list(np.ones(N-K))
a.extend(b)

print(np.dot(a, li))

Fixed submission:
#入力
H, A = map(int, input().split())

#出力
s = 1
counter = 1
while counter>0:
    if H - A >0:
        H = H - A
        s = s + 1
        counter = counter
    else:
        H = H - A
        s = s
        counter = counter - 1
        print(s)
Buggy python submission (verdict: Runtime Error):
#入力
N, K = map(int, input().split())
li = list(map(int,input().split()))
list.sort(li, reverse = True)

#出力
for i in range(K):
    li[i] = 0

print(sum(li))

Fixed submission:
import numpy as np
#入力
N, K = map(int, input().split())
li = list(map(int,input().split()))
list.sort(li, reverse = True)

#出力
a = list(np.zeros(K))
if N - K>=0:
    b = list(np.ones(N-K))
    a.extend(b)
else:
    a = list(np.zeros(N))

print(int(np.dot(a, li)))
Buggy python submission (verdict: Runtime Error):
s = int(input())

print(chr(ord('s')+1))

Fixed submission:
C = str(input())

print(chr(ord(C)+1))