Pagini recente » Borderou de evaluare (job #1575077) | Monitorul de evaluare | Borderou de evaluare (job #1569570) | Monitorul de evaluare | Cod sursa (job #775985)
Cod sursa(job #775985)
#include <cstdio>
#include <cstdlib>
using namespace std;
#define nmax 500010
int N, A, B, K, X;
long long used[nmax], v[nmax], sol;
int main()
{
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
int i;
scanf("%i %i %i %i", &N, &K, &A, &B);
for(i = 1; i <= N; i++)
{
scanf("%i", &X);
v[i] = (v[i - 1] + X) % K;
}
for(i = A; i <= N; i++)
{
used[v[i - A]] ++;
if(i > B) used[v[i - B - 1]] --;
sol += used[v[i]];
}
printf("%lld\n", sol);
scanf("%i", &i);
return 0;
}