Pagini recente » Cod sursa (job #2531250) | Cod sursa (job #2395878) | Cod sursa (job #2514778) | Cod sursa (job #109520) | Cod sursa (job #1470426)
#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;
long long 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;
}