Cod sursa(job #2503826)
| Utilizator | Data | 3 decembrie 2019 20:12:45 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
const int fmax=1e5+5;
const int nmax=5e5+5;
long long f[fmax];
int sp[nmax];
int main()
{
ifstream cin("divk.in");
ofstream cout("divk.out");
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n,c,a,b,k;
long long s=0;
cin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
cin>>c;
sp[i]=(sp[i-1]+c)%k;
if(i>=a)
{
f[sp[i-a]]++;
if(i>b)
f[sp[i-b-1]]--;
s+=f[sp[i]];
}
}
cout<<s;
return 0;
}
