Pagini recente » Cod sursa (job #3247154) | Cod sursa (job #2457978) | Cod sursa (job #1667500) | Cod sursa (job #1949229) | Cod sursa (job #1141497)
#include <fstream>
using namespace std;
long long v[500005] , w[150000];
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
int n,k,a,b,x,nr=0,i;
unsigned long int c;
f>>n>>k>>a>>b;
v[0]=0;
for(i=1;i<=n;i++)
{
f>>x;
c=c+x%k;
if(c%k==0 && i<=a) nr++;
v[i]=(v[i-1]+x)%k;
}
for(i=1;i<=n;i++)
{
if(i>a) w[v[i-a]]+=1;
if(i>b+1) w[v[i-b-1]]-=1;
nr+=w[v[i]];
}
g<<nr;
}