Pagini recente » Cod sursa (job #1118136) | Cod sursa (job #678932) | Cod sursa (job #1134310) | Cod sursa (job #1516425) | Cod sursa (job #320014)
Cod sursa(job #320014)
#include<stdio.h>
#include<string.h>
#define X 500001
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
int v[X],sum[X],n,k,a,b,i,j,l,u,cnt=0;
memset(sum,0,sizeof(sum));
scanf("%d %d %d %d",&n, &k, &a, &b);
for(i=1; i<=n; ++i)
{
scanf("%d",&v[i]);
sum[i]=sum[i-1]+v[i];
}
for(i=1; i<=n; ++i)
{
l=1,j=i+a-1;
while(l<=b-a+1 && j<=n)
{
if(sum[j]%k == sum[i-1]%k == 0) ++cnt;
++l,++j;
}
}
printf("%d\n",cnt);
return 0;
}