Pagini recente » Cod sursa (job #1801902) | Cod sursa (job #229372) | Cod sursa (job #1200937) | Cod sursa (job #2337477) | Cod sursa (job #261667)
Cod sursa(job #261667)
#include <stdio.h>
#include <stdlib.h>
long long s[500002],n,i,k,a,b,nr,c,j;
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%lld%lld%lld%lld",&n,&k,&a,&b);
for(i=1; i<=n; i++)
{
scanf("%lld",&nr);
s[i]+=s[i-1]+nr;
}
for(i=2; i<=n+1; i++)
for(j=i; j<=n; j++)
if((j-(i-2))>=a && (j-(i-2)<=b))
if(abs(s[i-1]-s[j])%k==0) c++;
printf("%lld",c);
return 0;
}