Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
H, W = map(int, input().split())

# num = H * W


if H == 0 or W == 0:
    print(int(0))

elif H == 1 or W == 1:
    print(int(1))

elif H % 2 == 0 and W % 2 == 0:
    print(int(H/2 * W))

elif H % 2 == 0:
    print(int(H/2 * W))

elif W % 2 == 0:
    print(int(W/2) * H)

elif H % 2 != 0 and W % 2 != 0:
    key = W // 2
    ans = H * key
    print(int(ans + (H-H//2)))
    # else:
    #     num = H // 2
    #     ans = num * W
    #     print(int(ans + (H-(num))))


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


d = c - a - b

if d > 0 and d ** 2 > 4 * a * b:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
quant = A + B

if quant - K <= 0:
    print('0 0')
else:
    RNT = A - K  # RemainNumTime
    a = max(RNT, 0)
    b = min(B + RNT, B)
    print(a + ' ' + b)

Fixed submission:
A, B, K = map(int, input().split())
quant = A + B

if quant - K <= 0:
    print('0 0')
else:
    rnt = A - K  # RemainNumTime
    a = max(rnt, 0)
    b = min(B + rnt, B)
    print(str(a) + ' ' + str(b))

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
quant = A + B

if quant - K <= 0:
    print('0 0')
else:
    RNT = A - K  # RemainNumTime
    a = max(RNT, 0)
    b = min(B + RNT, B)
    print(f'{a} {b}')


Fixed submission:
A, B, K = map(int, input().split())
quant = A + B

if quant - K <= 0:
    print('0 0')
else:
    rnt = A - K  # RemainNumTime
    a = max(rnt, 0)
    b = min(B + rnt, B)
    print(str(a) + ' ' + str(b))
Buggy python submission (verdict: Runtime Error):
import math

# 最小公倍数lcm（ least common multiple）を返す関数は用意されていない
# が、lcm(a, b) = a * b / gcd(a, b)で求められる

A, B = map(int, input().split())
ans = A * B // math.gcd(A, B)
print(ans)


Fixed submission:
import fractions

# 最小公倍数lcm（ least common multiple）を返す関数は用意されていない
# が、lcm(a, b) = a * b / gcd(a, b)で求められる

A, B = map(int, input().split())
ans = A * B // fractions.gcd(A, B)
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()

X = [SUN,MON,TUE,WED,THU,FRI,SAT]
print(7 - X.index(S))

Fixed submission:
S = input()

X = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - X.index(S))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

ans = 0
for num in range(N):
    ans += num


print(ans)

Fixed submission:
N = int(input())
a = N - 1
print(int(a*(a+1)//2))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
nums = [int(input()) for _ in range(N)]

all_max = max(nums)
for num in range(N):
    if nums[num] == all_max:
        new_nums = list(nums)
        new_nums.pop(num)
        print(max(new_nums))
    else:
        print(all_max)


Fixed submission:
N = int(input())
nums = [int(input()) for _ in range(N)]

all_max = max(nums)

new_nums = list(nums)
new_nums.remove(all_max)

second_max = max(new_nums)  # max関数はfor文の中にいれずに、先に2番目の最大値をもとめておく

for num in range(N):
    if nums[num] == all_max:
        print(second_max)
    else:
        print(all_max)
Buggy python submission (verdict: Runtime Error):

dishes = [input() for _ in range(5)]

sum_dishes = 0
last_dish = 0
last_tmp = 0
for idx, dish in enumerate(dishes):
    tmp = 10 - int(dish[-1])
    dish = int(dish)
    if tmp == 10:
        sum_dishes += dish
    elif tmp > last_tmp:
        sum_dishes += last_dish + last_tmp
        last_dish = dish
        last_tmp = tmp
        last_idx = idx
    else:
        sum_dishes += dish + tmp

print(sum_dishes + int(dishes[last_idx]))


Fixed submission:
dishes = [input() for _ in range(5)]


def tanuki(dishes):
    if all([i[-1] == '0' for i in dishes]):
        return sum([int(i) for i in dishes])

    sum_dishes = 0
    last_dish = 0
    last_tmp = 0
    for idx, dish in enumerate(dishes):
        tmp = 10 - int(dish[-1])
        dish = int(dish)
        if tmp == 10:
            sum_dishes += dish
        elif tmp > last_tmp:
            sum_dishes += last_dish + last_tmp
            last_dish = dish
            last_tmp = tmp
            last_idx = idx
        else:
            sum_dishes += dish + tmp
    return sum_dishes + int(dishes[last_idx])


print(tanuki(dishes))

Buggy python submission (verdict: Runtime Error):

dishes = [input() for _ in range(5)]

sum_dishes = []
last_dish = 0
last_tmp = 0
for idx, dish in enumerate(dishes):
    tmp = 10 - int(dish[-1])
    dish = int(dish)
    if tmp == 10:
        sum_dishes.append(dish)
    elif tmp > last_tmp:
        sum_dishes.append(last_dish + last_tmp)
        last_dish = dish
        last_tmp = tmp
        last_idx = idx
    else:
        sum_dishes.append(dish + tmp)

print(sum(sum_dishes) + int(dishes[last_idx]))

Fixed submission:
dishes = [input() for _ in range(5)]


def tanuki(dishes):
    if all([i[-1] == '0' for i in dishes]):
        return sum([int(i) for i in dishes])

    sum_dishes = 0
    last_dish = 0
    last_tmp = 0
    for idx, dish in enumerate(dishes):
        tmp = 10 - int(dish[-1])
        dish = int(dish)
        if tmp == 10:
            sum_dishes += dish
        elif tmp > last_tmp:
            sum_dishes += last_dish + last_tmp
            last_dish = dish
            last_tmp = tmp
            last_idx = idx
        else:
            sum_dishes += dish + tmp
    return sum_dishes + int(dishes[last_idx])


print(tanuki(dishes))
Buggy python submission (verdict: Runtime Error):
N, T = map(int, input().split())

d = {}
for _ in range(N):
    Ns = [int(i) for i in input().split()]
    time = Ns[1]
    if time <= T:
        d[Ns[0]] = time
if d:
    print(min(d))
else:
    print('TLE')

Fixed submission:
N = int(input())


if N == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A + B)
Buggy python submission (verdict: Runtime Error):
from math import log, sqrt
max_num = 1
for i in range(2, int(sqrt(X)) + 1):
    max_num = max(max_num, i ** int(log(X, i)))

print(max_num)

Fixed submission:
import math
X = int(input())

sq = int(math.sqrt(X))
m = 1
for b in range(2, sq+1):  # ここで2が1になると1のp乗となり永遠にループが回り続ける
    p = 2
    tmp = b ** p
    while tmp <= X:
        m = max(tmp, m)
        p += 1
        tmp = b ** p
print(m)
Buggy python submission (verdict: Runtime Error):
n = int(input())
nums = [int(input()) for _ in range(n)]
cnt = {}
ans = 0
for x in nums:
    if x not in cnt:
        cnt[x] = 1
    else:
        cnt[x] += 1
for y in cnt.values():
    if cnt[y] % 2 != 0:
        ans += 1

print(ans)

Fixed submission:
n = int(input())
nums = [int(input()) for _ in range(n)]
cnt = {}
ans = 0
for x in nums:
    if x not in cnt:
        cnt[x] = 1
    else:
        cnt[x] += 1
for y in cnt.values():
    if y % 2 != 0:
        ans += 1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
nums = [input() for _ in range(N)]

paper = []
for num in nums:
    if num not in paper:
        paper.append(num)
    else:
        paper.remove(num)

print(len(paper))

Fixed submission:
n = int(input())
nums = [int(input()) for _ in range(n)]
cnt = {}
ans = 0
for x in nums:
    if x not in cnt:
        cnt[x] = 1
    else:
        cnt[x] += 1
for y in cnt.values():
    if y % 2 != 0:
        ans += 1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
nums = [int(input()) for _ in range(N)]

i = 0
n = N
while i < n:
    num = nums[i]
    cnt = nums.count(num)
    if cnt == 1:
        i += 1
    elif cnt % 2 == 0:
        for _ in range(cnt):
            nums.remove(num)
        i += 1
        n = len(nums)
    else:
        for _ in range(cnt-1):
            nums.remove(num)
        i += 1
        n = len(nums)

print(n)

Fixed submission:
n = int(input())
nums = [int(input()) for _ in range(n)]
cnt = {}
ans = 0
for x in nums:
    if x not in cnt:
        cnt[x] = 1
    else:
        cnt[x] += 1
for y in cnt.values():
    if y % 2 != 0:
        ans += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
A = [list(input().split()) for i in range(M)]

starts = {}
goals = {}
for i in range(len(A)):
    s_num = A[i][0]
    g_num = A[i][1]
    if s_num == '1':
        starts[A[i][1]] = 0
    elif g_num == str(N):
        goals[A[i][0]] = 0

is_ok = False
for s in starts:
    for g in goals:
        if s == g:
            is_ok = True
            break
    if is_ok:
        break


# is_ok = False
# for j in range(len(start)):
#     for k in range(len(goal)):
#         if start[j][1] == goal[k][0]:
#             is_ok = True
#             break
#     if is_ok:
#         break

if is_ok:
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')

Fixed submission:
N, M = map(int, input().split())
A = [list(input().split()) for i in range(M)]

starts = {}
goals = {}
for i in range(len(A)):
    s_num = A[i][0]
    g_num = A[i][1]
    if s_num == '1':
        starts[A[i][1]] = 0
    elif g_num == str(N):
        goals[A[i][0]] = 0

is_ok = False
for s in starts:
    if s in goals:
        is_ok = True
        break


# is_ok = False
# for j in range(len(start)):
#     for k in range(len(goal)):
#         if start[j][1] == goal[k][0]:
#             is_ok = True
#             break
#     if is_ok:
#         break

if is_ok:
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')

Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
A = [list(input().split()) for i in range(M)]

start = []
goal = []
for i in range(len(A)):
    if A[i][0] == '1':
        start.append(A[i])
    elif A[i][1] == str(N):
        goal.append(A[i])

is_ok = False
for j in range(len(start)):
    for k in range(len(goal)):
        if start[j][1] == goal[k][0]:
            is_ok = True
            break
    if is_ok:
        break

if is_ok:
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')

Fixed submission:
N, M = map(int, input().split())
A = [list(input().split()) for i in range(M)]

starts = {}
goals = {}
for i in range(len(A)):
    s_num = A[i][0]
    g_num = A[i][1]
    if s_num == '1':
        starts[A[i][1]] = 0
    elif g_num == str(N):
        goals[A[i][0]] = 0

is_ok = False
for s in starts:
    if s in goals:
        is_ok = True
        break


# is_ok = False
# for j in range(len(start)):
#     for k in range(len(goal)):
#         if start[j][1] == goal[k][0]:
#             is_ok = True
#             break
#     if is_ok:
#         break

if is_ok:
    print('POSSIBLE')
else:
    print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
ABs = [input().split() for i in range(M)]


MPs = {}
for a, b in ABs:
    # この書き方でa,bが取り出せる
    a = int(a)  # intに直すには先に直しておく
    b = int(b)
    if a not in MPs:
        MPs[a] = 1
    else:
        MPs[a] += 1
    if b not in MPs:
        MPs[b] = 1
    else:
        MPs[b] += 1

for mp in range(1, N+1):
    if mp not in MPs:
        MPs[mp] = '0'

for _, y in sorted(MPs.items()):  # 使わない変数は_とする
    print(y)

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

if A <= C and C <= B:
    print("Yes")
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
ABs = [input().split() for i in range(M)]


MPs = {}
# この書き方でa,bが取り出せる
for a, b in ABs:
    a = int(a)  # intに直すには先に直しておく
    b = int(b)
    if a not in MPs:
        MPs[a] = 1
    else:
        MPs[a] += 1
    if b not in MPs:
        MPs[b] = 1
    else:
        MPs[b] += 1

for mp in range(1, N+1):
    print(MPs[mp])


Fixed submission:
N, M = map(int, input().split())
ABs = [input().split() for i in range(M)]
 
 
MPs = {}
for a, b in ABs:
    a = int(a)
    b = int(b)
    if a not in MPs:
        MPs[a] = 1
    else:
        MPs[a] += 1
    if b not in MPs:
        MPs[b] = 1
    else:
        MPs[b] += 1
 
for mp in range(1, N+1):
    if mp not in MPs:
        MPs[mp] = '0'
 
for _, y in sorted(MPs.items()):
    print(y)

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
ABs = [input().split() for i in range(M)]

MPs = {}
for a, b in ABs:
    # この書き方でa,bが取り出せる
    a = int(a)  # intに直すには先に直しておく
    b = int(b)
    if a not in MPs:
        MPs[a] = 1
    else:
        MPs[a] += 1
    if b not in MPs:
        MPs[b] = 1
    else:
        MPs[b] += 1

for mp in range(1, N+1):
    print(MPs[mp])

Fixed submission:
N, M = map(int, input().split())
ABs = [input().split() for i in range(M)]
 
 
MPs = {}
for a, b in ABs:
    a = int(a)
    b = int(b)
    if a not in MPs:
        MPs[a] = 1
    else:
        MPs[a] += 1
    if b not in MPs:
        MPs[b] = 1
    else:
        MPs[b] += 1
 
for mp in range(1, N+1):
    if mp not in MPs:
        MPs[mp] = '0'
 
for _, y in sorted(MPs.items()):
    print(y)

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
ABs = [input().split() for i in range(M)]


MPs = {}
for a, b in ABs:
    # この書き方でa,bが取り出せる
    a = int(a)  # intに直すには先に直しておく
    b = int(b)
    if a not in MPs:
        MPs[a] = 1
    else:
        MPs[a] += 1
    if b not in MPs:
        MPs[b] = 1
    else:
        MPs[b] += 1

for mp in range(1, N+1):
    print(MPs[mp])


Fixed submission:
N, M = map(int, input().split())
ABs = [input().split() for i in range(M)]
 
 
MPs = {}
for a, b in ABs:
    a = int(a)
    b = int(b)
    if a not in MPs:
        MPs[a] = 1
    else:
        MPs[a] += 1
    if b not in MPs:
        MPs[b] = 1
    else:
        MPs[b] += 1
 
for mp in range(1, N+1):
    if mp not in MPs:
        MPs[mp] = '0'
 
for _, y in sorted(MPs.items()):
    print(y)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

power = 1
for i in range(1, N+1):
    power *= i
print(power % (10 ** 9 + 7))

Fixed submission:
# N = int(input())

# power = 1
# for i in range(1, N+1):
#    power *= i
# print(power % (10 ** 9 + 7))

# TLEとなってしまう
# modの世界を使う

N = int(input())
power = 1
for i in range(1, N+1):
    power = power * i % (10 ** 9 + 7)

print(power)
Buggy python submission (verdict: Runtime Error):
import numpy as np
#b.py

n=int(input())
a=[int(i) for i in input().split()]
a = np.array(a)
result=1
for i in range(n):
	#a = map(int,input().split())
	result *= a[i]
if result > 1000000000000000000:
	print(-1)
else:
	print(result)

Fixed submission:
import sys
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
LIMIT = 10 ** 18
n=int(input())
#a=(int,read.split())
a=[int(i) for i in input().split()]
if 0 in a:
	print(0)
	exit()

ans = 1
for i in a:
	ans *= i
	if ans > LIMIT:
		print(-1)
		exit()
print(ans)

Buggy python submission (verdict: Runtime Error):
n,m,c=map(int,input().split())
bli = [int(i) for i in input().split()]
ans=0
for i in range(n):
	a = [int(j) for j in input().split()]
	sum=0
	for k in range(m):
		sum += a[k]*bli[k]
	if sum + c > 0:
		ans += 1

print(ans)



Fixed submission:
import sys
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
LIMIT = 10 ** 18
n=int(input())
#a=(int,read.split())
a=[int(i) for i in input().split()]
if 0 in a:
	print(0)
	exit()

ans = 1
for i in a:
	ans *= i
	if ans > LIMIT:
		print(-1)
		exit()
print(ans)
Buggy python submission (verdict: Runtime Error):
from collections import Counter
n=int(input())
a=[input() for _ in range(n)]
c=Counter(s)
sort(c.items())
max_cnt=max(c.values())
names=[name for k,v in c if v==max_cnt]
print(names)

Fixed submission:
from collections import Counter
n=int(input())
a=[input() for _ in range(n)]
c=Counter(a)
max_cnt=max(c.values())
names=[name for name,v in c.items() if v==max_cnt]
names.sort()
print(*names,sep='\n')
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
p=[int(x) for x in input().split()]
#さいころの出目の和を集計
for i in range(n):
    p[i]+=1

sdict={}
sdict[0]=p[0]

for i in range(n-1):
	sdict[i+1]=sdict[i]+p[i+1]

j=0
ans=0
while (j+k <=n):
	dif=sdict[j+k]-sdict[j]
	ans=max(dif,ans)
         j+=1
print(ans/2)

Fixed submission:
n,k=map(int,input().split())
p=[int(x) for x in input().split()]
#さいころの出目の和を集計
for i in range(n):
    p[i]+=1

sdict={}
sdict[0]=p[0]

for i in range(n-1):
	sdict[i+1]=sdict[i]+p[i+1]
j=0
ans=0
if n!=k:
	while (j+k <n):
		dif=sdict[j+k]-sdict[j]
		ans=max(dif,ans)
		j+=1
else:
	ans=sum(p)
print(ans/2)
Buggy python submission (verdict: Runtime Error):
a,b= int(input()).split()

count=0
while a >0:
	a -= b
	count+=1
print(count)

Fixed submission:

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

count=0
while a >0:
	a -= b
	count+=1
print(count)

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

count=0
while a >0:
	a -= b
	count+=1
print(count)

Fixed submission:

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

count=0
while a >0:
	a -= b
	count+=1
print(count)
Buggy python submission (verdict: Runtime Error):

a,b=map(int, input().split())
A = list(map(int, input().split()))
sum = 0
for at in list:
	sum += at
	
	
if a <= sum:
	print("Yes")
else:
	print("No")

Fixed submission:

a,b=map(int, input().split())
A = list(map(int, input().split()))
sum = 0
for at in A:
	sum += at
	
	
if a <= sum:
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):

a,b=map(int, input().split())
A = list(map(int, input().split()))

total = 0
for at in list:
	sum += at
	
	
if a <= sum:
	print("Yes")
else:
	print("No")

Fixed submission:

a,b=map(int, input().split())
A = list(map(int, input().split()))
sum = 0
for at in A:
	sum += at
	
	
if a <= sum:
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):

a,b=map(int, input().split())
A = list(map(int, input().split())

sum=0
for at in list:
	sum += at
	
	
if a <= sum:
	print("Yes")
else:
	print("No")

Fixed submission:

a,b=map(int, input().split())
A = list(map(int, input().split()))
sum = 0
for at in A:
	sum += at
	
	
if a <= sum:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
num=list(map(int,input().split()))
don=[]
cnt=0
for i in num:
    flg=True
    for j in don:
        if i > j:
            flg=False
    if flg:
        don.append(i)
        cnt+=1
print(cnt)

Fixed submission:
n=int(input())
num=list(map(int,input().split()))
cnt=1
min_n=num[0]
for i in range(1,n):
    if num[i] <= min_n:
        min_n=num[i]
        cnt+=1
print(cnt)

Buggy python submission (verdict: Runtime Error):
n=int(input())
num=list(map(int,input().split()))
don=[]
cnt=0
#don.append(num[0])
for i in num:
	flg=True
	for j in don:
		if i > j:
			flg=False
	if flg:
		#don.append(i)
        cnt+=1
print(cnt)


Fixed submission:
n=int(input())
num=list(map(int,input().split()))
cnt=1
min_n=num[0]
for i in range(1,n):
    if num[i] <= min_n:
        min_n=num[i]
        cnt+=1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
num=list(map(int,input().split()))
don=[]
#don.append(num[0])
for i in num:
	flg=True
	for j in don:
		if i > j:
			flg=False
	if flg:
		don.append(i)
print(len(don))

Fixed submission:
n=int(input())
num=list(map(int,input().split()))
cnt=1
min_n=num[0]
for i in range(1,n):
    if num[i] <= min_n:
        min_n=num[i]
        cnt+=1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
num=list(map(int,input().split()))
don=[]
#don.append(num[0])
for i in num:
	flg=True
	for j in don:
		if i > j:
			flg=False
	if flg:
		don.append(i)
print(len(don))

Fixed submission:
n=int(input())
num=list(map(int,input().split()))
cnt=1
min_n=num[0]
for i in range(1,n):
    if num[i] <= min_n:
        min_n=num[i]
        cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
print(S.count("ABC")


Fixed submission:
N = int(input())
S = input()
print(S.count("ABC"))
Buggy python submission (verdict: Time Limit Exceeded):
A,B,K = map(int,input().split())
while(K != 0):
    if A > 0:
        A -= 1
        K -= 1
    elif B > 0:
        B -= 1
        K -= 1

print(A,B)

Fixed submission:
A,B,K = map(int,input().split())

A,K = A-K, K-A
if A < 0:
    A = 0  
elif K < 0:
    K = 0
    
B = B-K
if B < 0:
    B = 0
    
print(A,B)
Buggy python submission (verdict: Runtime Error):
#149d

def win(n):
	if n=='r':
		return p
	elif n=='s':
		return r
	else:
		return s

n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
score=0
for i in t:
	score += win(i)

#hands=list(t)

for i in range(n):
	if i+k<n:
		if t[i]==t[i+k]:
			score-=win(t[i+k])
			t[i+k]='x'
print(score)

Fixed submission:

def win(n):
	if n=='r':
		return p
	elif n=='s':
		return r
	else:
		return s

n,k=map(int,input().split())
r,s,p=map(int,input().split())
t=input()
score=0
for i in t:
	score += win(i)

hands=list(t)

for i in range(n):
	if i+k<n:
		if hands[i]==hands[i+k]:
			score-=win(hands[i+k])
			hands[i+k]='x'
print(score)
Buggy python submission (verdict: Runtime Error):
def cal(n):
	#dp=[]
	if n<2:
		return 1
	else:
		return n*cal(n-2)

n=int(input())
ans=cal(n)
cnt=0
while ans%10==0:
	ans//=10
	cnt+=1
#print(ans)
print(cnt)

Fixed submission:
n=int(input())
cnt=0
div=5
if n%2!=0:
	print(0)
	exit()
else:
	n//=2
	while n>=1:
		n//=div
		cnt+=n
#print(ans)
print(cnt)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())

soc=1
	while a<b :
		soc += 1
		a += a-1
if b==1:
	soc = 0
	
print(soc)

Fixed submission:
a,b = map(int,input().split())
soc=1
for i in range(1,21):
	if i*(a-1)+1 >= b:
		soc = i
		break
if b==1:
	soc=0

print(soc)
Buggy python submission (verdict: Runtime Error):
a=input()
ans=0
n=list(map(int, input().split())
for i in n:
	ans += 1/i

print(1/ans)


Fixed submission:
a=input()
ans=0
n=list(map(int, input().split()))
for i in n:
	ans += 1/i

print(1/ans)

Buggy python submission (verdict: Runtime Error):
a=int(input())
n=list(int,input().split())
ans=0
for i in n:
  ans += 1/i

print(1/ans)


Fixed submission:
a=input()
ans=0
n=list(map(int, input().split()))
for i in n:
	ans += 1/i

print(1/ans)
Buggy python submission (verdict: Runtime Error):
import sys
a,b=map(int, input().split())

if a-b > a+b:
    elif a-b > a*b:
        print(a-b)
    else:
        print(a*b)
elif a*b > a+b:
    elif a*b > a-b:
        print(a*b)
    else:
        print(a-b)

    

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

if a-b > a+b:
    if a-b > a*b:
        print(a-b)
    else:
        print(a*b)
elif a*b > a+b:
    if a*b > a-b:
        print(a*b)
    else:
        print(a-b)
else:
    print(a+b)

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

max = a + b

if a-b > max:
    elif a-b > a*b:
        print(a-b)
    else:
        print(a*b)
elif a*b > max:
    elif a*b > a-b:
        print(a*b)
    else:
        print(a-b)
        
    

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

if a-b > a+b:
    if a-b > a*b:
        print(a-b)
    else:
        print(a*b)
elif a*b > a+b:
    if a*b > a-b:
        print(a*b)
    else:
        print(a-b)
else:
    print(a+b)

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

max = a + b

if a - b > max:
    print(a-b)
elif a*b > max:
    print(a*b)
else:
    print(max)

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

if a-b > a+b:
    if a-b > a*b:
        print(a-b)
    else:
        print(a*b)
elif a*b > a+b:
    if a*b > a-b:
        print(a*b)
    else:
        print(a-b)
else:
    print(a+b)
Buggy python submission (verdict: Runtime Error):
import sys
a,b,c=map(int, input().split())

if 1 <= a < 100:
    if a < 10:
        print(a)
    else:
        print(9)
elif 100 <= a < 10000:
    if a < 1000:
        print(a - 90)
    else:
        print(900 + 9)
elif 10000 <= a < 100000:
    print(a - 9999)

Fixed submission:
N=int(input())
ans=0
for i in range(1,N+1):
  dig = len(str(i))
  if dig%2 != 0:
    ans +=1
   
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys
a = map(int, input().split())

print(3*a**2)

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

Buggy python submission (verdict: Runtime Error):
import sys
a = map(int, input().split())

print(3*a*a)


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