Cod sursa(job #715342)
| Utilizator | Data | 17 martie 2012 00:57:53 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#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, rez;
for(i=1; i<=n; i++) {
for(j=i+a-1; j<i+lungime; j++) {
if((s[j]-s[i-1])%k==0) rez++;
}
}
g<<rez;
f.close();
g.close();
return 0;
}
