# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167191 | boolodifjenula | Telefoni (COCI17_telefoni) | Cpython 3 | 211 ms | 8912 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
N,D=map(int,input().split())
T=list(map(int,input().split()))
b=0
n=0
for i in range(1,N):
if T[i]==0:
n+=1
else: n=0
if n==D:
T[i]==1
n=0
b+=1
print(b)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |