Pagini recente » Cod sursa (job #2207637) | Cod sursa (job #2304583) | Cod sursa (job #2484145) | Cod sursa (job #1556142) | Cod sursa (job #2447780)
#include <fstream>
#define nmax 500001
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main(){
int n, k, a, b, x;
long long sums[nmax]={0};
int i, j;
long long nrsecv=0;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++){
f>>x;
sums[i]=(sums[i-1]+x)%k;
}
j=0;
i=b;
while(i<=n){
while((i-j)>=a){
if((sums[i]-sums[j])%k==0){
nrsecv++;
}
j++;
}
i++;
j=i-b;
}
g<<nrsecv<<"\n";
}