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

Fixed submission:
N = int(input())
if 0<N<10:
  num = N
 
if 10<=N<100:
  num = 9
 
if 100<=N<1000:
  num = 9 + N - 99
  
if 1000<=N<10000:
  num = 9 + 900
 
if 10000<=N<100000:
  num = 909 + N - 9999
 
if N==100000:
  num=909+90000
  
print(num)

Buggy submission (verdict: Runtime Error):
N = int(input())
if 0<N<10:
  num = N

if 10=<N<100:
  num = 9

if 100=<N<1000:
  num = 9 + N - 99
  
if 1000=<N<10000:
  num = 9 + 900

if 10000=<N<100000:
  num = 909 + N - 9999

if N==100000:
  num=909+90000
  
print(num)
Problem p03087 (python)

Fixed submission:
n, q = map(int, input().split())
s = input()
cnt_list = [0]*(n)
tmpi = 0
for i in range(1, n):
    if s[i-1] == "A":
        if s[i] == "C":
            cnt_list[i] = cnt_list[i-1] + 1
        else:
            cnt_list[i] = cnt_list[i-1]
    else:
        cnt_list[i] = cnt_list[i-1]

for i in range(q):
    l, r = map(int, input().split())
    print(cnt_list[r-1] - cnt_list[l-1])

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

for i in range(n):
    if s[i] == "A":
        if s[i+1] == "C":
            pos_list.append(i+1)

cnt = 0
for i in range(q):
    cnt = 0
    for pos in range(lr_list[i][0], lr_list[i][1]):
        if pos in pos_list:
            cnt += 1
    print(cnt)
Problem p03161 (python)

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

dp = [10**10]*(n)
dp[0] = 0
for i in range(0,n):
    if i+k<=n-1:
        for j in range(1,k+1):
            dp[i+j] = min(dp[i+j], dp[i]+abs(hL[i+j]-hL[i]))
    else:
        for j in range(1, n-i):
            dp[i+j] = min(dp[i+j], dp[i]+abs(hL[i+j]-hL[i]))

print(dp[n-1])

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
h = list(map(int, input().split()))
hL = [0]*(n**5)
for i in range(n):
    hL[i] = h[i]

dp = [10**10]*(n**5)
dp[0] = 0
for i in range(0,n):
    for j in range(1,k+1):
        dp[i+j] = min(dp[i+j], dp[i]+abs(hL[i+j]-hL[i]))

print(dp[n-1])
Problem p03262 (python)

Fixed submission:
import fractions

N, X = map(int, input().split())
x_list = list(map(int, input().split()))

if N == 1:
    if X < x_list[0]:
        x_list.insert(0, X)
    else:
        x_list.insert(1, X)
else:
    for i in range(N-1):
        if x_list[i] < X < x_list[i+1]:
            x_list.insert(i+1, X)
        else:
            x_list.append(X)

x_list.sort()

x_diff = [0]*N
for i in range(N):
    x_diff[i] = x_list[i+1] - x_list[i]

ans = x_diff[0]
for i in range(1, N):
    ans = fractions.gcd(ans, x_diff[i])
print(ans)

Buggy submission (verdict: Runtime Error):
import fractions

N, X = map(int, input().split())
x_list = list(map(int, input().split()))

if N == 1:
    if X < x_list[0]:
        x_list.insert(0, X)
    else:
        x_list.insert(1, X)
else:
    for i in range(N-1):
        if x_list[i] < X < x_list[i+1]:
            x_list.insert(i+1, X)

x_list.sort()

x_diff = [0]*N
for i in range(N):
    x_diff[i] = x_list[i+1] - x_list[i]

ans = x_diff[0]
for i in range(1, N):
    ans = fractions.gcd(ans, x_diff[i])
print(ans)
Problem p03361 (python)

Fixed submission:
h, w = map(int, input().split())
sL = [input() for i in range(h)]

ans = "Yes"

for y in range(h):
    for x in range(w):
        if sL[y][x] == ".":
            continue
        if y-1 < 0 or y+1 > h-1 or x-1 < 0 or x+1 > w-1:
            continue
        if sL[y+1][x] == sL[y-1][x]  == sL[y][x+1] == sL[y][x-1] == ".":
            ans = "No"
            break

print(ans)

Buggy submission (verdict: Runtime Error):
h, w = map(int, input().split())
sL = [input() for i in range(h)]

ans = "Yes"

for y in range(h):
    for x in range(w):
        if sL[y][x] == ".":
            continue
        for dx, dy in dxy:
            if y-1 < 0 or y+1 > h-1 or x-1 < 0 or x+1 > w-1:
                continue
            if sL[y+1][x] == sL[y-1][x]  == sL[y][x+1] == sL[y][x-1] == ".":
                ans = "No"
                break

print(ans)
Problem p03408 (python)

Fixed submission:
n = int(input())
sL = [input() for i in range(n)]
m = int(input())
tL = [input() for i in range(m)]
L = list(set(sL))
maxnum = 0
for i in range(len(L)):
    num = max(0, sL.count(L[i])-tL.count(L[i]))
    if num > maxnum:
        maxnum = num
print(maxnum)

Buggy submission (verdict: Runtime Error):
n = int(input())
sL = [input() for i in range(n)]
m = int(input())
tL = [input() for i in range(m)]
L = list(set(sL))
maxnum = 0
for i in range(len(L)):
    num = max(0, max(sL.count(L[i])-tL.count(L[i])))
    if num > maxnum:
        maxnum = num
print(maxnum)
Problem p03447 (python)

Fixed submission:
x = int(input())
a = int(input())
b = int(input())
print(x - a - b * ((x - a) // b))

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
X = int(input())
counter = 0

for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      x = 500*a + 100*b + 50*c
      if X == x:
        counter += 1

        
print(counter)
Problem p03457 (python)

Fixed submission:
N = int(input())
t = [0]*(N+1)
x = [0]*(N+1)
y = [0]*(N+1)
t[0] = 0
x[0] = 0
y[0] = 0
for n in range(N):
  n = n+1
  t[n], x[n], y[n] = map(int, input().split())

ans = "Yes"
for n in range(N):
    dt = t[n+1] - t[n]
    dist = abs(x[n+1] - x[n]) + abs(y[n+1] - y[n])
    if (dt < dist) or ((dt - dist) % 2 == 1):
        ans = "No"

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
t = [0]*N
x = [0]*N
y = [0]*N
t[0] = 0
x[0] = 0
y[0] = 0
for n in range(N+1):
    t[n+1], x[n+1], y[n+1] = map(int, input().split())

ans = "Yes"
for n in range(N):
    dt = t[n+1] - t[n]
    dist = abs(x[n+1] - x[n]) + abs(y[n+1] - y[n])
    if (dt < dist) or ((dt - dist) % 2 == 1):
        ans = "No"

print(ans)
Problem p03470 (python)

Fixed submission:
N = int(input())
dL = [0]*N
for n in range(N):
  dL[n] = int(input())
print(len(list(set(dL))))

Buggy submission (verdict: Runtime Error):
N = input()
dL = [0]*N
for n in range(N):
  dL[n] = int(input())
print(len(list(set(dL))))

Buggy submission (verdict: Runtime Error):
N = int(input())
dL = []

for n in ranege(N+1):
  dL.append(int(input()))

dL.sort()
counter = 0

for n in range(N+1):
  if dL[n] == dL[n+1]:
    pass
  else:
    counter += 1

if counter == 0:
  counter = 1

print(counter)
Problem p03476 (python)

Fixed submission:
def sieve_of_eratosthenes(N):
    prime_list = [True for _ in range(N + 1)]
    prime_list[0] = False
    prime_list[1] = False
    for p in range(2, int(N ** 0.5) + 1):
        if prime_list[p]:
            for i in range(2 * p, N + 1, p):
                prime_list[i] = False

    return prime_list


Q = int(input())
Max_ = 10**5
prime_list = sieve_of_eratosthenes(Max_)
count_list = [0]*(Max_+1)
count = 0
for i in range(Max_+1):
    if prime_list[i] and prime_list[(i + 1) // 2]:
        count += 1
    count_list[i] = count
for _ in range(Q):
    l, r = map(int, input().split())
    print(count_list[r] - count_list[l-1])

Buggy submission (verdict: Runtime Error):
def sieve_of_eratosthenes(N):
    prime_list = [True for _ in range(N + 1)]
    prime_list[0] = False
    prime_list[1] = False
    for p in range(2, int(N ** 0.5) + 1):
        if prime_list[p]:
            for i in range(2 * p, N + 1, p):
                prime_list[i] = False

    return prime_list


Q = int(input())
Max_ = 10**5
prime_list = sieve_of_eratosthenes(Max_)
prime_check_list = [0]*(Max_ + 1)
for i in range(1, Max_ + 1, 2):
    if prime_list[i] and prime_list[(i + 1) // 2]:
        a_list[i] = 1
for _ in range(Q):
    l, r = map(int, input().split())
    print(sum(a_list[l:r+1]))

Buggy submission (verdict: Runtime Error):
import math


def sieve_of_eratosthenes(N):
    sqrt_N = math.sqrt(N)
    prime_list = [True for _ in range(N + 1)]
    prime_list[0] = False
    prime_list[1] = False
    for p in range(2, int(sqrt_N) + 1):
        if prime_list[p]:
            for i in range(2 * p, N + 1, p):
                prime_list[i] = False

    return prime_list


Q = int(input())
Max_ = 10**5
prime_list = sieve_of_eratosthenes(Max_)
prime_check_list = [0]*(Max_ + 1)
for i in range(1, Max_ + 1, 2):
    if prime_list[i] and prime_list[(i + 1) // 2]:
        a_list[i] = 1
for _ in range(Q):
    l, r = map(int, input().split())
    print(sum(a_list[l:r+1]))
Problem p03493 (python)

Fixed submission:
sss = int(input())
a = int(sss/100)
b = int((sss-100*a)/10)
c = int((sss-100*a-10*b))
print(a+b+c)

Buggy submission (verdict: Runtime Error):
sss = input()
a = int(sss/100)
b = int((sss-100*a)/10)
c = int((sss-100*a-10*b))
print(a+b+c)
Problem p03576 (python)

Fixed submission:
N, K = map(int, input().split())
x_list = [0]*N
y_list = [0]*N
for i in range(N):
    x_list[i], y_list[i] = map(int, input().split())

x_element = sorted(set(x_list))
y_element = sorted(set(y_list))
ans = float("inf")

for i in range(len(x_element)):
    for j in range(len(y_element)):
        for k in range(i+1, len(x_element)):
            for l in range(j+1, len(y_element)):
                num = 0
                for m in range(N):
                    if x_element[i] <= x_list[m] <= x_element[k] and y_element[j] <= y_list[m] <= y_element[l]:
                        num += 1
                if num >= K:
                    ans = min((x_element[k] - x_element[i]) * (y_element[l] - y_element[j]), ans)

print(ans)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
x_list = [0]*n
y_list = [0]*n
for i in range(n):
    x_list[i], y_list[i] = map(int, input().split())

x_element = set(x_list)
y_element = set(y_list)
ans = float("inf")

for i in range(len(x_element)):
    for j in range(len(y_element)):
        for k in range(i+1, len(x_element)):
            for l in range(j+1, len(y_element)):
                num = 0
                for m in range(n):
                    x_left = x_element[i]
                    x_right = x_element[k]
                    y_bottom = y_element[j]
                    y_upper = y_element[l]
                    if x_left <= x_list[m] <= x_right and y_bottom <= y_list[m] <= y_upper:
                        num += 1
                    if num >= k:
                        ans = min((x_right - x_left) * (y_upper - y_bottom), ans)

print(ans)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
x_list = [0]*n
y_list = [0]*n
for i in range(n):
    x_list[i], y_list[i] = map(int, input().split())

x_element = set(x_list)
y_element = set(y_list)
ans = float("inf")

for i in range(len(x_element)):
    for j in range(len(y_element)):
        for k in range(i+1, len(x_element)):
            for l in range(j+1, len(y_element)):
                num = 0
                for m in range(n):
                    x_left = x_element[i]
                    x_right = x_element[k]
                    y_bottom = y_element[j]
                    y_upper = y_element[l]
                    if x_left <= x[m] <= x_right and y_bottom <= y[m] <= y_upper:
                        num += 1
                    if num >= k:
                        ans = min((x_right - x_left) * (y_upper - y_bottom), ans)

print(ans)
Problem p03796 (python)

Fixed submission:
import math
 
n = int(input())
inf = 10**9 + 7
s = math.factorial(n)
print(s%inf)

Buggy submission (verdict: Runtime Error):
import math

n = int(input())
print(math.factrial(n) % (10^9 + 7))
Problem p04044 (python)

Fixed submission:
n, l = map(int, input().split())
List = sorted([input() for i in range(n)])
print("".join(List))

Buggy submission (verdict: Runtime Error):
n, l = map(int, input().split())
List = sorted([input() for i in range(n])
print("".join(List))
Problem p02887 (python)

Fixed submission:
#!/usr/bin/env python3
import sys
import re


def solve(N: int, S: str):
    result = 0
    for s in set(S):
        regex = re.compile(s + "+")
        # print(regex.findall(S))
        result += len(regex.findall(S))
    print(result)

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    solve(N, S)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys
import re


def solve(N: int, S: str):
    result = 0
    for s in set(S):
        regex = re.compile(f"{s}+")
        # print(regex.findall(S))
        result += len(regex.findall(S))
    print(result)

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    solve(N, S)


if __name__ == "__main__":
    main()
Problem p02911 (python)

Fixed submission:
n, k, q = map(int, input().split())
q_list = [int(input()) for i in range(q)]

arr = [k - q] * n

for q_i in q_list:
    arr[q_i - 1] += 1

for go_or_not in arr:
    if go_or_not > 0:
        print("Yes")
    else:
        print("No")

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

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

arr = np.array([k] * n)

for i in range(q):
    q_i = int(input())
    arr = arr - 1
    arr[q_i - 1] += 1

arr_evaluate = arr > 0

for go_or_not in arr_evaluate:
    if go_or_not:
        print("Yes")
    else:
        print("No")
Problem p02921 (python)

Fixed submission:
#!/usr/bin/env python3
import sys


def solve(S: str, T: str):
    count = 0
    for i in range(len(S)):
        if S[i] == T[i]:
            count += 1
        else:
            pass
    print(count)

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(S, T)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys


def solve(N: int, H: "List[int]"):

    result = 0
    while len(H) >= 2:
        count = 0
        for i in range(len(H) - 1):
            if H[i] >= H[i + 1]:
                count += 1
            else:
                break
        result = max(result, count)

        H = H[count + 1 :]

    print(result)

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    H = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, H)


if __name__ == "__main__":
    main()
Problem p02765 (python)

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

if n >= 10:
  print(r)
else:
  print(r +  100 * (10 - n))

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

from math import factorial
ans = 0

if n % 2 == 1:
    for i in range(1, n // 2 + 1):
        ans += factorial(n) // factorial(i) // factorial(n - i)
    ans *= 2 + 1
else:
    for i in range(1, n // 2):
        ans += factorial(n) // factorial(i) // factorial(n - i)
    ans *= 2
    ans += factorial(n) // factorial(n // 2) // factorial(n - n // 2) + 1

ans -= factorial(n) // factorial(a) // factorial(n - a)
ans -= factorial(n) // factorial(b) // factorial(n - b)
print(ans)

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

if n >= 10:
  print(R)
else:
  print(r +  100 * (10 - n))
Problem p02774 (python)

Fixed submission:
import numpy as np

n, k = map(int, input().split())
num_list = [int(i) for i in input().split()]
num_list = np.array(num_list)
num_list.sort()

neg = num_list[num_list < 0]
pos = num_list[num_list > 0]
zero =  num_list[num_list == 0]

def count(x):
    ans = 0
    if x >= 0:
        ans += len(zero) * n
    ans += np.searchsorted(num_list, x // pos, side="right").sum()
    ans += n * len(neg) - np.searchsorted(num_list, -(-x // neg), side="left").sum()
    ans -= np.count_nonzero(num_list * num_list <= x)
    return ans // 2

left = -(10 ** 18)
right = 10 ** 18

while left + 1 < right:
    mid = (left + right) // 2
    if count(mid) >= k:
        right = mid
    else:
        left = mid

print(right)

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

ans_list = []

for i in range(n - 1):
    for j in range(i + 1, n):
        ans_list.append(num_list[i] * num_list[j])

ans_list.sort()

print(ans_list[k])
Problem p02898 (python)

Fixed submission:
n, k = map(int,input().split())
h =[int(_) for _ in input().split()]
 
res = 0
for i in range(n):
  if h[i] >= k:
    res += 1
print(res)

Buggy submission (verdict: Runtime Error):
n, K = map(int,input().split())
h =[int(_) for _ in input().split()]

res = 0
for i in range(n):
  if h[i] >= k:
    res += 1
print(res)
Problem p02973 (python)

Fixed submission:
import bisect

INF = 10000000000

n = int(input())
a = [0] * n

for i in range(n):
    a[i] = int(input())
    a[i] = - a[i]

dp = [INF] * n

for i in range(n):
    dp[bisect.bisect_right(dp,a[i])] = a[i]
    
print(bisect.bisect_left(dp,INF))

Buggy submission (verdict: Runtime Error):
import bisect

n = int(input())
a = []

for i in range(n):
    a.append(int(input()))

a.reverse()
cnt = 0
for i in range(1,n):
    if a[i] + cnt == c[i-1]:
        cnt += 1
    a[i] += cnt
        
INF = 10000000000
dp = [INF] * n

for i in range(n):
    t = bisect.bisect_left(dp,a[i])
    if t != n:
        dp[t] = a[i]

print(bisect.bisect_left(dp,INF))

Buggy submission (verdict: Runtime Error):
import bisect

n = int(input())
c = []

for i in range(n):
    c.append(int(input()))

c.reverse()

for i in range(1,n):
    if c[i] == c[i-1]:
        c[i] += 1
        
INF = 100000000
dp = [INF] * n

for i in range(n):
    dp[bisect.bisect_left(dp,c[i])] = c[i]

print(bisect.bisect_left(dp,INF))

Buggy submission (verdict: Runtime Error):
import bisect

n = int(input())
c = []

for i in range(n):
    c.append(int(input()))

INF = 100000000
dp = [INF] * n

for i in range(n):
    dp[bisect.bisect_left(dp,c[i])] = c[i]

print(n - bisect.bisect_left(dp,INF)+1)
Problem p02983 (python)

Fixed submission:
l,r = map(int,input().split())

if r -l >= 2019:
    print(0)
else:
    res = 2018
    for i in range(l,r+1):
        for j in range(i+1,r+1):
            res = min(res,(i*j)%2019)
    print(res)

Buggy submission (verdict: Runtime Error):
l,r = map(int,input().split())

if r -l >= 2019:
    print(0)
else:
    res = 2018
    for i in range(l,r+1):
        for j in range(1,r+1):
            if i<j:
                res = min(res,(i*j)%2019)
print(res)
Problem p03061 (python)

Fixed submission:
import fractions as f

n = int(input())
A = [int(_) for _ in input().split()]

left = []
right = []

left.append(A[0])
for i in range(1,n):
    left.append(f.gcd(left[i-1],A[i]))

right.append(A[n-1])
for i in range(1,n):
    right.append(f.gcd(right[i-1],A[n-1-i]))

ans = 0
for i in range(n):
    if i == 0:
        ans = right[n-2]
    if i >= 1 and i <= n-2:
        ans = max(ans,f.gcd(left[i-1],right[n-2-i]))
    if i == n-1:
        ans = max(ans,left[n-2])
print(ans)

Buggy submission (verdict: Runtime Error):
import math
N = int(input())
A = [int(j) for j in input().split()]
gcdmx = 0
for j in range(0,N):
    gcdloc = 0
    C = A[:]
    del C[j]
    for k in range(0,N-1):
        gcdloc = math.gcd(gcdloc,C[k])
    gcdmx = max(gcdloc,gcdmx)
print(gcdmx)

Buggy submission (verdict: Runtime Error):
import math
N = int(input())
A = [int(j) for j in input().split()]
B = [0]*N
B = A[:]
gcdmx = 0
for j in range(0,N):
    gcdloc = 0
    C = B[:]
    del C[j]
    for k in range(0,N-1):
        gcdloc = math.gcd(gcdloc,C[k])
    gcdmx = max(gcdloc,gcdmx)
print(gcdmx)

Buggy submission (verdict: Runtime Error):
import math
N = int(input())
A = [int(j) for j in input().split()]
B = [0]*N
B = A[:]
gcdmx = 0
D = 1
for j in range(0,N):
    D = D * B[j]
for j in range(0,N):
    gcdloc = D
    C = B[:]
    del C[j]
    for k in range(0,N-1):
        gcdloc = math.gcd(gcdloc,C[k])
    gcdmx = max(gcdloc,gcdmx)
print(gcdmx)

Buggy submission (verdict: Runtime Error):
import math
N = int(input())
A = [int(j) for j in input().split()]
B = [0]*N
B = A[:]
D = 1
gcdmx = 0
for k in range(0,N):
        D = D * B[k]
for j in range(0,N):
    C = B[:]
    C[j] = D
    gcdloc = D
    for k in range(0,N):
        gcdloc = math.gcd(gcdloc,C[k])
    gcdmx = max(gcdloc,gcdmx)
print(gcdmx)
Problem p03085 (python)

Fixed submission:
x = input()
if x == 'A':
	print('T')
elif x == 'T':
	print('A')
elif x == 'C':
	print('G')
else:
	print('C')

Buggy submission (verdict: Runtime Error):
x = input()
if x == 'A':
	print('T')
elif x == 'T':
	print('A')
elif X == 'C':
	print('G')
else:
	print('C')
Problem p03101 (python)

Fixed submission:
H,W = (int(j) for j in input().split())
h,w = (int(j) for j in input().split())
print(H*W-(h*W + H*w - h*w))

Buggy submission (verdict: Runtime Error):
import numpy as np
N,M,C = (int(j) for j in input().split())
B = [int(j) for j in input().split()]
list = [[0]* M]*N
for j in range(0,N):
        list[j] = [int(k) for k in input().split()]
count = 0
for j in range(0,N):
    if np.sum(np.array(list[j]) * np.array(B)) + C > 0:
        count = count + 1
print(count)
Problem p03102 (python)

Fixed submission:
import numpy as np
N,M,C = (int(j) for j in input().split())
B = [int(j) for j in input().split()]
list = [[0]* M]*N
for j in range(0,N):
        list[j] = [int(k) for k in input().split()]
count = 0
for j in range(0,N):
    if np.sum(np.array(list[j]) * np.array(B)) + C > 0:
        count = count + 1
print(count)

Buggy submission (verdict: Runtime Error):
import numpy as np
N,M,C = (int(j) for j in input().split())
B = [int(j) for j in input().split()]
list = [[0]* M]*N
for j in range(0,N):
        list[j] = [int(k) for k in input().split()]
count = 0
for j in range(0,N):
    if np.sum(np.array(list[j]) * np.array(B)) C >0:
        count = count + 1
print(count)
Problem p03110 (python)

Fixed submission:
import numpy as np
n = int(input())
x = [0] * n
u = ['string'] * n
for j in range(n):
    x[j], u[j] = input().split()
for j in range(n):
    if u[j] == 'JPY':
        x[j] = int(x[j])
    elif u[j] == 'BTC':
        x[j] = float(x[j]) * 380000
print(np.sum(x))

Buggy submission (verdict: Runtime Error):
import numpy as np
n = int(input())
x = [0] * n
u = ['string'] * n
for j in range(n):
    x[j], u[j] = input().split()
for j in range(n):
    if u[j] == 'JPY':
        x[j] = 1
    elif u[j] == 'BIT':
        x[j] = float(x[j]) * 38
print(np.sum(x) * 10000)
Problem p03206 (python)

Fixed submission:
D = int(input())
if D ==25:
  print('Christmas')
elif D ==24:
  print('Christmas Eve')
elif D == 23:
  print('Christmas Eve Eve')
else:
  print('Christmas Eve Eve Eve')

Buggy submission (verdict: Runtime Error):
D = int(imput())
if D = 25:
  print('Christmas')
elif D =24:
  print('Christmas Eve')
elif D = 23:
  print('Christmas Eve Eve')
else:
  print('Christmas Eve Eve Eve')