Cod sursa(job #501117)
Utilizator | Data | 14 noiembrie 2010 13:28:50 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<stdio.h>
int n,k,a,b,v[500010],av[500010],i,j,p[500010],sol;
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",&v[i]);
for(i=1;i<=n;i++)
{
s=s+v[i];
av[i]=s%k;
}
for(i=a;i<=b;i++)
p[av[i]]++;
sol+=p[0];
j=1;
for(i=b+1;i<=n+a;i++)
{
if(i<=n)
p[av[i]]++;
p[av[i-b+1]]--;
sol+=p[av[j]];
j++;
}
printf("%d",sol);
return 0;
}