Pagini recente » Cod sursa (job #1640620) | Cod sursa (job #2920748) | Cod sursa (job #888574) | Cod sursa (job #1725020) | Cod sursa (job #2712566)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
const int NMAX = 5e5 + 5;
const int KMAX = 1e5 + 5;
int N, K, A, B, x, sum[NMAX], freq[KMAX];
long long ans;
int main() {
fin >> N >> K >> A >> B;
for(int i = 1; i <= N; ++i) {
fin >> x;
sum[i] = (sum[i - 1] + x) % K;
}
for(int i = 1; i <= N; ++i) {
if(i >= A)
++freq[sum[i - A]];
if(i > B)
--freq[sum[i - B - 1]];
ans += freq[sum[i]];
}
fout << ans << '\n';
}