Pagini recente » Cod sursa (job #1656261) | Cod sursa (job #2486184) | Cod sursa (job #1223645) | Cod sursa (job #242586) | Cod sursa (job #1275064)
#include <cstdio>
using namespace std;
int a,b,n,i,j,k,t,c[500000];
long long s;
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%d%d%d%d",&n,&k,&a,&b);
for(i=1;i<=n;i++)
scanf("%d",&c[i]);
i=1;
while(i<=n-a+1)
{
s=0;
for(j=i;(j<=i+b-1)&&(j<=n);j++)
{
s=s+c[j];
if((j-i+1>=a)&&(s%k==0))
t++;
}
i++;
}
printf("%d",t);
return 0;
}