Pagini recente » Cod sursa (job #1840996) | Cod sursa (job #56574) | Cod sursa (job #380433) | Cod sursa (job #2102988) | Cod sursa (job #1367205)
#include <iostream>
#include<fstream>
using namespace std;
int n,i,k,a,b,v[500000],s,a1,nr,j,b1,l;
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=n-a+1;i++)
{ s=0;
for(j=i;j<=a+i-1;j++)s=s+v[j];
if(s%k==0)nr++;
for(j=i+a;j<=i+b-1;j++)
{ s=s+v[j];
if((i+b-1<=n)&&(s%k==0))nr++;
}
}
g<<nr;
return 0;
}