Cod sursa(job #2587061)
Utilizator | Andrei Feodorov Nashik | Data | 21 martie 2020 22:36:09 |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
//#include <iostream>
#include <fstream>
using namespace std;
int n,k,a,b,f[500005],sp[500005];
long long sum;
ifstream cin("divk.in");
ofstream cout("divk.out");
int main()
{
cin>>n>>k>>a>>b;
for(int i=1;i<=n;i++){
cin>>sp[i];
sp[i]+=sp[i-1];
sp[i]%=k;
}
for(int i=1;i<=n;i++){
if(i>=a){
f[sp[i-a]]++;
}
if(i>b){
f[sp[i-b-1]]--;
}
sum+=f[sp[i]];
}
cout<<sum;
return 0;
}