Pagini recente » Cod sursa (job #316506) | Cod sursa (job #325315) | Cod sursa (job #394687) | Cod sursa (job #2871727) | Cod sursa (job #3314021)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
vector<long long> v(500000+1);
vector<long long> sp(500000+1);
vector<int> frecv(500000*2+1);
int main() {
ios::sync_with_stdio(false);
fin.tie(0);
int n, k, a, b;
fin >> n >> k >> a >> b;
for (int i = 1; i <= n; i++) {
fin >> v[i];
}
sp[0] = 0;
for (int i = 1; i <= n; i++) {
long long s = (long long)sp[i-1] + v[i];
sp[i] = int(s % k);
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
int j1 = i - a;
if (j1 >= 0) {
frecv[sp[j1]]++;
}
int j2 = i - b - 1;
if (j2 >= 0) {
frecv[sp[j2]]--;
}
ans += frecv[sp[i]];
}
fout << ans << '\n';
return 0;
}