Pagini recente » Cod sursa (job #1137096) | Cod sursa (job #142093) | Cod sursa (job #2957353) | Cod sursa (job #3196131) | Cod sursa (job #1476334)
#include <stdio.h>
#define MAX 500005
int n, i, j, x, a, b, k;
long long s[MAX], sol;
int main(){
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
scanf("%d%d%d%d", &n, &k, &a, &b);
for(i = 1; i <= n; i++){
scanf("%d", &x);
s[i] = s[i - 1] + (long long)x;
}
for(i = a; i <= n; i++)
for(j = a; j <= b && j <= i; j++)
if((s[i] - s[i - j + 1]) % k == 0)
sol++;
printf("%lld\n", sol);
return 0;
}