Pagini recente » Cod sursa (job #2414216) | Cod sursa (job #347940) | Cod sursa (job #2727433) | Cod sursa (job #916033) | Cod sursa (job #1135324)
#include <cstdio>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int main(int argc, char *argv[]) {
int k, a, b, n;
fin >> n >> k >> a >> b;
vector<int> sums;
for (int i = 0; i < n; ++i) {
int t;
fin >> t;
if (i == 0) {
sums.push_back(t);
} else {
sums.push_back(sums[i - 1] + t);
}
}
int s = 0, e = 0, c = 0, sum = 0;
for (int e = 0; e < sums.size(); ++e) {
for (int s = e - b + 1; s <= e - a + 1; ++s) {
if (s >= 0 && (sums[e] - sums[s]) % k == 0) {
++c;
}
}
}
fout << c << endl;
fout.close();
return 0;
}