Pagini recente » Cod sursa (job #2296959) | Cod sursa (job #2296768) | Cod sursa (job #1732968) | Problema 2-satisfiabilității | Cod sursa (job #1453463)
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, v[500005], k, a, b;
cin >> n >> k >> a >> b;
cin >> v[0];
v[0] %= k;
for (int i = 1; i < n; i++) {
int aux;
cin >> aux;
v[i] = (v[i - 1] + aux) % k;
}
long long ans = 0;
for (int i = a - 1; i < b; i++) {
if (v[i] == 0) {
ans++;
}
}
for (int i = 0; i < n - a; i++) {
for (int j = i + a; j < n && j <= i + b; j++) {
if (v[j] == v[i]) {
ans++;
}
}
}
cout << ans;
return 0;
}