Pagini recente » Cod sursa (job #953056) | Cod sursa (job #673018) | Cod sursa (job #1685549) | Cod sursa (job #2854136) | Cod sursa (job #1453464)
#include <cstdio>
long long cit() {
long long ans = 0;
char c = getchar();
bool neg = false;
while (c < '0' || c > '9') {
if (c == '-') {
c = getchar();
neg = true;
break;
}
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = (ans << 3) + (ans << 1) + (c - '0');
c = getchar();
}
return (neg) ? -ans : ans;
}
void afis(long long n) {
int l = 0;
char c[20];
if (n == 0) {
putchar('0');
}
if (n < 0) {
putchar('-');
n = -n;
}
while (n > 0) {
c[l++] = n % 10 + '0';
n /= 10;
}
for (int i = l - 1; i >= 0; i--) {
putchar(c[i]);
}
putchar('\n');
}
int main() {
int n = cit(), k = cit(), a = cit(), b = cit(), v[500005];
v[0] = cit();
v[0] %= k;
for (int i = 1; i < n; i++) {
int aux = cit();
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++;
}
}
}
afis(ans);
return 0;
}