Cod sursa(job #2500531)
Utilizator | Data | 28 noiembrie 2019 10:01:04 | |
---|---|---|---|
Problema | Divk | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int sp[500005],f[500005];
int main ()
{
ifstream cin("divk.in");
ofstream cout("divk.out");
int n,k,a,b,cnt=0,x;
cin>>n>>k>>a>>b;
for(int dr=1;dr<=n;dr++)
{
cin>>x;
sp[dr]=(sp[dr-1]+x)%k;
if(dr-b-1>=0)
f[sp[dr-b-1]]--;
if(dr-a>=0)
f[sp[dr-a]]++;
cnt+=f[sp[dr]];
}
cout<<cnt;
return 0;
}