Pagini recente » IAP #6: Arhiva educationala | Istoria paginii problema/treesearch | Istoria paginii runda/ada6 | FMI No Stress 2010 | Cod sursa (job #510233)
Cod sursa(job #510233)
#include <stdio.h>
int a,b,n,k,v[500001],i,m[500001];
long long rez;
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]);
v[i]+=v[i-1];
v[i]%=k;
}
m[0]=1;
for(i=a;i<=n;i++){
rez+=m[v[i]];
m[v[i-a]]++;
if(i>b){
m[v[i-b-1]]--;
}
}
printf("%lld",rez);
}