Cod sursa(job #715932)
Utilizator | Data | 17 martie 2012 22:56:33 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[500005], s[500005];
int main() {
ifstream f("divk.in");
ofstream g("divk.out");
int n, a, b, k, i, j, rez=0;
f>>n>>k>>a>>b;
for(i=1; i<=n; i++) { f>>v[i]; s[i]=s[i-1]+v[i]; }
for(i=1; i<=n; i++) {
for(j=i+a; j<i+b; j++) {
if((s[j]-s[i-1])%k==0) rez++;
}
}
g<<rez;
f.close();
g.close();
return 0;
}