Pagini recente » Cod sursa (job #3211187) | Cod sursa (job #310995) | Cod sursa (job #3258721) | Cod sursa (job #1145786) | Cod sursa (job #316054)
Cod sursa(job #316054)
#include<stdio.h>
#include<string.h>
//#include<conio.h>
#define X 500001
int main()
{
//clrscr();
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-a+1; ++i)
for(j=i+a-1,l=1; j<=n && l<=b; ++j,++l)
{
if((sum[j]-sum[i-1])%k==0)
{
++cnt;
//for(u=i; u<=j; ++u) printf("%d ",v[u]);
//printf("\n");
}
}
printf("%d\n",cnt);
return 0;
}