problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02833
|
n = int(input())
if n % 2:
print(0)
else:
ans = 0
i = 1
while (2 * (5 ** i)) < n:
ans += n // (2 * (5 ** i))
i += 1
print(ans)
|
n = int(input())
if n % 2:
print(0)
else:
ans = 0
i = 1
while (2 * (5 ** i)) <= n:
ans += n // (2 * (5 ** i))
i += 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,603
| 635,604
|
u134019875
|
python
|
p02833
|
n=int(input())
if n%2==1:print(0)
else:
ans=0
for i in range(1,26):
ans+= n//(10**i)
print(ans)
|
n=int(input())
if n%2==1:print(0)
else:
ans=0
for i in range(100):
ans+= n//(10*5**i)
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 635,614
| 635,615
|
u023229441
|
python
|
p02833
|
n=int(input())
if n%2==1:print(0)
else:
ans=0
for i in range(1,26):
ans+= n//(5**i)
print(ans)
|
n=int(input())
if n%2==1:print(0)
else:
ans=0
for i in range(100):
ans+= n//(10*5**i)
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 635,616
| 635,615
|
u023229441
|
python
|
p02833
|
N=int(input())
S=2
ans=0
if N%2==1:
print(0)
else:
for i in range(1,26):
ans+=N//(2*(5**i))
print(ans)
|
N=int(input())
S=2
ans=0
if N%2==1:
print(0)
exit()
else:
for i in range(1,26):
ans+=N//(2*(5**i))
print(ans)
|
[
"call.add"
] | 635,636
| 635,637
|
u188745744
|
python
|
p02833
|
# coding: utf-8
# hello worldと表示する
#dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
n=I()
ans=0
if n%2==1:
ans=0
else:
for i in range(40):
ans+=floor(n/(2*5**(i+1)))
print(ans)
|
# coding: utf-8
# hello worldと表示する
#dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
n=I()
ans=0
if n%2==1:
ans=0
else:
for i in range(40):
ans+=(n//(2*5**(i+1)))
print(ans)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 635,648
| 635,649
|
u029000441
|
python
|
p02833
|
N = int(input())
if N < 2 or N % 2 == 1:
print(0)
exit()
res = 0
de = 10
while de < N + 1:
res += int(N / de)
de *= 5
print(res)
|
N = int(input())
if N < 2 or N % 2 == 1:
print(0)
exit()
res = 0
de = 10
while de < N + 1:
res += N // de
de *= 5
print(res)
|
[
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 635,668
| 635,669
|
u329319441
|
python
|
p02833
|
n = int(input())
if n%2:print(0)
two = 0
five = 0
val = 2
while val<=n:
two+=n//val
val *= 2
val = 5
while val<=n:
five +=(n//val)//2
val *=5
print(min(two,five))
|
n = int(input())
if n%2:print(0);exit()
two = 0
five = 0
val = 2
while val<=n:
two+=n//val
val *= 2
val = 5
while val<=n:
five +=(n//val)//2
val *=5
print(min(two,five))
|
[] | 635,679
| 635,680
|
u800396927
|
python
|
p02833
|
import sys
n = int(input())
# 奇数始まりは必ず0
if n % 2 == 1:
print(0)
sys.exit()
# 5の因子を数える
# 5の倍数は10個ごと、25の倍数は50個ごと、125の倍数は250個ごとに登場する
ans = 0
cnt = 1
while 5**cnt * 2 < n:
ans += n // (5**cnt * 2)
cnt += 1
print(ans)
|
import sys
n = int(input())
# 奇数始まりは必ず0
if n % 2 == 1:
print(0)
sys.exit()
# 5の因子を数える
# 5の倍数は10個ごと、25の倍数は50個ごと、125の倍数は250個ごとに登場する
ans = 0
cnt = 1
while 5**cnt * 2 <= n:
ans += n // (5**cnt * 2)
cnt += 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,695
| 635,696
|
u860002137
|
python
|
p02833
|
import sys
n = int(input())
# 奇数始まりと10未満は必ず0
if n % 2 == 1 or n < 10:
print(0)
sys.exit()
# 5の因子を数える
# 5の倍数は10個ごと、25の倍数は50個ごと、125の倍数は250個ごとに登場する
ans = 0
cnt = 1
while 5**cnt * 2 < n:
ans += n // (5**cnt * 2)
cnt += 1
print(ans)
|
import sys
n = int(input())
# 奇数始まりは必ず0
if n % 2 == 1:
print(0)
sys.exit()
# 5の因子を数える
# 5の倍数は10個ごと、25の倍数は50個ごと、125の倍数は250個ごとに登場する
ans = 0
cnt = 1
while 5**cnt * 2 <= n:
ans += n // (5**cnt * 2)
cnt += 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,697
| 635,696
|
u860002137
|
python
|
p02833
|
import math
N = int(input())
ans = 0
if N == 0 or N % 2 == 1:
ans = 0
else:
# means N >= 2 and even
digN = round( math.log(N , 10) )
i = 1
while i <= digN:
ans += ( N // ( 10 ** i ) )
i += 1
print(ans)
|
import math
N = int(input())
ans = 0
if N == 0 or N % 2 == 1:
ans = 0
else:
# means N >= 2 and even
digN = round( math.log(N , 5) )
i = 1
while i <= digN:
ans += ( N //( 5 ** i * 2 ) )
i += 1
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 635,710
| 635,711
|
u804800128
|
python
|
p02833
|
n = int(input())
if n%2 != 0:
print(0)
else:
ans = 0
dum = 5
while n > dum:
ans += (n//dum)*(1/2)
dum = dum*5
print(ans)
|
n = int(input())
if n%2 != 0:
print(0)
else:
ans = 0
dum = 5
while n > dum:
ans += (n//dum)//2
dum = dum*5
print(ans)
|
[
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 635,712
| 635,713
|
u482157295
|
python
|
p02833
|
def calculate(n):
if n % 2 == 1:
return
s1 = n // 10
index = 1
s2 = 0
while (5 ** index) <= s1:
s2 += (s1 // (5 ** index))
index += 1
return s1 + s2
print(calculate(int(input())))
|
def calculate(n):
if n % 2 == 1:
return 0
s1 = n // 10
index = 1
s2 = 0
while (5 ** index) <= s1:
s2 += (s1 // (5 ** index))
index += 1
return s1 + s2
print(calculate(int(input())))
|
[
"function.return_value.change"
] | 635,730
| 635,731
|
u769331063
|
python
|
p02833
|
N = int(input())
if (N%2 == 1):
print(0)
elif N == 0:
print(0)
else:
N /= 2
res = 0
div_coef = 1
while True:
# print(N)
tmp_add = N // (5 ** div_coef)
res += int(tmp_add)
div_coef += 1
if tmp_add < 1:
break
# print(N)
print(int(res))
|
N = int(input())
if (N%2 == 1):
print(0)
elif N == 0:
print(0)
else:
N //= 2
res = 0
div_coef = 1
while True:
tmp_add = N // (5 ** div_coef)
res += int(tmp_add)
div_coef += 1
# print(int(tmp_add))
if tmp_add < 1:
break
# print(N)
print(int(res))
|
[
"expression.operator.change"
] | 635,744
| 635,745
|
u102902647
|
python
|
p02833
|
N = int(input())
if (N%2 == 1):
print(0)
elif N == 0:
print(1)
else:
N /= 2
res = 0
div_coef = 1
while True:
# print(N)
tmp_add = N // (5 ** div_coef)
res += int(tmp_add)
div_coef += 1
if tmp_add < 1:
break
# print(N)
print(int(res))
|
N = int(input())
if (N%2 == 1):
print(0)
elif N == 0:
print(0)
else:
N //= 2
res = 0
div_coef = 1
while True:
tmp_add = N // (5 ** div_coef)
res += int(tmp_add)
div_coef += 1
# print(int(tmp_add))
if tmp_add < 1:
break
# print(N)
print(int(res))
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change",
"expression.operator.change"
] | 635,746
| 635,745
|
u102902647
|
python
|
p02833
|
N = int(input())
n = 0
if not N%2:
s = 5
N = N//2
while N>s:
n += N//s
s *= 5
print(n)
|
N = int(input())
n = 0
if not N%2:
s = 5
N = N//2
while N>=s:
n += N//s
s *= 5
print(n)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,747
| 635,748
|
u570236974
|
python
|
p02833
|
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
ans = 0
if N%2==1:
print(0)
exit(0)
for i in range(1, 20):
cnt = N//(5**i)
ans += int(cnt/2)
print(ans)
|
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
ans = 0
if N%2==1:
print(0)
exit(0)
for i in range(1, 40):
cnt = N//(5**i)
ans += cnt//2
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.remove",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 635,761
| 635,762
|
u054514819
|
python
|
p02833
|
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(input())
if n%2 == 1:
print(0)
exit(0)
def count(k, n):
now = k
cnt = 0
while now < n:
cnt += n//now
now *= k
return cnt
n //= 2
cnt2 = n
cnt2 += count(2, n)
cnt5 = count(5, n)
ans = min(cnt2, cnt5)
print(ans)
if __name__ == '__main__':
main()
|
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(input())
if n%2 == 1:
print(0)
exit(0)
def count(k, n):
now = k
cnt = 0
while now <= n:
cnt += n//now
now *= k
return cnt
n //= 2
cnt2 = n
cnt2 += count(2, n)
cnt5 = count(5, n)
ans = min(cnt2, cnt5)
print(ans)
if __name__ == '__main__':
main()
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,770
| 635,771
|
u266014018
|
python
|
p02833
|
def main():
n = int(input())
if n%2==1:
print(0)
return
md = 10
cnt = 0
while n>md:
cnt += n//md
md = md*5
print(cnt)
if __name__ == "__main__":
main()
|
def main():
n = int(input())
if n%2==1:
print(0)
return
md = 10
cnt = 0
while n>=md:
cnt += n//md
md = md*5
print(cnt)
if __name__ == "__main__":
main()
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,774
| 635,775
|
u546338822
|
python
|
p02833
|
n = int(input())
# Lv.1
#def f(t):
# return 1 if t < 2 else t * f(t-2)
#print(f(n))
# Lv.2
# def g(p):
# d = {2:0, 5:0}
# for i in range(p, 1, -2):
# t = i
# while(t % 2 == 0):
# t //= 2
# d[2] += 1
# while(t % 5 == 0):
# t //= 5
# d[5] += 1
# return min(d[2], d[5])
# print(g(n))
# Lv.3
# 1,3,5,7,... 末尾は奇数
# 2,4,6,8,... Lv.2 の print(min(d[2], d[5])) は 5の方が常にmin
# 100 の時 10 で割れるのが10, 50で割れるのが2つ
# 250 の時 10 で割れるのが25, 50で割れるのが5つ, 250 で割れるのが1つ 1000個位出してみたら ? 整数分割の + - 交互のあれでは無いっぽい
k = 10
ans = 0
while k < n:
ans += n // k
k = k * 5
print(ans if n % 2 == 0 else 0)
|
n = int(input())
# Lv.1
#def f(t):
# return 1 if t < 2 else t * f(t-2)
#print(f(n))
# Lv.2
# def g(p):
# d = {2:0, 5:0}
# for i in range(p, 1, -2):
# t = i
# while(t % 2 == 0):
# t //= 2
# d[2] += 1
# while(t % 5 == 0):
# t //= 5
# d[5] += 1
# return min(d[2], d[5])
# print(g(n))
# Lv.3
# 1,3,5,7,... 末尾は奇数
# 2,4,6,8,... Lv.2 の print(min(d[2], d[5])) は 5の方が常にmin
# 100 の時 10 で割れるのが10, 50で割れるのが2つ
# 250 の時 10 で割れるのが25, 50で割れるのが5つ, 250 で割れるのが1つ 1000個位出してみたら ? 整数分割の + - 交互のあれでは無いっぽい
k = 10
ans = 0
while k <= n:
ans += n // k
k = k * 5
print(ans if n % 2 == 0 else 0)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,778
| 635,779
|
u938486382
|
python
|
p02833
|
N = int(input())
M = 10
ans = 0
if N % 2 == 0:
while N > M:
ans += N//M
M *= 5
print(ans)
|
N = int(input())
M = 10
ans = 0
if N % 2 == 0:
while N >= M:
ans += N//M
M *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,792
| 635,793
|
u559126797
|
python
|
p02833
|
N = int(input())
count = 0
if N%2==1:
print(0)
exit()
powNum = 1
while 2*pow(5,powNum) < N:
count += N//(2*pow(5,powNum))
powNum+=1
print(count)
|
N = int(input())
count = 0
if N%2==1:
print(0)
exit()
powNum = 1
while 2*pow(5,powNum) <= N:
count += N//(2*pow(5,powNum))
powNum+=1
print(count)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,825
| 635,826
|
u364862909
|
python
|
p02833
|
N = int(input())
if N % 2 == 1:
print(0)
else:
# i = 5 で始めると奇数が入る
i = 10
result = 0
while N > i:
result += N//i
i *= 5
print(result)
|
N = int(input())
if N % 2 == 1:
print(0)
else:
i = 10
result = 0
while N >= i:
result += N//i
i *= 5
print(result)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,845
| 635,846
|
u517447467
|
python
|
p02833
|
N = int(input())
ans = 0
if N % 2 == 1:
print(ans)
else:
for i in range(1, 20):
a = N // (2 * (5**i))
ans += a
if a == 0:
break
print(ans)
|
N = int(input())
ans = 0
if N % 2 == 1:
print(ans)
else:
for i in range(1, 10000):
a = N // (2 * (5**i))
ans += a
if a == 0:
break
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 635,854
| 635,855
|
u038021590
|
python
|
p02833
|
n = int(input())
if (n % 2) != 0:
print(0)
else:
ans = 0
k = 0
m = len(str(n))
while( n > 10*(5**k)):
ans += (n//(10*(5**k)))
k+=1
print(ans)
|
n = int(input())
if (n % 2) != 0:
print(0)
else:
ans = 0
k = 0
m = len(str(n))
while( n >= 10*(5**k)):
ans += (n//(10*(5**k)))
k+=1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,856
| 635,857
|
u572012241
|
python
|
p02833
|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(input())
if n%2==1:
print(0)
else:
N=n//2
cnt=0
while N>=5:
cnt+=N//5
N/=5
print(int(cnt))
resolve()
|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(input())
if n%2==1:
print(0)
else:
N=n//2
cnt=0
while N>=5:
cnt+=N//5
N//=5
print(int(cnt))
resolve()
|
[
"expression.operator.change"
] | 635,858
| 635,859
|
u992910889
|
python
|
p02833
|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(input())
if n%2==1:
print(0)
else:
N=n//2
cnt=0
while N>=1:
cnt+=N//5
N/=5
print(int(cnt))
resolve()
|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(input())
if n%2==1:
print(0)
else:
N=n//2
cnt=0
while N>=5:
cnt+=N//5
N//=5
print(int(cnt))
resolve()
|
[
"literal.number.integer.change",
"control_flow.loop.condition.change",
"expression.operator.change"
] | 635,860
| 635,859
|
u992910889
|
python
|
p02833
|
def main():
N=int(input())
if N%2!=0:
print(0)
k=10
ans=0
while(k<=N):
ans+=N//k
k*=5
print(ans)
if __name__=="__main__":
main()
|
def main():
N=int(input())
if N%2!=0:
print(0)
exit()
k=10
ans=0
while(k<=N):
ans+=N//k
k*=5
print(ans)
if __name__=="__main__":
main()
|
[
"call.add"
] | 635,869
| 635,870
|
u764860452
|
python
|
p02833
|
N = int(input())
if N % 2 == 1:
ans = 0
else:
count = 1
num5 = 0
while N//2 >= 5**count:
num5 += N//(2*5**count)
count+=1
print(num5)
|
N = int(input())
if N % 2 == 1:
ans = 0
else:
count = 1
ans = 0
while N//2 >= 5**count:
ans += N//(2*5**count)
count+=1
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 635,881
| 635,882
|
u357949405
|
python
|
p02833
|
n=int(input())
if n%2==1:
print(0)
else:
ans=0
k=10
while k<=n:
ans+=n//k
k=k*10
print(ans)
|
n=int(input())
if n%2==1:
print(0)
else:
ans=0
k=10
while k<=n:
ans+=n//k
k=k*5
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 635,892
| 635,893
|
u046158516
|
python
|
p02833
|
n = int(input())
ans = 0
if n % 2 != 0:
print(ans)
else:
m = n // 2
e = 1
while 5 ** e < m:
ans += m // (5 ** e)
e += 1
print(ans)
|
n = int(input())
ans = 0
if n % 2 != 0:
print(ans)
else:
m = n // 2
e = 1
while 5 ** e <= m:
ans += m // (5 ** e)
e += 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,902
| 635,903
|
u079182025
|
python
|
p02833
|
n = int(input())
print(n)
if (n % 2 == 1):
print(0)
else:
ans = 0
d = 10
while d <= n:
ans += n // d
d *= 5
print(ans)
|
n = int(input())
if (n % 2 == 1):
print(0)
else:
ans = 0
d = 10
while d <= n:
ans += n // d
d *= 5
print(ans)
|
[
"call.remove"
] | 635,908
| 635,909
|
u130335779
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
div = 10
while div < n:
ans += n // div
div *= 5
print(ans)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
div = 10
while div <= n:
ans += n // div
div *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,910
| 635,911
|
u322297639
|
python
|
p02833
|
###### Importing Libraries ######
import math
import operator as op
from functools import reduce
from fractions import Fraction as frac
#################################
##### User defined function #####
############ NCR ###############
def ncr(n, r):
r = min(r, n-r)
numer = reduce(op.mul, range(n, n-r, -1), 1)
denom = reduce(op.mul, range(1, r+1), 1)
return numer / denom
############ READ ###############
def rd(p):
if(p==0):
return input()
if(p==1):
return int(input())
if(p==2):
return map(int,input().split())
if(p==3):
return list(map(int,input().split()))
############ DSU ###############
global par
par=[-1 for i in range(100001)]
# t=rd(1)
def find(u):
if(par[u]<0):
return u
else:
return find(par[u])
def uni(x,y):
u=find(x)
v=find(y)
if u==v:
return
if(par[u]<par[v]):
par[u]+=par[v]
par[v]=u
else:
par[v]+=par[u]
par[u]=v
################################
t=1
for term in range(1,t+1):
n=rd(1)
div=10
tot=0
if n%2==1:
print(0)
else:
while(n>div):
# print(n//div)
tot+=(n//div)
div*=5
print(tot)
|
###### Importing Libraries ######
import math
import operator as op
from functools import reduce
from fractions import Fraction as frac
#################################
##### User defined function #####
############ NCR ###############
def ncr(n, r):
r = min(r, n-r)
numer = reduce(op.mul, range(n, n-r, -1), 1)
denom = reduce(op.mul, range(1, r+1), 1)
return numer / denom
############ READ ###############
def rd(p):
if(p==0):
return input()
if(p==1):
return int(input())
if(p==2):
return map(int,input().split())
if(p==3):
return list(map(int,input().split()))
############ DSU ###############
global par
par=[-1 for i in range(100001)]
# t=rd(1)
def find(u):
if(par[u]<0):
return u
else:
return find(par[u])
def uni(x,y):
u=find(x)
v=find(y)
if u==v:
return
if(par[u]<par[v]):
par[u]+=par[v]
par[v]=u
else:
par[v]+=par[u]
par[u]=v
################################
t=1
for term in range(1,t+1):
n=rd(1)
div=10
tot=0
if n%2==1:
print(0)
else:
while(n>=div):
# print(n//div)
tot+=(n//div)
div*=5
print(tot)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,927
| 635,928
|
u954774382
|
python
|
p02833
|
N = int(input())
if N % 2 == 1:
print(0)
#quit()
N //= 2
res = 0
i = 0
while (5 ** i) <= N:
#print(N)
i += 1
res += N // (5 ** i)
print(res)
|
N = int(input())
if N % 2 == 1:
print(0)
quit()
N //= 2
res = 0
i = 0
while (5 ** i) <= N:
#print(N)
i += 1
res += N // (5 ** i)
print(res)
|
[
"call.add"
] | 635,940
| 635,941
|
u038408819
|
python
|
p02833
|
# E - Double Factorial
N = int(input())
ans = 0
p = 10
if (N%2):
continue
else:
while True:
if p > N:
break
ans += N // p
p *= 5
print(ans)
|
# E - Double Factorial
N = int(input())
ans = 0
p = 10
if (N%2==0):
while True:
if p > N:
break
ans += N // p
p *= 5
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 635,961
| 635,962
|
u141786930
|
python
|
p02833
|
nt(input())
if n%2 == 0:
num=10
c=0;
while num <= n:
c += (n//num)
num *= 5
print(c)
else:
print(0)
|
p=int(input())
n=p
if n%2 == 0:
num=10
c=0;
while num <= n:
c += (n//num)
num *= 5
print(c)
else:
print(0)
|
[
"assignment.variable.change"
] | 635,963
| 635,964
|
u863370423
|
python
|
p02833
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
p= int(readline())
if p % 2 == 1:
print(0)
else:
p //= 2
ans = 0
while n:
p //= 5
ans += p
print(ans)
|
import sys
import math
import numpy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
p = int(readline())
if p % 2 == 1:
print(0)
else:
p //= 2
ans = 0
while p:
p //= 5
ans += p
print(ans)
|
[
"identifier.change",
"control_flow.loop.condition.change"
] | 635,967
| 635,966
|
u018679195
|
python
|
p02833
|
N = int(input())
if N%2 == 1:
print(0)
else:
ans = 0
op = 10
while N >= op:
ans = ans + int(N/op)
op = op * 5
print(ans)
|
N = int(input())
if N%2 == 1:
print(0)
else:
ans = 0
op = 10
while N >= op:
ans = ans + N//op
op = op * 5
print(ans)
|
[
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 635,972
| 635,973
|
u268183312
|
python
|
p02833
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
fact = 10 *(5 ** i)
if fact<=N:
ans+=int(N/fact)
else:
break
print(int(ans))
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
fact = 10 *(5 ** i)
if fact<=N:
ans+=int(N//fact)
else:
break
print(int(ans))
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 635,989
| 635,990
|
u497952650
|
python
|
p02833
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
fact = 10 *(5 ** i)
if fact<=N:
ans+=int(N/fact)
else:
break
print(int(ans))
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
fact = 10 *(5 ** i)
if fact<=N:
ans+= (N//fact)
else:
break
print(int(ans))
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 635,989
| 635,991
|
u497952650
|
python
|
p02833
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
if 10*(5**i)<N:
ans+=N//(10*(5**i))
else:
break
print(int(ans))
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
if 10*(5**i)<=N:
ans+=N//(10*(5**i))
else:
break
print(int(ans))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 635,993
| 635,994
|
u497952650
|
python
|
p02833
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
if 10*(5**i)<N:
ans+=N//(10*(5**i))
else:
break
print(ans)
|
N = int(input())
ans = 0
if N%2 == 0:
for i in range(100000000000):
if 10*(5**i)<=N:
ans+=N//(10*(5**i))
else:
break
print(int(ans))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 635,995
| 635,994
|
u497952650
|
python
|
p02833
|
N=int(input())
if N%2==1:
print(0)
exit()
ans=0
tmp=10
while(N>tmp):
a=N//tmp
ans+=a
tmp=tmp*5
print(ans)
|
N=int(input())
if N%2==1:
print(0)
exit()
ans=0
tmp=10
while(N>=tmp):
a=N//tmp
ans+=a
tmp=tmp*5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 635,998
| 635,999
|
u434872492
|
python
|
p02833
|
n = int(input())
if n & 2 != 0:
ans = 0
else:
ans = 0
n //= 2
while n:
ans += n // 5
n //= 5
print(ans)
|
n = int(input())
if n % 2 != 0:
ans = 0
else:
ans = 0
n //= 2
while n:
ans += n // 5
n //= 5
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 636,005
| 636,006
|
u197968862
|
python
|
p02833
|
n = int(input())
result = 0
if n % 2 != 1:
fexp = 0
for i in range(1, n):
fexp = 5 ** i * 2
if fexp > n:
break
result += int(n / fexp)
print(result)
|
n = int(input())
result = 0
if n % 2 != 1:
fexp = 0
for i in range(1, n):
fexp = 5 ** i * 2
if fexp > n:
break
result += n // fexp
print(result)
|
[
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,011
| 636,012
|
u103724957
|
python
|
p02833
|
N = int(input())
ans = 0
i = 1
if N % 2 == 1:
print(0)
exit()
while 2*(5**i) < N:
ans += N // (2*(5**i))
i += 1
print(ans)
|
N = int(input())
ans = 0
i = 1
if N % 2 == 1:
print(0)
exit()
while 2*(5**i) <= N:
ans += N // (2*(5**i))
i += 1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,019
| 636,020
|
u538632589
|
python
|
p02833
|
N = int(input())
if N % 2:
print(0)
else:
ans = 0
X = 10
while X<=N:
ans += int(N/X)
X *= 5
print(ans)
|
N = int(input())
if N % 2:
print(0)
else:
ans = 0
X = 10
while X<=N:
ans += int(N//X)
X *= 5
print(ans)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,021
| 636,022
|
u212786022
|
python
|
p02833
|
N = int(input())
if N % 2:
print(0)
else:
ans = 0
X = 10
while X<N:
ans += int(N/X)
X *=5
print(ans)
|
N = int(input())
if N % 2:
print(0)
else:
ans = 0
X = 10
while X<=N:
ans += int(N//X)
X *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,023
| 636,022
|
u212786022
|
python
|
p02833
|
n=int(input())
if n%2==1:print(0)
else:
sum=0
for i in range(1,18):
sum+=n//(10**i)
print(sum)
|
n=int(input())
if n%2==1:print(0)
else:
sum=0
for i in range(1,52):
sum+=(n//(2*5**i))
print(sum)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.change"
] | 636,024
| 636,025
|
u106778233
|
python
|
p02833
|
n = int(input())
if n%2:
print(0)
else:
tmp = 5
ans = 0
n //= 2
while tmp < n:
ans += n//tmp
tmp *= 5
print(ans)
|
n = int(input())
if n%2:
print(0)
else:
tmp = 5
ans = 0
n //= 2
while tmp <= n:
ans += n//tmp
tmp *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,039
| 636,040
|
u226191225
|
python
|
p02833
|
n = int(input())
if n%2:
print(0)
else:
tmp = 5
ans = 0
n //= 2
while tmp < n:
ans += n//tmp
tmp *= 5
print(ans)
|
n = int(input())
if n%2:
print(0)
else:
tmp = 5
ans = 0
n //= 2
while tmp <= n:
ans += n//tmp
tmp *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,041
| 636,040
|
u226191225
|
python
|
p02833
|
n=int(input())
if n%2 == 0:
num=10
c=0;
while num <= n:
c += int(n/num)
num *= 5
print(c)
else:
print(0)
|
n=int(input())
if n%2 == 0:
num=10
c=0;
while num <= n:
c += (n//num)
num *= 5
print(c)
else:
print(0)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,047
| 636,048
|
u444615925
|
python
|
p02833
|
n=int(input())
if n%2 ==0:
num=10
c=0;
while num <= n:
c += int(n/num)
num *= 5
print(int(c))
else:
print(0)
|
n=int(input())
if n%2 == 0:
num=10
c=0;
while num <= n:
c += (n//num)
num *= 5
print(c)
else:
print(0)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.remove"
] | 636,049
| 636,048
|
u444615925
|
python
|
p02833
|
n = int(input())
if n == 0:
ans = 0
elif n % 2 == 1:
ans = 0
else:
pwr = 10
ans = 0
while pwr < n:
ans += n // pwr
pwr *= 5
print(ans)
|
n = int(input())
if n == 0:
ans = 0
elif n % 2 == 1:
ans = 0
else:
pwr = 10
ans = 0
while pwr <= n:
ans += n // pwr
pwr *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,054
| 636,055
|
u500006160
|
python
|
p02833
|
n=int(input())
if n%2:
print(0)
exit()
else:
n=n//2
i=1
ans=0
while n>(5**i):
ans+=n//(5**i)
i+=1
print(ans)
|
n=int(input())
if n%2:
print(0)
exit()
n//=2
i=1
ans=0
while n>=(5**i):
ans+=n//(5**i)
i+=1
print(ans)
|
[
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,056
| 636,057
|
u573754721
|
python
|
p02833
|
n=int(input())
if n%2:
print(0)
exit()
n//=2
ans=0
i=1
while n>(5**i):
ans+=n//(5**i)
i+=1
print(ans)
|
n=int(input())
if n%2:
print(0)
exit()
n//=2
ans=0
i=1
while n>=(5**i):
ans+=n//(5**i)
i+=1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,058
| 636,059
|
u573754721
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
exit()
# 5の倍数で割り切れる回数
result = 0
i = 1
while True:
result += inp_n // ((5 ** i) * 2)
i += 1
if inp_n < ((5 ** i) * 2): break
# 結果出力
print(result)
|
n = int(input())
if n % 2 == 1:
print(0)
exit()
# 5の倍数で割り切れる回数
result = 0
i = 1
while True:
result += n // ((5 ** i) * 2)
i += 1
if n < ((5 ** i) * 2): break
# 結果出力
print(result)
|
[
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 636,060
| 636,061
|
u573754721
|
python
|
p02833
|
N = int(input())
ans = 0
if N % 2 == 0:
num = 5
temp_N = N/2
while num < temp_N:
ans += temp_N//num
num *= 5
print(int(ans))
|
N = int(input())
ans = 0
if N % 2 == 0:
num = 5
temp_N = N//2
while num <= temp_N:
ans += temp_N//num
num *= 5
print(int(ans))
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,064
| 636,065
|
u638033979
|
python
|
p02833
|
N = int(input())
ans = 0
if N % 2 == 0:
num = 5
temp_N = N/2
while num < temp_N:
ans += temp_N//num
num *= 5
print(ans)
|
N = int(input())
ans = 0
if N % 2 == 0:
num = 5
temp_N = N//2
while num <= temp_N:
ans += temp_N//num
num *= 5
print(int(ans))
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"call.add",
"call.arguments.change"
] | 636,066
| 636,065
|
u638033979
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
n = n//10
res = n
while n > 5:
n = n//5
res += n
print(res)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
n = n//10
res = n
while n >= 5:
n = n//5
res += n
print(res)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,067
| 636,068
|
u417589709
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
pow = 1
while 2*5**pow <= n:
ans += int(n / (2*5**pow))
pow += 1
print(ans)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
pow = 1
while 2*5**pow <= n:
ans += n // (2*5**pow)
pow += 1
print(ans)
|
[
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,101
| 636,102
|
u347600233
|
python
|
p02833
|
n = int(input())
ans = 0
if n%2==0:
n /= 2
fives = 5
while 1:
if fives > n:
break
ans += n // fives
fives *= 5
print(ans)
|
n = int(input())
ans = 0
if n % 2 == 0:
n = n // 2
fives = 5
while 1:
if fives > n:
break
ans += n // fives
fives *= 5
print(ans)
|
[
"assignment.value.change"
] | 636,109
| 636,108
|
u557565572
|
python
|
p02833
|
from math import log
N = int(input())
if N % 2 == 1:
print(0)
exit()
while N % 10 != 0:
N -= 1
answer = 0
x = 1
while N // (5**x) > 0:
answer += int((N//(5**x)) / 2)
x += 1
print(answer)
|
N = int(input())
if N % 2 == 1:
print(0)
exit()
while N % 10 != 0:
N -= 1
answer = 0
x = 1
while N // (5**x) > 1:
answer += int((N//(5**x)) // 2)
x += 1
print(answer)
|
[
"literal.number.integer.change",
"control_flow.loop.condition.change",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,118
| 636,119
|
u561083515
|
python
|
p02833
|
n = int(input())
ans = 0
if n % 2 == 1:
print(0)
exit()
for i in range(50):
if n>10*(5**(i)):
ans += n//(10*(5**(i)))
print(ans)
|
n = int(input())
ans = 0
if n % 2 == 1:
print(0)
exit()
for i in range(50):
if n >= 10*(5**(i)):
ans += n//(10*(5**(i)))
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 636,123
| 636,124
|
u738898077
|
python
|
p02833
|
def main():
n = int(input())
if n%2 == 1:
print(0)
return
ans = 0
n = n // 2
while n>5:
ans += n // 5
n = n // 5
print(ans)
if __name__ == '__main__':
main()
|
def main():
n = int(input())
if n%2 == 1:
print(0)
return
ans = 0
n = n // 2
while n>4:
ans += n // 5
n = n // 5
print(ans)
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"control_flow.loop.condition.change"
] | 636,125
| 636,126
|
u321035578
|
python
|
p02833
|
N = int(input())
if N % 2 == 1 or N < 10:
print(0)
else:
k = 10
total = 0
while N >= k:
total += N // k
k *= 10
print(total)
|
N = int(input())
if N % 2 == 1 or N < 10:
print(0)
else:
k = 10
total = 0
while N >= k:
total += N // k
k *= 5
print(total)
|
[
"literal.number.integer.change"
] | 636,144
| 636,145
|
u944643608
|
python
|
p02833
|
N = int(input())
if N % 2 == 1 or N < 10:
print(0)
else:
k = 10
total = 0
while N > k:
total += N // k
k *= 10
print(total)
|
N = int(input())
if N % 2 == 1 or N < 10:
print(0)
else:
k = 10
total = 0
while N >= k:
total += N // k
k *= 5
print(total)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.integer.change"
] | 636,146
| 636,145
|
u944643608
|
python
|
p02833
|
from math import factorial
N = int(input())
if N%2 == 0:
ans = 0
devisor = 10
while devisor < N:
ans += N//devisor
devisor *= 5
print(ans)
else:
print(0)
|
from math import factorial
N = int(input())
if N%2 == 0:
ans = 0
devisor = 10
while devisor <= N:
ans += N//devisor
devisor *= 5
print(ans)
else:
print(0)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,153
| 636,154
|
u038024401
|
python
|
p02833
|
n = int(input())
count = 0
i = 1
while True:
temp = 2 * (5 ** i)
count += n // temp
if temp > n:
break
else:
i += 1
print(count if n // 2 == 0 else 0)
|
n = int(input())
count = 0
i = 1
while True:
temp = 2 * (5 ** i)
count += n // temp
if temp > n:
break
else:
i += 1
print(count if n % 2 == 0 else 0)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 636,161
| 636,162
|
u167681750
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
n //= 2
ans = 0
while n > 5:
n //= 5
ans += n
print(ans)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
n //= 2
ans = 0
while n >= 5:
n //= 5
ans += n
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,163
| 636,164
|
u855393458
|
python
|
p02833
|
from collections import Counter
import sys
sys.setrecursionlimit(10 ** 6)
mod = 1000000007
inf = int(1e18)
dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]
def inverse(a):
return pow(a, mod - 2, mod)
def usearch(x, a):
lft = 0
rgt = len(a) + 1
while rgt - lft > 1:
mid = (rgt + lft) // 2
if a[mid] <= x:
lft = mid
else:
rgt = mid
return lft
def main():
n = int(input())
if n % 2 == 1:
print(-1)
return
ans = n // 10
for i in range(1, 32):
ans += n // (5**i*10)
print(ans)
main()
|
from collections import Counter
import sys
sys.setrecursionlimit(10 ** 6)
mod = 1000000007
inf = int(1e18)
dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]
def inverse(a):
return pow(a, mod - 2, mod)
def usearch(x, a):
lft = 0
rgt = len(a) + 1
while rgt - lft > 1:
mid = (rgt + lft) // 2
if a[mid] <= x:
lft = mid
else:
rgt = mid
return lft
def main():
n = int(input())
if n % 2 == 1:
print(0)
return
ans = n // 10
for i in range(1, 32):
ans += n // (5**i*10)
print(ans)
main()
|
[
"call.arguments.change",
"io.output.change",
"expression.operation.unary.remove"
] | 636,169
| 636,170
|
u702582248
|
python
|
p02833
|
def main():
n = int(input())
if n%1==0:
print(0)
return
ans = 0
bunbo = 10
while bunbo <= n:
ans += n // bunbo
bunbo *= 5
print(ans)
if __name__ == '__main__':
main()
|
def main():
n = int(input())
if n%2==1:
print(0)
return
ans = 0
bunbo = 10
while bunbo <= n:
ans += n // bunbo
bunbo *= 5
print(ans)
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 636,182
| 636,183
|
u185034753
|
python
|
p02833
|
def main():
n = int(input())
if n%2==0:
print(0)
return
ans = 0
bunbo = 10
while bunbo <= n:
ans += n // bunbo
bunbo *= 5
print(ans)
if __name__ == '__main__':
main()
|
def main():
n = int(input())
if n%2==1:
print(0)
return
ans = 0
bunbo = 10
while bunbo <= n:
ans += n // bunbo
bunbo *= 5
print(ans)
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 636,184
| 636,183
|
u185034753
|
python
|
p02833
|
x=int(input())
s=0
if x%2==0:
p=10
while(p<x):
s+=x//p
p*=5
print(s)
|
x=int(input())
s=0
if x%2==0:
p=10
while(p<=x):
s+=x//p
p*=5
print(s)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,204
| 636,205
|
u706984643
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
p = 1
t = 5
while t <= n:
p += 1
t *= 5
s = 0
for i in range(1,p):
s += n // (5 ** i)
print(s)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
p = 1
t = 5
n //= 2
while t <= n:
p += 1
t *= 5
s = 0
for i in range(1,p):
s += n // (5 ** i)
print(s)
|
[] | 636,212
| 636,213
|
u979126665
|
python
|
p02833
|
n = int(input())
ans = 0
if n % 2 != 0:
print(0)
exit()
denominator = 10
while n > denominator:
ans += n//denominator
denominator *= 5
print(ans)
|
n = int(input())
ans = 0
if n % 2 != 0:
print(0)
exit()
denominator = 10
while n >= denominator:
ans += n//denominator
denominator *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,233
| 636,234
|
u952467214
|
python
|
p02833
|
n = int(input())
if n % 2 == 0:
cnt = 0
denom = 10
while denom < n:
cnt += n // denom
denom *= 5
print(cnt)
else:
print(0)
|
n = int(input())
if n % 2 == 0:
cnt = 0
denom = 10
while denom <= n:
cnt += n // denom
denom *= 5
print(cnt)
else:
print(0)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,237
| 636,238
|
u531427291
|
python
|
p02833
|
N = int(input())
if N % 2 == 0:
p = 10
ret = 0
while p < N:
ret += N // p
p *= 5
print(ret)
else:
print(0)
|
N = int(input())
if N % 2 == 0:
p = 10
ret = 0
while p <= N:
ret += N // p
p *= 5
print(ret)
else:
print(0)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,241
| 636,242
|
u663710122
|
python
|
p02833
|
X = int(input())
if X % 2 != 0 or X < 10:
print(0)
else:
ans = 0
cnt = 0
while X > 0:
X //= 10
ans += X
print(ans)
|
X = int(input())
if X % 2 != 0 or X < 10:
print(0)
else:
X //= 2
ans = 0
while X > 0:
X //= 5
ans += X
print(ans)
|
[
"literal.number.integer.change"
] | 636,243
| 636,244
|
u389122588
|
python
|
p02833
|
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from math import gcd
import numpy as np
from sys import stdin, stderr
def lcm(x, y):
return (x * y) // gcd(x, y)
def main():
N = int(input())
if N % 2 == 1:
return 0
d = 10
m = 1
ret = 0
while d < N:
ret += m * (N // d)
d *= 5
return ret
if __name__ == "__main__":
print(main())
|
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from math import gcd
import numpy as np
from sys import stdin, stderr
def lcm(x, y):
return (x * y) // gcd(x, y)
def main():
N = int(input())
if N % 2 == 1:
return 0
d = 10
m = 1
ret = 0
while d <= N:
ret += m * (N // d)
d *= 5
return ret
if __name__ == "__main__":
print(main())
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,252
| 636,253
|
u714878632
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
count = 10
while (count < n):
ans += n // count
count *= 5
print(ans)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
count = 10
while (count <= n):
ans += n // count
count *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,264
| 636,265
|
u091051505
|
python
|
p02833
|
n=int(input())
if n%2==1:
print(0)
else:
c=0
x=5
while x<=n:
c+=n//x
x*=5
print(c)
|
n=int(input())
if n%2==1:
print(0)
else:
n//=2
c=0
x=5
while x<=n:
c+=n//x
x*=5
print(c)
|
[] | 636,272
| 636,273
|
u695625981
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
print(sum(n // (2 * 5 ** d) for d in range(1, 18 + 1)))
|
n = int(input())
if n % 2 == 1:
print(0)
else:
print(sum(n // (2 * 5 ** d) for d in range(1, 25 + 1)))
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 636,289
| 636,290
|
u945957386
|
python
|
p02833
|
n = int(input())
ans = 0
if int(n) % 2 != 0:
print(0)
else:
ans = 0
cnt = 10
while True:
if n // cnt == 0:
break
ans += n // cnt
cnt = cnt * 5
print(ans)
|
n = int(input())
ans = 0
if n % 2 != 0:
print(0)
exit()
else:
ans = 0
cnt = 10
while True:
if n // cnt == 0:
break
ans += n // cnt
cnt = cnt * 5
print(ans)
|
[
"call.remove",
"control_flow.branch.if.condition.change",
"call.add"
] | 636,311
| 636,312
|
u023958502
|
python
|
p02833
|
N = int(input())
sum = 0
dominator = 5
if N % 2 == 0:
while(N>dominator):
sum += N // dominator
dominator *= 5
print(sum)
|
N = int(input())
s = 0
dominator = 10
if N % 2 == 0:
while(N>=dominator):
s += N // dominator
dominator *= 5
print(s)
|
[
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"call.arguments.change",
"io.output.change"
] | 636,315
| 636,316
|
u500415792
|
python
|
p02833
|
N = int(input())
sum = 0
dominator = 10
if N % 2 == 0:
while(N>dominator):
sum += N // dominator
dominator *= 5
print(sum)
|
N = int(input())
s = 0
dominator = 10
if N % 2 == 0:
while(N>=dominator):
s += N // dominator
dominator *= 5
print(s)
|
[
"assignment.variable.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"call.arguments.change",
"io.output.change"
] | 636,317
| 636,316
|
u500415792
|
python
|
p02833
|
N=int(input())
if N%2==1:
print(0)
exit(0)
ans=0
n=N
div=10
while n>div:
ans+=n//div
div*=5
print(ans)
|
N=int(input())
if N%2==1:
print(0)
exit(0)
ans=0
n=N
div=10
while n>=div:
ans+=n//div
div*=5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,322
| 636,321
|
u936985471
|
python
|
p02833
|
import math
import bisect
import collections
import itertools
def gcd(a,b):return math.gcd #最大公約数
def lcm(a,b):return (a*b) // math.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def imn(): return map(int, input().split()) #整数map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def 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)
return divisors
def is_prime(n):
if n == 1: return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0: return False
return True
N = iin()
if N % 2 == 1: print(0)
cnt = 0
div = 10
while True:
cnt += N//div
div *= 5
if div > N:break
print(cnt)
|
import math
import bisect
import collections
import itertools
def gcd(a,b):return math.gcd #最大公約数
def lcm(a,b):return (a*b) // math.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def imn(): return map(int, input().split()) #整数map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def 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)
return divisors
def is_prime(n):
if n == 1: return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0: return False
return True
N = iin()
if N % 2 == 1:
print(0)
exit()
cnt = 0
div = 10
while True:
cnt += N//div
div *= 5
if div > N:break
print(cnt)
|
[
"call.add"
] | 636,328
| 636,329
|
u622045059
|
python
|
p02833
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
i = 2 * 5
while i < n:
ans += n // i
i *= 5
print(ans)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
ans = 0
i = 2 * 5
while i <= n:
ans += n // i
i *= 5
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,356
| 636,357
|
u382423941
|
python
|
p02833
|
n = int(input())
if i % 2 == 1:
print(0)
else:
i = 10
ans = 0
while i <= n:
ans += n // i
i *= 5
print(ans)
|
n = int(input())
if n % 2 == 1:
print(0)
else:
i = 10
ans = 0
while i <= n:
ans += n // i
i *= 5
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 636,365
| 636,366
|
u833509814
|
python
|
p02833
|
import sys
def main():
# sys.stdin=open('input148e.txt')
n = int(input())
c = 0
if n % 2 == 1:
print(0)
exit()
r = 10
while r <= n:
c += int(n / r)
r = r * 5
print(c)
if __name__ == '__main__':
main()
|
import sys
def main():
# sys.stdin=open('input148e.txt')
n = int(input())
c = 0
if n % 2 == 1:
print(0)
exit()
r = 10
while r <= n:
c += n // r
r = r * 5
print(c)
if __name__ == '__main__':
main()
|
[
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,369
| 636,370
|
u946433121
|
python
|
p02833
|
import sys
def main():
# sys.stdin=open('input148e.txt')
n = int(input())
c = 0
if n % 2 == 1:
print(0)
exit()
r = 10
while r <= n:
c += n / r
r = r * 5
print(c)
if __name__ == '__main__':
main()
|
import sys
def main():
# sys.stdin=open('input148e.txt')
n = int(input())
c = 0
if n % 2 == 1:
print(0)
exit()
r = 10
while r <= n:
c += n // r
r = r * 5
print(c)
if __name__ == '__main__':
main()
|
[
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 636,371
| 636,370
|
u946433121
|
python
|
p02833
|
n = int(input())
if n % 2 != 0:
print(int(0))
else:
ans = 0
num = 10
while n > num:
ans += (n//num)
num *= 5
print(int(ans))
|
n = int(input())
if n % 2 != 0:
print(int(0))
else:
ans = 0
num = 10
while n >= num:
ans += (n//num)
num *= 5
print(int(ans))
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,372
| 636,373
|
u459150945
|
python
|
p02833
|
import math
N = int(input())
ans = 101
if N%2==1:ans=0
else:
for i in range(int(math.log(N,5))):
ans += N//(5**(i+1)*2)
print(ans)
|
import math
N = int(input())
ans = 0
if N%2==1:ans=0
else:
for i in range(int(math.log(N+1,5))):
ans += N//(5**(i+1)*2)
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 636,379
| 636,380
|
u185948224
|
python
|
p02833
|
# coding: utf-8
# Your code here!
import math
N = int(input())
init, tmp, ans = N // 10, 50, 0
if N / 2 == N // 2:
while True:
if N // tmp > 0:
ans += N // tmp
tmp = tmp * 5
else:
break
print(init + ans)
else:
print(0)
|
# coding: utf-8
# Your code here!
import math
N = int(input())
init, tmp, ans = N // 10, 50, 0
if N % 2 == 0:
while True:
if N // tmp > 0:
ans += N // tmp
tmp = tmp * 5
else:
break
print(init + ans)
else:
print(0)
|
[
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.remove"
] | 636,383
| 636,384
|
u671252250
|
python
|
p02833
|
import math
n = int(input())
if n % 2 == 1:
print(0)
exit()
else:
ten_list = []
five = 5
while five*2 <= n:
ten_list.append(five*2)
five = five * 5
count = 0
for f in ten_list:
count += math.trunc(n/f)
print(int(count))
|
import math
n = int(input())
if n % 2 == 1:
print(0)
exit()
else:
ten_list = []
five = 5
while five*2 <= n:
ten_list.append(five*2)
five = five * 5
count = 0
for f in ten_list:
count += n//f
print(int(count))
|
[
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 636,388
| 636,389
|
u323374686
|
python
|
p02833
|
n = int(input())
if n%2 == 1:
print(0)
exit()
else:
i = n/2
count = 0
while i > 0:
i = i//5
count += i
print(count)
|
n = int(input())
if n%2 == 1:
print(0)
exit()
else:
i = n//2
count = 0
while i > 0:
i = i//5
count += i
print(count)
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 636,390
| 636,391
|
u323374686
|
python
|
p02833
|
num = int(input())
result = 0
if num % 2 != 0:
result = 0
else:
num = num / 2
while(num > 0):
result += num // 5
num = num // 5
print(result)
|
num = int(input())
result = 0
if num % 2 != 0:
result = 0
else:
num = num // 2
while(num > 0):
result += num // 5
num = num // 5
print(result)
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 636,393
| 636,394
|
u879266613
|
python
|
p02833
|
n = int(input())
init = 10
res=0
if(n%2==0):
while init < n:
res += n//init
init*=5
print(res)
|
n = int(input())
init = 10
res=0
if(n%2==0):
while init <= n:
res += n//init
init*=5
print(res)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,395
| 636,396
|
u291552830
|
python
|
p02833
|
n = int(input())
a = 0
if n % 2 != 0 or n < 10:
print(0)
else:
i = 10
while i < n:
a += n//i
i *= 5
print(a)
|
n = int(input())
a = 0
if n % 2 != 0 or n < 10:
print(0)
else:
i = 10
while i <= n:
a += n//i
i *= 5
print(a)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 636,401
| 636,402
|
u898999125
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.