Pagini recente » Borderou de evaluare (job #2557639) | Cod sursa (job #2745864) | Cod sursa (job #429733)
Cod sursa(job #429733)
#include<fstream>
#include<cstdio>
#include<iostream>
using namespace std;
int v[500001],n,a,b,k,c;
int main ()
{
ifstream fin ("divk.in");
freopen("divk.out","w",stdout);
fin>>n>>k>>a>>b;
for(int i=1;i<=n;++i)
fin>>v[i];
for(int i=1;i<=n-a;++i){
int sc=0;
for(int aux=i;aux<i+a-1;++aux)
sc+=v[aux];
if(sc%k==0)
++c;
for(int j=i+a-1;j<=n&&j-i<b;++j){
sc+=v[j];
if(sc%k==0)
++c;
}
}
printf("%d\n",c);
return 0;
}