Pagini recente » Cod sursa (job #3312394) | Borderou de evaluare (job #2504406) | Cod sursa (job #3311787) | Cod sursa (job #1708845) | Cod sursa (job #3315680)
#include <fstream>
#define int unsigned long long
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
const int maxn=5e5+5;
int s[maxn];
int f[100005];
int n,k,a,b;
int32_t main()
{
cin>>n>>k>>a>>b;
for(int i=1;i<=n;i++){
int x;
cin>>x;
s[i]=(s[i-1]+x)%k;
}
int cnt=0;
for(int j=a;j<=n;j++){
f[s[j-a]]++;
cnt+=f[s[j]];
if(j-b>=0) f[s[j-b]]--;
}
cout<<cnt;
return 0;
}