Pagini recente » Cod sursa (job #2325043) | Cod sursa (job #2391450) | Borderou de evaluare (job #3161213) | Borderou de evaluare (job #2527363) | Cod sursa (job #3207447)
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
unsigned long long n,k,a,c,v[500005],s,i,j,d,nr,b[500005];
int main()
{cin>>n>>k>>a>>c;
for (i=1; i<=n; i++)
{
cin>>v[i];
b[i]=v[i]+b[i-1];
}
for (i=a; i<=c; i++)
{
for (j=1; j<=n-i+1; j++)
{
s=b[j+i-1]-b[j]+v[j];
if (s%k==0) nr++;
}
}
cout<<nr;
return 0;
}