Pagini recente » Borderou de evaluare (job #389968) | greseli_destepte2 | Axinte Silviu | Cod sursa (job #2046161) | Cod sursa (job #331843)
Cod sursa(job #331843)
#include<stdio.h>
int i,n,k,x,y,v[100001],j;
long long a[500010],rez;
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%d %d %d %d",&n,&k,&x,&y);
for(i=1;i<=n;i++) { scanf("%lld",&a[i]);
a[i]+=a[i-1];
rez+=v[a[i]%k];
if(i-x+1>=0) v[a[i-x+1]%k]++;
if(i-y>=0) v[a[i-y]%k]--;
}
printf("%lld\n",rez);
fclose(stdin);
fclose(stdout);
return 0;
}