Pagini recente » Cod sursa (job #1196790) | Profil M@2Te4i | Cod sursa (job #1811256) | Cod sursa (job #2266836) | Cod sursa (job #987482)
Cod sursa(job #987482)
#include <fstream>
using namespace std;
int frec[100005];
int main()
{
ifstream fin("divk.in");
ofstream fout("divk.out");
int n=0,k,a,b,i,st,dr;
fin>>n>>k>>a>>b;
int nr[500005];
nr[0]=0;
for(i=1;i<=n;i++)
fin>>nr[i],nr[i]+=nr[i-1],nr[i]%=k;
fin.close();
long long int total;
st=0;
dr=-1;
for(i=0;i<=n;i++)
{
while((i-st)>b)
frec[nr[st++]]--;
while((i-dr-1)>=a)
frec[nr[++dr]]++;
total=total+frec[nr[i]]*1ll;
}
fout<<total<<'\n';
fout.close();
return 0;
}