Pagini recente » Cod sursa (job #73059) | Cod sursa (job #2794637) | Cod sursa (job #836975) | Cod sursa (job #854287) | Cod sursa (job #2660004)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
#define NMAX 500005
int n,k,a,b;
int x;
int sum[NMAX];
int ap[100005];
int main()
{
fin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
fin>>x;
sum[i] = (sum[i-1] + x) % k;
//cout<<sum[i]<<" ";
}
long long sol = 0;
for(int i=1;i<=n;i++)
{
if(i >= a)
{
ap[sum[i-a]]++;
}
if(i > b)
{
ap[sum[i-b-1]]--;
}
sol += ap[sum[i]];
}
fout<<sol;
return 0;
}