Pagini recente » Cod sursa (job #191480) | Cod sursa (job #333675) | Cod sursa (job #1851218) | Cod sursa (job #691498) | Cod sursa (job #1329759)
#include <cstdio>
#include <vector>
using namespace std;
int s[500005];
vector <int> v[100002];
int main() {
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
int n, k, a, b, sol = 0, x, m, aux;
scanf("%d%d%d%d", &n, &k, &a, &b);
v[0].push_back(0);
for(int i = 1; i <= n; ++ i) {
scanf("%d", &x);
s[i] = (s[i - 1] + x) % k;
v[s[i]].push_back(i);
}
for(int i = 0; i <= k; ++ i) {
m = v[i].size();
for(int j = 1; j < m; ++ j) {
for(int p = j - 1; p >= 0; -- p) {
aux = v[i][j] - v[i][p] + 1;
if(a <= aux && aux <= b)
++ sol;
}
}
}
printf("%d\n", sol);
return 0;
}