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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)


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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(str(wa))
elif sa >= wa and sa >= seki:
    print(str(sa))
else:
    print(str(seki))


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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)


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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)


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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)

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

seki = a * b
sa = a - b
wa = a + b

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)
     

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

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

if wa >= seki and wa >= sa:
    print(wa)
elif sa >= wa and sa >= seki:
    print(sa)
else:
    print(seki)
Buggy python submission (verdict: Runtime Error):
k, x = input(). split()
k = int(k)
x = int(x)

l = x - k + 1
m = x + k

for i in range(l, m)
    print(i)

Fixed submission:
k, x = input() .split()
k = int(k)
x = int(x)

l = x - k + 1
m = x + k

for i in range(l, m):
    print(i)

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

l = x - k + 1
m = x + k

for i in range(l, m):
    print(i)

Fixed submission:
k, x = input() .split()
k = int(k)
x = int(x)

l = x - k + 1
m = x + k

for i in range(l, m):
    print(i)
Buggy python submission (verdict: Runtime Error):
from collections import defaultdict
N = int(input())

string_dict = defaultdict(int)

for i in range(N):
    inp = list(input())
    inp.sort()

    string_dict["".join(inp)] += 1
# print(string_dict)


def kaijo(N):
    if N == 0:
        return 0
    if N == 1:
        return 0
    return N-1 + kaijo(N-1)


count = 0
for i in string_dict.values():
    if i >= 2:
        # print(kaijo(i))
        count += kaijo(i)
print(count)


Fixed submission:
from collections import defaultdict
N = int(input())
# N = 1000
string_dict = defaultdict(int)

for i in range(N):
    inp = list(input())
    # inp = list("aaaa")
    inp.sort()

    string_dict["".join(inp)] += 1
# print(string_dict)

count = 0
for i in string_dict.values():
    count += i*(i-1)//2
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())

length = len(str(N))

ans=0
for i in range(1, length + 1, 2):
    if i != length:
        ans += 10 ** i -(10**(i-1))
    else:
        ans += int(str(N)[1:]) + 1


print(ans)


Fixed submission:
N = int(input())

length = len(str(N))

ans = 0

if length % 2 == 1:
    ans += N - (10**(length-1)) + 1

for i in range(1, length+1, 2):
    if i == length:
        break
    ans += 10 ** i - (10**(i-1))



print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np


N = int(input())
waterlist = list(map(int, input().split()))

W = np.array(waterlist)
# print(W)

# print(waterlist)
# print(volume)
matrix = [[] for _ in range(N)]
for i in range(N):
    templist = [0 for _ in range(N)]
    templist[i] = 1
    if i == N - 1:
        templist[0] = 1
    else:
        templist[i + 1] = 1
    matrix[i] = templist


A = np.array(matrix)
inv_A = np.linalg.inv(A)
# print(inv_A)

ansmatrix = inv_A.dot(W)*2
# print(ansmatrix)
message = ""
for i in range(N):
    message += str(int(ansmatrix[i]))
    if i == (N - 1):
        break
    message += " "
print(message)


Fixed submission:


N = int(input())
waterlist = list(map(int, input().split()))
mountain = [0 for _ in range(N)]
S = 0
for i in range(N):
    S += waterlist[i]
# print(S)
x1 = S
for i in range(1, N, 2):
    x1 -= waterlist[i] * 2
mountain[0] = x1
# print(x1)
for i in range(1, N):
    mountain[i] = 2*waterlist[i-1]-mountain[i-1]

# print(mountain)
# A = np.array(matrix)
# inv_A = np.linalg.inv(A)
# # print(inv_A)

# ansmatrix = inv_A.dot(W)*2
# # print(ansmatrix)
message = ""
for i in range(N):
    message += str(int(mountain[i]))
    if i == (N - 1):
        break
    message += " "
print(message)
Buggy python submission (verdict: Runtime Error):
def paint(point, color):
    colors[point] = color

    # その点とつながる点で、まだ色が塗られていない点にルールに従い色を塗る
    for friend, w in reration[point]:
        if not colors[friend]:  # 塗られてない点
            # print(str(i)+"塗る")
            nextcolor = color*(-1)**w
            paint(friend, nextcolor)


N = int(input())
reration = [[] for i in range(N)]  # その点がつながる点
colors = ["" for i in range(N)]  # 色(作業中は簡単のため1,-1の2つに塗り分ける)
for i in range(N-1):
    U, V, W = map(int, input().split())
    reration[U-1].append((V-1, W % 2))
    reration[V-1].append((U-1, W % 2))

# print(hen)
# print(reration)
for i in range(N):
    if not colors[i]:
        paint(i, 1)
for co in colors:
    print((co+1)//2)


Fixed submission:
import sys

sys.setrecursionlimit(2**31-1)#ループ回数

def paint(point, color):
    colors[point] = color

    # その点とつながる点で、まだ色が塗られていない点にルールに従い色を塗る
    for friend, w in reration[point]:
        if not colors[friend]:  # 塗られてない点
            # print(str(i)+"塗る")
            nextcolor = color*(-1)**w
            paint(friend, nextcolor)


N = int(input())
reration = [[] for i in range(N)]  # その点がつながる点
colors = ["" for i in range(N)]  # 色(作業中は簡単のため1,-1の2つに塗り分ける)
for i in range(N-1):
    U, V, W = map(int, input().split())
    reration[U-1].append((V-1, W % 2))
    reration[V-1].append((U-1, W % 2))

# print(hen)
# print(reration)
for i in range(N):
    if not colors[i]:
        paint(i, 1)
for co in colors:
    print((co+1)//2)

Buggy python submission (verdict: Time Limit Exceeded):
def paint(point, color):
    colors[point] = color

    # その点とつながる点で、まだ色が塗られていない点にルールに従い色を塗る
    for i in reration[point]:
        if not colors[i]:  # 塗られてない点
            # print(str(i)+"塗る")
            nextcolor = color*((-1)**hen[point][i])
            paint(i, nextcolor)


N = int(input())
hen = [[0 for _ in range(N)] for i in range(N)]
reration = [[] for i in range(N)]  # その点がつながる点
colors = ["" for i in range(N)]  # 色(作業中は簡単のため1,-1の2つに塗り分ける)
for i in range(N-1):
    U, V, W = map(int, input().split())
    hen[U-1][V-1] = W % 2
    hen[V-1][U-1] = W % 2
    reration[U-1].append(V-1)
    reration[V-1].append(U-1)

# print(hen)
# print(reration)
for i in range(N):
    if not colors[i]:
        paint(i, 1)
for co in colors:
    print((co+1)//2)


Fixed submission:
import sys

sys.setrecursionlimit(2**31-1)#ループ回数

def paint(point, color):
    colors[point] = color

    # その点とつながる点で、まだ色が塗られていない点にルールに従い色を塗る
    for friend, w in reration[point]:
        if not colors[friend]:  # 塗られてない点
            # print(str(i)+"塗る")
            nextcolor = color*(-1)**w
            paint(friend, nextcolor)


N = int(input())
reration = [[] for i in range(N)]  # その点がつながる点
colors = ["" for i in range(N)]  # 色(作業中は簡単のため1,-1の2つに塗り分ける)
for i in range(N-1):
    U, V, W = map(int, input().split())
    reration[U-1].append((V-1, W % 2))
    reration[V-1].append((U-1, W % 2))

# print(hen)
# print(reration)
for i in range(N):
    if not colors[i]:
        paint(i, 1)
for co in colors:
    print((co+1)//2)
Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()

ACindex = []
index = 0
while (True):
    index = S.find("AC", index)
    if index == -1:
        break
    ACindex.append(index)
    index += 2
# print(ACindex)


for i in range(Q):
    L, R = map(int, input().split())
    L -= 1
    R -= 1
    count = 0
    for index in ACindex:
        if L <= index and index + 1 <= R:
            count += 1
    print(count)


Fixed submission:
N, Q = map(int, input().split())
S = input()

ACindex = []
index = 0
while (True):
    index = S.find("AC", index)
    if index == -1:
        break
    ACindex.append(index)
    index += 2
# print(ACindex)

ACs = []
num_of_AC = 0
pre = -1
for i in ACindex:
    ACs += [num_of_AC]*(i-pre)
    num_of_AC += 1
    pre = i

ACs += [num_of_AC]*(N-1-pre)

for i in range(Q):
    L, R = map(int, input().split())
    L -= 1
    R -= 1
    count = ACs[R]-ACs[L]
    print(count)
# print(ACs)
Buggy python submission (verdict: Runtime Error):
import bisect


def mizuyari(flowers):
    if flowers == []:
        return 0
    # print(flowers)
    minheight = min(flowers)
    if minheight == 0:
        if max(flowers) == 0:
            return 0
        leftindex = flowers.index(0)
        # print("分割"+str(leftindex)+" "+str(rightindex))
        count = mizuyari(flowers[0:leftindex])+mizuyari(flowers[leftindex:])
        return count
    else:
        count = mizuyari([i - minheight for i in flowers]) + minheight
        return count


N = int(input())
h_list = list(map(int, input().split()))

print(mizuyari(h_list))


Fixed submission:
import bisect


def mizuyari(flowers):
    if flowers == []:
        return 0
    # print(flowers)
    minheight = min(flowers)
    if minheight == 0:
        if max(flowers) == 0:
            return 0
        leftindex = flowers.index(0)
        # print("分割" + str(leftindex))
        if leftindex == len(flowers):
            count = mizuyari(flowers[0:leftindex])
        else:
            count = mizuyari(flowers[0:leftindex]) + \
                mizuyari(flowers[leftindex+1:])

        return count
    else:
        count = mizuyari([i - minheight for i in flowers]) + minheight
        return count


N = int(input())
h_list = list(map(int, input().split()))

print(mizuyari(h_list))
Buggy python submission (verdict: Runtime Error):
def sort(str):
  return ''.join(sorted(str))

i = int(input())
alpha = input()
x = sort(alpha[i:])
y = sort(alpha[:i])
if x.endswith("Z"):
	print(x + "A" + y)
else :
	print(x + y)

Fixed submission:
list = {'SUN':'7','MON':'6','TUE':'5','WED':'4','THU':'3','FRI':'2','SAT':'1'}
print(list[input()])
Buggy python submission (verdict: Time Limit Exceeded):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    for i in range(1,n):
            print(l[i-1:].count(i))
    print(0)
resolve()

Fixed submission:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    ll=[0]*n
    for i in range(n-1):
        ll[l[i]-1]+=1
    for i in ll:
        print(i)
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    for i in range(1,n+1):
        print(l.count(i))
resolve()

Fixed submission:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    ll=[0]*n
    for i in range(n-1):
        ll[l[i]-1]+=1
    for i in ll:
        print(i)
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    for i in range(1,n+1):
        print(l.count(i))
resolve()

Fixed submission:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    ll=[0]*n
    for i in range(n-1):
        ll[l[i]-1]+=1
    for i in ll:
        print(i)
resolve()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    check=[0]*n
    for i in l:
        check[i-1]+=1
    for j in l:
        cnt=0
        check[j-1]-=1
        for k in check:
            if k>=2:
                cnt+=k*(k-1)//2
        print(cnt)
        check[j-1]+=1
resolve()

Fixed submission:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    l=list(map(int,input().split()))
    from collections import Counter
    c=Counter(l)# ()にカウンターの対象のリストの変数名
    cnt=0
    for i in c.values():
        if i>=2:
            cnt+=i*(i-1)//2
    for j in l:
        x=(c[j]-1)*(c[j]-2)//2-c[j]*(c[j]-1)//2
        print(cnt+x)
resolve()
Buggy python submission (verdict: Runtime Error):
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """2 3 1
3 3
3 3 3
1 2 1"""
        output = """5"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1 1 2
10
10
1 1 5
1 1 10"""
        output = """10"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """2 2 1
3 5
3 5
2 2 2"""
        output = """6"""
        self.assertIO(input, output)

if __name__ == "__main__":
    unittest.main()

Fixed submission:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b,m=map(int, input().split())
    la=list(map(int,input().split()))
    lb=list(map(int,input().split()))
    lm=[list(map(int,input().split())) for i in range(m)]
    nowari=min(la)+min(lb)
    warians=10**10
    for i in range(m):
        wari=la[(lm[i][0])-1]+lb[(lm[i][1])-1]-lm[i][2]
        if wari<warians:
            warians=wari
    print(min(nowari,warians))
resolve()
Buggy python submission (verdict: Runtime Error):
def resolve():
    l=[list(map(int, input().split()) )for i in range(3)]
    n=int(input())
    b=[int(input()) for i in range(n)]
    bingo='No'
    for i in range(3):
        if l[i][0] in b and l[i][1] in b and l[i][2] in b:
           bingo='Yes'
        if l[0][i] in b and l[1][i] in b and l[2][i] in b:
            bingo='Yes'
    if (l[0][0] in b and l[1][1] in b and l[2][2] in b) or (l[2][0] in b and l[[1][1] in b and l[0][2] in b]):
        bingo='Yes'
    print(bingo)
resolve()

Fixed submission:
def resolve():
    a11,a12,a13=map(int, input().split())
    a21,a22,a23=map(int, input().split())
    a31,a32,a33=map(int, input().split())
    n=int(input())
    lyo1=[a11,a12,a13]
    lyo2=[a21,a22,a23]
    lyo3=[a31,a32,a33]
    lta1=[a11,a21,a31]
    lta2=[a12,a22,a32]
    lta3=[a13,a23,a33]
    lna1=[a11,a22,a33]
    lna2=[a13,a22,a31]
    yo1=0
    yo2=0
    yo3=0
    ta1=0
    ta2=0
    ta3=0
    na1=0
    na2=0
    b=[int(input()) for i in range(n)]
    for x in range(n):
        if b[x] in lyo1:
            yo1+=1
        if b[x] in lyo2:
            yo2+=1
        if b[x] in lyo3:
            yo3+=1
        if b [x] in lta1:
            ta1+=1
        if b[x] in lta2:
            ta2+=1
        if b[x] in lta3:
            ta3+=1
        if b[x] in lna1:
            na1+=1
        if b[x] in lna2:
            na2+=1

    if yo1==3 or yo2==3 or yo3==3 or ta1==3 or ta2==3 or ta3==3 or na1==3 or na2==3:
        print('Yes')
    else:
        print('No')
resolve()
Buggy python submission (verdict: Runtime Error):
import sys
def input(): return sys.stdin.readline().strip()
from collections import Counter
def resolve():
    n=int(input())
    l=[input() for i in range(n)]
    l.sort()
    c=Counter(l)
    maxl=[]
    syutugenmax=max(c.values())
    for name,kazu in c.items():
        if kazu==syutugenmax:
            maxl.append(name)
    maxl.sort()
    for i in maxl:
        print(i)
resolve()

Fixed submission:
a,b,c=map(int,input().split())
if a==b!=c:
    print('Yes')
elif a==c!=b:
    print('Yes')
elif b==c!=a:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
import sys
def input(): return sys.stdin.readline().strip()
from collections import Counter
def resolve():
    n=int(input())
    l=[input() for i in range(n)]
    l.sort()
    setl = list(set(l))
    setl.sort()
    cntl=[]
    prev=l[0]
    cnt=0
    for j in range(len(l)):
        if l[j]!=prev:
            cntl.append(cnt)
            prev=l[j]
            cnt=1
            if j==n-1:
                cntl.append(cnt)
        else:
            cnt+=1
            if j==n-1:
                cntl.append(cnt)
    for i in range(len(setl)):
        if cntl[i]==max(cntl):
            print(setl[i])
resolve()

Fixed submission:
from collections import Counter
def resolve():
    n=int(input())
    l=[input() for i in range(n)]
    c=Counter(l)
    maxl=[]
    cntmax=max(c.values())
    for name,kazu in c.items():
        if kazu==cntmax:
            maxl.append(name)
    maxl.sort()
    for i in maxl:
        print(i)
resolve()

Buggy python submission (verdict: Runtime Error):
import sys
def input(): return sys.stdin.readline().strip()
from collections import Counter
def resolve():
    n=int(input())
    l=[input() for i in range(n)]
    l.sort()
    setl = list(set(l))
    setl.sort()
    c=Counter(l)
    ll=[*c.values()]
    for i in range(len(setl)):
        if ll[i]==max(ll):
            print(setl[i])
resolve()

Fixed submission:
from collections import Counter
def resolve():
    n=int(input())
    l=[input() for i in range(n)]
    c=Counter(l)
    maxl=[]
    cntmax=max(c.values())
    for name,kazu in c.items():
        if kazu==cntmax:
            maxl.append(name)
    maxl.sort()
    for i in maxl:
        print(i)
resolve()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n,k=map(int, input().split())
    l=list(map(int,input().split()))
    cnt=0
    lans=[]
    for i in range(n-k+1):
        if cnt<sum(l[i:i+k]):
          cnt=sum(l[i:i+k])
          lans=l[i:i+k]
    ans=0
    for j in lans:
        ans+=(0.5*j*(1+j))/j
    print(ans)
resolve()

Fixed submission:
import sys


def input(): return sys.stdin.readline().strip()


def resolve():
    n, k = map(int, input().split())
    from itertools import accumulate
    A = list(map(int, input().split()))
    B = [0] + A
    B = list(accumulate(B))  # 累積和を格納したリスト作成
    num=0
    val=0
    # この問題は長さが1-Nの連続部分の和の最大値を出せというものなので以下の通り
    for i in range(k, n + 1):
        if B[i]-B[i-k]>val:
            val=B[i]-B[i-k]
            num=i

    ans = 0
    for j in A[num-k:num]:
        ans += (0.5 * j * (1 + j)) / j
    print(ans)
resolve()
Buggy python submission (verdict: Runtime Error):
def input(): return sys.stdin.readline().strip()

def resolve():
    x=int(input())
    ans=x
    while True:
        flag=False
        for i in range(2,int(x**0.5)):
            if ans%i==0:
                flag=True
                break
        if flag:
            ans+=1
            continue
        else:
            break
    print(ans)
resolve()

Fixed submission:
s,t=input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
    x=int(input())
    ans=x
    while True:
        flag=False
        for i in range(2,int(x**0.5)):
            if ans%i==0:
                flag=True
                break
        if flag:
            ans+=1
            continue
        else:
            break
    print(ans)
resolve()

Fixed submission:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    x=int(input())
    ans=x
    while True:
        flag=False
        for i in range(2,int(x**0.5)):
            if ans%i==0:
                flag=True
                break
        if flag:
            ans+=1
            continue
        else:
            break
    print(ans)
resolve()
Buggy python submission (verdict: Runtime Error):
import sys
def input(): return sys.stdin.readline().strip()
import math
def resolve():
    a,b=map(int, input().split())
    print((a*b)//math.gcd(a,b))
resolve()


Fixed submission:
import sys


def input(): return sys.stdin.readline().strip()


import fractions


def resolve():
    a, b = map(int, input().split())
    print((a * b) // fractions.gcd(a, b))
resolve()

Buggy python submission (verdict: Runtime Error):
import sys
def input(): return sys.stdin.readline().strip()
import math
def resolve():
    a,b=map(int, input().split())
    print(a*b//math.gcd(a,b))
resolve()

Fixed submission:
import sys


def input(): return sys.stdin.readline().strip()


import fractions


def resolve():
    a, b = map(int, input().split())
    print((a * b) // fractions.gcd(a, b))
resolve()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    def prime_factorize1(N):
        """
        Nをくって、Nの素因数を格納したリストresを返す。
        リストの要素をすべて掛ければNになる"""
        res = []
        x = N
        y = 2
        while y*y <= x:
            while x % y == 0:
                res.append(y)
                x //= y
            y += 1
        if x > 1:
            res.append(x)
        return res
    if n%2==1:
        print(0)
    elif n<10:
        print(0)
    else:
        ans=0
        for i in range(1,n//10+1):
            x=i*10
            from collections import Counter
            c=Counter(prime_factorize1(x))# ()にカウンターの対象のリストの変数名
            ans+=c[5]
        print(ans)
resolve()

Fixed submission:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    if n%2==1:
        print(0)
    elif n<10:
        print(0)
    else:
        ans=0
        for i in range(1,1000000):
            y=5**i
            num=(n//y)//2
            if num==0:
                break
            else:
                ans+=num
        print(ans)
resolve()
Buggy python submission (verdict: Runtime Error):
import math
def resolve():
    n=int(input())
    ans=(':(')
    for i in range(1,n+1):
        if math.floor(i*1.08)==n:
            ans=i
    print(ans)
resolve()


Fixed submission:
def resolve():
    m1,d1=map(int, input().split())
    m2,d2=map(int, input().split())
    if m2==m1+1 and d2==1:
        print('1')
    elif m1==12 and m2==1 and d2==1:
        print('1')
    else:
        print('0')
resolve()