Cod sursa(job #807862)
| Utilizator | Data | 5 noiembrie 2012 20:23:30 | |
|---|---|---|---|
| Problema | Divk | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <stdio.h>
long n, a, b, k, nr;
long v[500001], p[500001];
int main() {
long i, j;
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
scanf("%ld %ld %ld %ld", &n, &k, &a, &b);
a--;
b--;
for(i = 1; i <= n; i++)
scanf("%ld", &v[i]);
for(i = 1; i <= n; i++)
p[i] = p[i - 1] + v[i];
for(i = 1; i + a <= n; i++)
for(j = a; j <= b && i + j <= n; j++)
if((p[i + j] - p[i - 1]) % k == 0)
nr++;
printf("%ld", nr);
return 0;
}
