Pagini recente » Cod sursa (job #1047375) | Cod sursa (job #2937010) | Cod sursa (job #2382712) | Cod sursa (job #897231) | Cod sursa (job #1138907)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fcin("divk.in");
ofstream fcout("divk.out");
long long nr=0;
int n,*v,a,b,k,j,i,*s;
fcin>>n>>k>>a>>b;
v=new int[n+1];
s=new int[n+1];
for (i=1;i<=n;i++)
{
fcin>>v[i];
s[i]=s[i-1]+v[i];
}
for (i=1;i<=n-a+1;i++)
{
int x=i+a-3;
for (j=i+a-1;j<=i+a+b-3&&j<=n;j++)
{
if ((s[j]-s[x])%k==0)
nr++;
}
}
fcout<<nr<<endl;
fcin.close();
fcout.close();
return 0;
}