Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int, input().split()))
b = 1

for i in range(N):
  b *= a[i]
  if b==0:
    break

if b>10**(18):
  print('-1')
else:
  print(b)

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

if 0 in a:
  print(0)
  exit()

for i in range(N):
  b *= a[i]
  if b>10**(18):
    print('-1')
    exit()

print(b)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int, input().split()))
b = 1

for i in range(N):
  b *= a[i]

if b>10**(18):
  print('-1')
else:
  print(b)

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

if 0 in a:
  print(0)
  exit()

for i in range(N):
  b *= a[i]
  if b>10**(18):
    print('-1')
    exit()

print(b)
Buggy python submission (verdict: Runtime Error):
K = int(input())
S = input()

if len(N)<=K:
  print(S)
else:
  print(S[:K]+'...')

Fixed submission:
K = int(input())
S = input()

if len(S)<=K:
  print(S)
else:
  print(S[:K]+'...')
Buggy python submission (verdict: Runtime Error):
import numpy as np
import pandas as pd
import matplotlib.pyplot as plt
import plotly.express as px
import statsmodels.api as sm


x = int(input())
# h_list = list(map(int, input().split()))

if x == 0:
    print(1)
else:
    print(0)


Fixed submission:
x = int(input())
# h_list = list(map(int, input().split()))

if x == 0:
    print(1)
else:
    print(0)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list_A = list(map(int, input().split()))

if 0 in list_A:
    print(0)
    exit()

result = 1
for a in list_A:
    result *= a

if result > 1e18:
    print(-1)
else:
    print(result)

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

if 0 in list_A:
    print(0)
    exit()

result = 1
for a in list_A:
    result *= a
    if result > 1e18:
        print(-1)
        exit()

print(result)

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce

# A, B = tuple(map(int, input().split()))
N = int(input())
list_A = list(map(int, input().split()))
threshold = 10 ** 18

if 0 in list_A:
    print(0)
    exit()
if max(list_A) > threshold:
    print(-1)
    exit()

result = reduce(mul, list_A)

if result > threshold:
    print(-1)
else:
    print(result)


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

if 0 in list_A:
    print(0)
    exit()

result = 1
for a in list_A:
    result *= a
    if result > 1e18:
        print(-1)
        exit()

print(result)

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce

# A, B = tuple(map(int, input().split()))
N = int(input())
list_A = list(map(int, input().split()))

result = reduce(mul, list_A)
threshold = 10 ** 18

if result > threshold:
    print(-1)
else:
    print(result)


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

if 0 in list_A:
    print(0)
    exit()

result = 1
for a in list_A:
    result *= a
    if result > 1e18:
        print(-1)
        exit()

print(result)

Buggy python submission (verdict: Time Limit Exceeded):
# A, B = tuple(map(int, input().split()))
N = int(input())
list_A = list(map(int, input().split()))
result = 1
for a in list_A:
    result = result * a
threshold = 10 ** 18

if result > threshold:
    print(-1)
else:
    print(result)


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

if 0 in list_A:
    print(0)
    exit()

result = 1
for a in list_A:
    result *= a
    if result > 1e18:
        print(-1)
        exit()

print(result)

Buggy python submission (verdict: Time Limit Exceeded):
# A, B = tuple(map(int, input().split()))
N = int(input())
list_A = list(map(int, input().split()))
result = 1
for a in list_A:
    result = result * a
threshold = 10 ** 18

if result > threshold:
    print(-1)
else:
    print(result)


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

if 0 in list_A:
    print(0)
    exit()

result = 1
for a in list_A:
    result *= a
    if result > 1e18:
        print(-1)
        exit()

print(result)
Buggy python submission (verdict: Runtime Error):
import itertools

N, M, Q = map(int, input().split())

int_tuple_list = list()
for i in range(Q):
    int_tuple_list.append(tuple(map(int, input().split())))

m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.combinations(m_list, N):
    # print(sequence)
    score_tmp = 0
    for ai, bi, ci, di in int_tuple_list:
        if ci == sequence[bi - 1] - sequence[ai - 1]:
            score_tmp += di

    # print(score_tmp)
    score_list.append(score_tmp)

print(max(score_list))



Fixed submission:
import itertools
 
N, M, Q = map(int, input().split())
 
int_tuple_list = list()
for i in range(Q):
    int_tuple_list.append(tuple(map(int, input().split())))
 
m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.combinations_with_replacement(m_list, N):
    # print(sequence)
    score_tmp = 0
    for ai, bi, ci, di in int_tuple_list:
        if ci == sequence[bi - 1] - sequence[ai - 1]:
            score_tmp += di
 
    # print(score_tmp)
    score_list.append(score_tmp)
 
print(max(score_list))

Buggy python submission (verdict: Runtime Error):
import itertools

N, M, Q = map(int, input().split())

int_tuple_list = list()
for i in range(Q):
    int_tuple_list.append(tuple(map(int, input().split())))

m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.permutations(m_list, N):
    # print(sequence)
    score_tmp = 0
    for ai, bi, ci, di in int_tuple_list:
        if ci == sequence[bi - 1] - sequence[ai - 1]:
            score_tmp += di

    # print(score_tmp)
    score_list.append(score_tmp)

print(max(score_list))


Fixed submission:
import itertools
 
N, M, Q = map(int, input().split())
 
int_tuple_list = list()
for i in range(Q):
    int_tuple_list.append(tuple(map(int, input().split())))
 
m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.combinations_with_replacement(m_list, N):
    # print(sequence)
    score_tmp = 0
    for ai, bi, ci, di in int_tuple_list:
        if ci == sequence[bi - 1] - sequence[ai - 1]:
            score_tmp += di
 
    # print(score_tmp)
    score_list.append(score_tmp)
 
print(max(score_list))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a_list = list(map(int, input().split()))
result_list = [0] * N

for i in range(N):
    for a in a_list:
        if i == a:
            result_list[i-1] += 1

# 最後の改行を削除
result_list_str = [str(i) for i in result_list]
print('\n'.join(result_list_str))


Fixed submission:
N = int(input())
a_list = list(map(int, input().split()))
result_list = [0] * N

for a in a_list:
    result_list[a-1] += 1

result_list_str = [str(i) for i in result_list]
print('\n'.join(result_list_str))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a_list = list(map(int, input().split()))
result_str = ''

for i in range(1, N+1):
    result_str += str(a_list.count(i)) + '\n'

# 最後の改行を削除
result_str = result_str[:-1]
print(result_str)


Fixed submission:
N = int(input())
a_list = list(map(int, input().split()))
result_list = [0] * N

for a in a_list:
    result_list[a-1] += 1

result_list_str = [str(i) for i in result_list]
print('\n'.join(result_list_str))

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

for i in range(1, N+1):
    tmp_list = [a for a in a_list if a == i]
    print(len(tmp_list))



Fixed submission:
N = int(input())
a_list = list(map(int, input().split()))
result_list = [0] * N

for a in a_list:
    result_list[a-1] += 1

result_list_str = [str(i) for i in result_list]
print('\n'.join(result_list_str))

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

for i in range(1, N+1):
    print(a_list.count(i))



Fixed submission:
N = int(input())
a_list = list(map(int, input().split()))
result_list = [0] * N

for a in a_list:
    result_list[a-1] += 1

result_list_str = [str(i) for i in result_list]
print('\n'.join(result_list_str))
Buggy python submission (verdict: Time Limit Exceeded):
A, B, C, X, Y = tuple(map(int, input().split()))

# 大きな値で初期化
TOTAL_MIN = A * X + B * Y + C * (X+Y) * 2

if 2 * C < A:
    i_max = 0
else:
    i_max = X
if 2 * C < B:
    j_max = 0
else:
    j_max = Y

for i in range(i_max + 1):
    for j in range(j_max + 1):
        k = max(X - i, Y - j) * 2
        total_tmp = A * i + B * j + C * k
        if total_tmp < TOTAL_MIN:
            TOTAL_MIN = total_tmp

print(TOTAL_MIN)


Fixed submission:
A, B, C, X, Y = tuple(map(int, input().split()))

# 大きな値で初期化
TOTAL_MIN = A * X + B * Y + C * (X+Y) * 2

for a in range(X + 1):
    c = (X - a) * 2
    if c // 2 < Y:
        if B < 2 * C:
            b = Y - c // 2
        else:
            b = 0
            c = max(c, Y * 2) 
    else:
        b = 0
    
    total_tmp = A * a + B * b + C * c
    if total_tmp < TOTAL_MIN:
        TOTAL_MIN = total_tmp
        

print(TOTAL_MIN)

Buggy python submission (verdict: Time Limit Exceeded):
A, B, C, X, Y = tuple(map(int, input().split()))

# 大きな値で初期化
TOTAL_MIN = A * X + B * Y + C * (X+Y) * 2
for i in range(X+1):
    for j in range(Y+1):
        k = max(X - i, Y - j) * 2
        total_tmp = A * i + B * j + C * k
        if total_tmp < TOTAL_MIN:
            TOTAL_MIN = total_tmp

print(TOTAL_MIN)


Fixed submission:
A, B, C, X, Y = tuple(map(int, input().split()))

# 大きな値で初期化
TOTAL_MIN = A * X + B * Y + C * (X+Y) * 2

for a in range(X + 1):
    c = (X - a) * 2
    if c // 2 < Y:
        if B < 2 * C:
            b = Y - c // 2
        else:
            b = 0
            c = max(c, Y * 2) 
    else:
        b = 0
    
    total_tmp = A * a + B * b + C * c
    if total_tmp < TOTAL_MIN:
        TOTAL_MIN = total_tmp
        

print(TOTAL_MIN)

Buggy python submission (verdict: Time Limit Exceeded):
A, B, C, X, Y = tuple(map(int, input().split()))

A + 2 // C > X
B + 2 // C > Y

# 大きな値で初期化
TOTAL_MIN = A * X + B * Y + C * (X+Y) * 2
for i in range(X+1):
    for j in range(Y+1):
        k = max(X - i, Y - j) * 2
        total_tmp = A * i + B * j + C * k
        if total_tmp < TOTAL_MIN:
            TOTAL_MIN = total_tmp

print(TOTAL_MIN)


Fixed submission:
A, B, C, X, Y = tuple(map(int, input().split()))

# 大きな値で初期化
TOTAL_MIN = A * X + B * Y + C * (X+Y) * 2

for a in range(X + 1):
    c = (X - a) * 2
    if c // 2 < Y:
        if B < 2 * C:
            b = Y - c // 2
        else:
            b = 0
            c = max(c, Y * 2) 
    else:
        b = 0
    
    total_tmp = A * a + B * b + C * c
    if total_tmp < TOTAL_MIN:
        TOTAL_MIN = total_tmp
        

print(TOTAL_MIN)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
print(n(n-1)//2+m(m-1)//2)

Fixed submission:
n, m = map(int, input().split())
print(n*(n-1)//2+m*(m-1)//2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
b = [0 for i in range(n)]
s = 0

for i in range(n):
    b[a[i]-1] += 1

for i in range(n):
    s += (b[i]*(b[i]-1))//2

for i in range(n):
    print(s-b[a[i]-1]+1)

Fixed submission:
n = int(input())
print(n*n*n/27)

Buggy python submission (verdict: Runtime Error):
n = input()
print(n*n*n/27)

Fixed submission:
n = int(input())
print(n*n*n/27)
Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split())
print(n//(a+b))*a+min((n%(a+b), a)

Fixed submission:
n, a, b = map(int, input().split())
print((n//(a+b))*a+min(n%(a+b), a))
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())

d={}

for i in range(m):
    s, c = map(int, input().split())
    if s == 1 and c == 0:
        print(-1)
        eixt()
    elif s not in d:
        d[s] = c
    else:
        if d[s] != c:
            print(-1)
            exit()
if 1 not in d:
    d[1] = 1
for i in range(2, n+1):
    if i not in d:
        d[i] = 0
ans = 0
for i in range(1, n+1):
    ans += d[i] * pow(10, n-i)
print(ans)

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

d={}

for i in range(m):
    s, c = map(int, input().split())
    if s == 1 and c == 0 and n != 1:
        print(-1)
        exit()
    elif s not in d:
        d[s] = c
    else:
        if d[s] != c:
            print(-1)
            exit()
if 1 not in d and n != 1:
    d[1] = 1
if 1 not in d and n == 1:
    d[1]=0
    
for i in range(2, n+1):
    if i not in d:
        d[i] = 0
ans = 0
for i in range(1, n+1):
    ans += d[i] * pow(10, n-i)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=[input() for i in range(n)]
a=set(s)
ss=sorted(list(a))
ct=0
for i in a:
    if ct < s.count(i):
        ct = s.count(i)

for i in ss:
    if ct == s.count(i):
        print(i)


Fixed submission:
import sys
n=int(input())
s=sorted([input() for i in range(n)])
ct=0
tmp=1
for i in range(n-1):
    if s[i] ==s[i+1]:
        tmp+=1
    else:
        if tmp>ct:
            ct=tmp
        tmp=1
if tmp > ct:
    ct = tmp
    
if tmp == 1:
    for i in range(n):
        print(s[i])
    sys.exit()

tmp=1
for i in range(n-1):
    if s[i] ==s[i+1]:
        tmp+=1
        if tmp == ct:
            print(s[i])
    else:
        tmp=1
Buggy python submission (verdict: Runtime Error):
import math
n, m = int(input().split())
print(math.ceil(n/m))


Fixed submission:
import math
n, m = map(int, input().split())
print(math.ceil(n/m))

Buggy python submission (verdict: Runtime Error):
import math
n, m = input().split()
print(math.ceil(n/m))

Fixed submission:
import math
n, m = map(int, input().split())
print(math.ceil(n/m))
Buggy python submission (verdict: Runtime Error):
n, m=input().split
if n==m:
    print("AC")
else:
    print("WA")
    

Fixed submission:
n, m=input().split()
if n==m:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n, m=map(int, input().split())
a=set()
d={}
pena=0
for i in range(m):
    p, s=input().split()
    if s=="AC":
        a.add(int(p))
        pena+=d.pop(p)
    else:
        if p in d:
            d[p]+=1
        else:
            d[p]=1
print(len(a), pena)


Fixed submission:
n, m=map(int, input().split())
a=set()
d={}
pena=0
for i in range(m):
    p, s=input().split()
    if s=="AC" and int(p) not in a:
        a.add(int(p))
        if p in d:
            pena+=d.pop(p)
    else:
        if p in d:
            d[p]+=1
        else:
            d[p]=1
print(len(a), pena)
Buggy python submission (verdict: Runtime Error):
n = int(input())
b = list(map(int, input().split()))
ans = b[0] + b[-1]
for i in range n-2:
    ans += min(b[i], b[i+1])
print(ans)


Fixed submission:
n = int(input())
b = list(map(int, input().split()))
ans = b[0] + b[-1]
for i in range(n-2):
    ans += min(b[i], b[i+1])
print(ans)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse = True)
b = [list(map(int, input().split())) for i in range(m)]
b.sort(key=lambda x: -x[1])

ct1 = 0
ct2 = 0
ans = 0
i = 0

while i in range(n):
    if a[ct1] > b[ct2][1]:
        ans += a[ct1]
        ct1 += 1
        i += 1
    else:
        j = min(n-i, b[ct2][0])
        ans += b[ct2][1] * j
        i += j
        ct2 += 1

print(ans)


Fixed submission:
n, m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse = True)
b = [list(map(int, input().split())) for i in range(m)]
b.sort(key=lambda x: -x[1])

ct1 = 0
ct2 = 0
ans = 0
i = 0

while i in range(n):
    if ct2 < m:
        if a[ct1] < b[ct2][1]:
            j = min(n-i, b[ct2][0])
            ans += b[ct2][1] * j
            i += j
            ct2 += 1
        else:
            ans += a[ct1]
            ct1 += 1
            i += 1
    else:
        ans += a[ct1]
        ct1 += 1
        i += 1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return len(lower_divisors + upper_divisors[::-1])

x=0
for c in range(1,N):
    x+=make_divisors(N-c)
print(x)

Fixed submission:
n = int(input())
ans = 0
for a in range(1, n):
  ans += (n - 1) // a
print(ans)

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

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return len(divisors)

x=0
for c in range(1,N):
    x+=make_divisors(N-c)
print(x)

Fixed submission:
n = int(input())
ans = 0
for a in range(1, n):
  ans += (n - 1) // a
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
yakusu=[]
for c in range(1,N):
    for i in range(1,N-c+1):
        if (N-c)%i==0:
            yakusu.append(i)
print(len(yakusu))

Fixed submission:
n = int(input())
ans = 0
for a in range(1, n):
  ans += (n - 1) // a
print(ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
p=[]
for i in range(N):
    p.append(list(map(int, input().split())))
q=[]
for i in range(N):
    for j in range(N-i):
        q.append(abs(p[i][0]-p[i+j][0])+abs(p[i][1]-p[i+j][1]))
print(max(q))


Fixed submission:
x=int(input())
print(1 if x==0 else 0)
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline.rstrip
sys.setrecursionlimit(10**6)
import decimal
from decimal import Decimal
decimal.getcontext().prec = 10

from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
import collections
from collections import deque 

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def _debug(obj):
    print(obj, file=sys.stderr)

# ---------------------------------------

s = input()
if s[-1] == "s":
    s += "es"
else:
    s += "s"
print(s)


Fixed submission:
s = input()
if s[-1] == "s":
    s += "es"
else:
    s += "s"
print(s)

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline.rstrip()
sys.setrecursionlimit(10**6)
import decimal
from decimal import Decimal
decimal.getcontext().prec = 10

from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
import collections
from collections import deque 

def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def _debug(obj):
    print(obj, file=sys.stderr)

# ---------------------------------------

s = input()
if s[-1] == "s":
    s += "es"
else:
    s += "s"
print(s)


Fixed submission:
s = input()
if s[-1] == "s":
    s += "es"
else:
    s += "s"
print(s)

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
import decimal
from decimal import Decimal
decimal.getcontext().prec = 10
 
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
import collections
from collections import deque 
 
def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
def _debug(obj):
    print(obj, file=sys.stderr)
 
# ---------------------------------------
 
n = inp()
cnt = 0
mx = 0
for i in range(n):
    d1, d2 = inpl()
    if d1 == d2:
        cnt += 1
    else:
        cnt = 0
    mx = max(mx, cnt)
 
if mx >= 3:
    print("Yes")
else:
    print("No")
 

Fixed submission:
s = input()
if s[-1] == "s":
    s += "es"
else:
    s += "s"
print(s)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
read = sys.stdin.readline
import time
from heapq import heappush, heappop, heapify
import math
import itertools as it
from collections import deque 


def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
start_time = time.perf_counter()
# ------------------------------

mod = 10**9 + 7

N = inp()
A = inpl()
wa = 0
for i in range(0, N - 1):
    for j in range(i+1, N):
        wa = (wa + A[i] * A[j]) % mod
print(wa)

# -----------------------------
end_time = time.perf_counter()
print('time:', end_time-start_time, file=sys.stderr)



Fixed submission:
import sys
read = sys.stdin.readline
import time
from heapq import heappush, heappop, heapify
import math
import itertools as it
from collections import deque 


def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
start_time = time.perf_counter()
# ------------------------------


mod = 10**9 + 7

N = inp()
A = inpl()
wa = 0
sm = A[0]
for i in range(1, N):
    wa = (wa + sm * A[i]) % mod
    sm = (sm + A[i]) % mod
print(wa)

# -----------------------------
end_time = time.perf_counter()
print('time:', end_time-start_time, file=sys.stderr)
Buggy python submission (verdict: Runtime Error):
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inpl():
    return list(map(int, input().split()))
st = time.perf_counter()
# ------------------------------

N, K = inpl()
A = inpl()
for i in range(K, N):
    if A[i] > A[i-K]:
        print('Yes')
    else:
        print('No')

# -----------------------------
ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)


Fixed submission:
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inpl():
    return list(map(int, input().split()))
st = time.perf_counter()
# ------------------------------

N = int(input())
if 400 <= N and N <= 599:
    ans = 8
elif 600 <= N and N <= 799:
    ans = 7
elif 800 <= N and N <= 999:
    ans = 6
elif 1000 <= N and N <= 1199:
    ans = 5
elif 1200 <= N and N <= 1399:
    ans = 4
elif 1400 <= N and N <= 1599:
    ans = 3
elif 1600 <= N and N <= 1799:
    ans = 2
elif 1800 <= N and N <= 1999:
    ans = 1


print(ans)



# ------------------------------
ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)

Buggy python submission (verdict: Runtime Error):
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inpl():
    return list(map(int, input().split()))
st = time.perf_counter()
# ------------------------------

N = int(input())
if 400 <= N and N <= 599:
    ans = 8
elif 600 <= N and N <= 799:
    ans = 7
elif 800 <= N and N <= 99:
    ans = 6
elif 1000 <= N and N <= 1199:
    ans = 5
elif 1200 <= N and N <= 1399:
    ans = 4
elif 1400 <= N and N <= 1599:
    ans = 3
elif 1600 <= N and N <= 1799:
    ans = 2
elif 1800 <= N and N <= 1999:
    ans = 1


print(ans)



# ------------------------------
ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)


Fixed submission:
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inpl():
    return list(map(int, input().split()))
st = time.perf_counter()
# ------------------------------

N = int(input())
if 400 <= N and N <= 599:
    ans = 8
elif 600 <= N and N <= 799:
    ans = 7
elif 800 <= N and N <= 999:
    ans = 6
elif 1000 <= N and N <= 1199:
    ans = 5
elif 1200 <= N and N <= 1399:
    ans = 4
elif 1400 <= N and N <= 1599:
    ans = 3
elif 1600 <= N and N <= 1799:
    ans = 2
elif 1800 <= N and N <= 1999:
    ans = 1


print(ans)



# ------------------------------
ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)