Pagini recente » Cod sursa (job #1712110) | Cod sursa (job #252541) | Cod sursa (job #1710641) | Cod sursa (job #2360331) | Cod sursa (job #1138893)
#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,c,i,s;
fcin>>n>>k>>a>>b;
v=new int[n+1];
for (i=1;i<=n;i++)
fcin>>v[i];
c=1;
while (c<=n-a)
{
s=0;
for (i=c;i<a+c;i++)
s=s+v[i];
if (s%k==0)
nr++;
for (i=a+c+1;i<c+b;i++)
{
s=s+v[i];
if (s%k==0)
nr++;
}
c++;
}
fcout<<nr+1<<endl;
fcin.close();
fcout.close();
return 0;
}