# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463799 | rainboy | Telefoni (COCI17_telefoni) | C11 | 32 ms | 2008 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.
#include <stdio.h>
#define N 300000
int main() {
static int aa[N];
int n, d, i, j, ans;
scanf("%d%d", &n, &d);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
ans = 0;
for (i = 0, j = 1; j < n; j++)
if (aa[j])
ans += (j - i - 1) / d, i = j;
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |