Pagini recente » Cod sursa (job #1543144) | Cod sursa (job #2022406) | Cod sursa (job #1826768) | Cod sursa (job #975618) | Cod sursa (job #1974949)
#include <bits/stdc++.h>
using namespace std;
int N,K,A,B,v[500001],i,j,nr,k;
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)
for(j=1;j<=i;++j)
if(i-j+1>=A && i-j+1<=B){
s=0;
for(k=j;k<=i;++k)
s+=v[k];
if(!(s%K))++nr;
}
printf("%d",nr);
}