Pagini recente » Cod sursa (job #2286461) | Cod sursa (job #923686) | Cod sursa (job #3159655) | Cod sursa (job #779380) | Cod sursa (job #1342176)
#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=a;i<=b;i++)
{ s=0;a1=2;
for(j=1;j<=i;j++)s=s+v[j];
if(s%k==0)nr++;
while(a1<=n-i+1)
{
s=s-v[a1-1]+v[a1+i-1];
if(s%k==0)nr++;
a1++;
}
}
g<<nr;
return 0;
}