Cod sursa(job #1822639)
| Utilizator | Data | 5 decembrie 2016 11:35:12 | |
|---|---|---|---|
| Problema | Divk | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <bits/stdc++.h>
#define NMAX 500005
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int V[NMAX];
int main()
{
ios :: sync_with_stdio(false);
fin.tie(NULL);
int n,a,b,k,sol = 0;
fin >> n >> k >> a >> b;
for(int i = 1; i <= n; i++){
fin >> V[i];
V[i] += V[i - 1];
}
for(int i = a; i <= n; i++){
for(int j = i - a + 1; j >= i - b + 1 && j >= 1; j--){
if((V[i] - V[j - 1]) % k == 0){
sol ++;
}
}
}
fout << sol;
return 0;
}
