Pagini recente » Cod sursa (job #326474) | Cod sursa (job #3269383) | Cod sursa (job #1662256) | Cod sursa (job #2939430) | Cod sursa (job #949272)
Cod sursa(job #949272)
#include <fstream>
#define nmax 500002
using namespace std;
ifstream f("divk.in"); ofstream g("divk.out");
int n,k,a,b,x;
long long nr;
int sume[nmax],sol[nmax];
int main()
{ f>>n>>k>>a>>b;
for(int i=1; i<=n; i++)
{f>>x; sume[i]=(sume[i-1]+x) % k;}
for(int i=1; i<=n; i++)
{ if(a<=i) ++sol[sume[i-a]];
if(b<i) --sol[sume[i-b-1]];
nr+=sol[sume[i]];
}
g<<nr<<"\n"; g.close(); return 0;
}