Pagini recente » Cod sursa (job #262810) | Cod sursa (job #60109) | Cod sursa (job #1059300) | Cod sursa (job #3241868) | Cod sursa (job #658350)
Cod sursa(job #658350)
#include<cstdio>
using namespace std;
int v[500001], mod[500001], nr;
int main(){
freopen("divk.in", "r", stdin), freopen("divk.out", "w", stdout);
int N, K, A, B, i, lng;
scanf("%d %d %d %d", &N, &K, &A, &B);
for (i = 1; i <= N; i++){
scanf("%d", &v[i]);
mod[i] = (mod[i-1] + v[i]) % K;
}
for (lng = A; lng <= B; lng++)
for (i = lng; i <= N; i++)
if (mod[i] == mod[i - lng]) nr++;
printf("%d", nr);
return 0;
}