Cod sursa(job #3221709)
Utilizator | Georgescu David davidgeo123 | Data | 7 aprilie 2024 20:34:59 |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#define int long long
using namespace std;
int fr[100001];
signed main()
{
ifstream cin("divk.in");
ofstream cout("divk.out");
int n, k, a, b;
cin>>n>>k>>a>>b;
int v[n+1];
v[0]=0;
for(int i=1; i<=n; i++)
{
cin>>v[i];
v[i]+=v[i-1];
}
int ans=0;
for(int i=0; i<=n; i++)
{
ans+=fr[v[i]%k];
if(i-a+1>=0)
++fr[v[i-a+1]%k];
if(i-b>=0)
--fr[v[i-b]%k];
}
cout<<ans;
return 0;
}