Pagini recente » Cod sursa (job #825835) | Cod sursa (job #352591) | Cod sursa (job #345232) | Cod sursa (job #2926377) | Cod sursa (job #715347)
Cod sursa(job #715347)
#include<iostream>
#include<fstream>
using namespace std;
int s[500005], v[500005];
int main() {
ifstream f("divk.in");
ofstream g("divk.out");
int n, k, a, b, i, j;
f>>n>>k>>a>>b;
s[0]=0;
for(i=1; i<=n; i++) {
f>>v[i];
s[i]=s[i-1]+v[i];
}
int lungime = b-a-1, rez;
for(i=1; i<=n; i++) {
j=i+a-1;
while(j<=i+lungime) {
if((s[j]-s[i-1])%k==0 && j<=n) rez++;
j++;
}
}
g<<rez;
f.close();
g.close();
return 0;
}