Cod sursa(job #1470424)
| Utilizator | Data | 11 august 2015 00:39:37 | |
|---|---|---|---|
| Problema | Divk | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("divk.in");
ofstream fout ("divk.out");
// rest[i] = (v[1] + ... + v[i]) % K
int v[500001], rest[500001], frecv[100000];
int main() {
int N, K, A, B, i, nr = 0;
fin >> N >> K >> A >> B;
for (i = 1; i <= N; i++) {
fin >> v[i];
}
for (i = 1; i <= N; i++) {
rest[i] = (rest[i - 1] + v[i]) % K;
if (i >= A) {
++ frecv[rest[i - A]];
}
if (i > B) {
-- frecv[rest[i - B - 1]];
}
nr += frecv[rest[i]];
}
fout << nr;
return 0;
}
