Pagini recente » Cod sursa (job #805794) | Cod sursa (job #2344834) | Cod sursa (job #1601138) | Cod sursa (job #515766) | Cod sursa (job #3314236)
#include <bits/stdc++.h>
using namespace std;
#define int long long
int sp[600005], fr[200005];
signed main()
{
#ifndef LOCAL
ifstream cin("divk.in");
ofstream cout("divk.out");
#endif
int N, K, A, B;
cin >> N >> K >> A >> B;
for(int i = 1; i <= N; ++i) {
int nr;
cin >> nr;
sp[i] = sp[i-1] + nr;
}
int nrSiruri = 0;
for(int i = A; i <= N; ++i) {
if(i > B) --fr[sp[i-B-1] % K];
++fr[sp[i-A] % K];
nrSiruri += fr[sp[i] % K];
}
cout << nrSiruri;
return 0;
}