Cod sursa(job #2810101)
Utilizator | Data | 28 noiembrie 2021 14:49:09 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
const int nmax=500000;
int r[nmax+5],f[nmax+5];
int main()
{
int n,a,b,k,i,x;
long long s=0;
fin>>n>>k>>a>>b;
for(i=1;i<=n;++i){
fin>>x;
r[i]=(r[i-1]+x)%k;
if(i>=a){
++f[r[i-a]];
}
if(i>b){
--f[r[i-b-1]];
}
s+=f[r[i]];
}
fout<<s;
return 0;
}