Pagini recente » Cod sursa (job #2865496) | Cod sursa (job #2773033) | Cod sursa (job #2528240) | Cod sursa (job #1983459) | Cod sursa (job #3207434)
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int a,b,i,s[500005],inc,sfar,nrh,suma,n,k,x,j;
int main()
{
fin>>n>>k>>a>>b;
for (i=1; i<=n; i++)
{
fin>>x;
s[i]=s[i-1]+x;
}
for (i=a; i<=b; i++)
{
for (j=1; j<=n-i+1; j++)
{
if (j+i-1<=n)
{
inc=j;
sfar=j+i-1;
suma=s[sfar]-s[inc-1];
if (suma%k==0)
{
nrh++;
}
}
}
}
fout<<nrh;
return 0;
}