Pagini recente » Cod sursa (job #2618779) | Cod sursa (job #3249677) | Cod sursa (job #3250093) | Cod sursa (job #329195) | Cod sursa (job #2462681)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int v[500005];
int sp[500005];
int f[200005];
int32_t main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
int n,k,a,b;
scanf("%lld %lld %lld %lld",&n,&k,&a,&b);
for(int i=1;i<=n;++i)
{
scanf("%lld",&v[i]);
sp[i]=(sp[i-1]+v[i])%k;
}
long long ans=0;
for(int i=a;i<=b;++i)
{
f[sp[i-a]]++;
if(i>=a)ans += (f[sp[i]]);
}
int lost=1;
for(int i=b+1;i<=n;++i)
{
f[sp[i-a]]++;
f[sp[i-b-1]]--;
ans+= (f[sp[i]]);
}
printf("%lld",ans);
return 0;
}