Pagini recente » Cod sursa (job #1390799) | Cod sursa (job #1896655) | Cod sursa (job #1446896) | Cod sursa (job #75961) | Cod sursa (job #212500)
Cod sursa(job #212500)
#include<stdio.h>
#define NMAX 500024
#define KMAX 100024
int S[NMAX];
long long R[KMAX];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
int N,K,A,B;
scanf("%d%d%d%d",&N,&K,&A,&B);
int i,a1;
long long solfin=0;
for(i=1; i<=N; ++i){
scanf("%d",&a1);
S[i]=S[i-1]+a1;
}
for(i=A; i<=B; ++i)
++R[S[i]%K];
for(i=2; N-i+1>=A; ++i)
{
solfin+=R[ S[i-1]%K ];
if( i+B-1<=N )
++R[ S[i+B-1]%K ];
--R[ S[i+A-2]%K ];
}
printf("%lld\n",solfin);
return 0;
}