Pagini recente » Cod sursa (job #2115214) | Cod sursa (job #271998) | Cod sursa (job #685178) | Cod sursa (job #1627639) | Cod sursa (job #2258830)
//#include <iostream>
//#include <fstream>
#include <cstdio>
using namespace std;
//ifstream cin("divk.in");
//ofstream cout("divk.out");
int n,k,nr1,nr2;
long long a[500005];
long long nr;
int s[100005];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
int i,j,x;
//cin>>n>>k>>nr1>>nr2;
scanf("%d%d%d%d", &n,&k,&nr1,&nr2);
for(i=1;i<=n;i++){
//cin>>x;
scanf("%d",&x);
a[i]=a[i-1]+x;
if(i-nr2-1>=0)
s[a[i-nr2-1] - a[i-nr2-1]/k * k]--;
if(i-nr1>=0){
s[a[i-nr1] - a[i-nr1]/k * k]++;
nr+=s[a[i] - a[i]/k * k];
}
}
//cout<<nr;
printf("%d",nr);
return 0;
}