Pagini recente » Cod sursa (job #1568855) | Cod sursa (job #1221066) | Cod sursa (job #1100725) | Cod sursa (job #1722775) | Cod sursa (job #1178782)
#include <cstdio>
using namespace std;
int d[500005];
long long r[100001];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
long long n,k,a,b,nr=0,x,i,j;
scanf("%lld%lld%lld%lld",&n,&k,&a,&b);
for(i=1;i<=n;i++)
{
scanf("%lld",&x);
d[i]=(d[i-1]+x)%k;
}
for(i=1;i<=n;i++)
{
if (i>=a) r[d[i-a]]++;
if (i>b) r[d[i-b-1]]--;
nr=nr+r[d[i]];
}
printf("%lld",nr);
return 0;
}