Cod sursa(job #1769696)
| Utilizator | Data | 2 octombrie 2016 22:58:23 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
std::ifstream f("divk.in");
std::ofstream g("divk.out");
int x, n, k, a, b, i, j;
int s[500001];
long long sol, nra[500001], nrb[500001];
int main() {
f >> n >> k >> a >> b;
for (i = 1; i <= n; i++) {
f >> x;
s[i] = (s[i-1]+x)%k;
if (i >= a)
nra[s[i-a]]++;
if (i > b)
nrb[s[i-b-1]]++;
sol += nra[s[i]] - nrb[s[i]];
}
g << sol;
return 0;
}
