Cod sursa(job #581709)
Utilizator | Data | 14 aprilie 2011 15:24:38 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<stdio.h>
long x[500001];
long c[500001];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
long a,b,n,k,i,j,nr=0;
scanf("%ld%ld%ld%ld",&n,&k,&a,&b);
for(i=1;i<=n;i++)
{
scanf("%ld",&c[i]);
x[i]=(x[i-1]+c[i])%k;
}
for(j=a;j<=b;j++)
for(i=1;i<=n-j;i++)
if(x[i+j]-x[i]==0)
nr++;
printf("%ld",nr);
return 0;
}