Pagini recente » Cod sursa (job #112687) | Cod sursa (job #1670861) | Borderou de evaluare (job #528080) | Cod sursa (job #1195577) | Cod sursa (job #3207475)
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
long long a,b,i,s[500001],st,dr,T,suma,n,k,j,v[500001];
int main()
{
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
for(i=a;i<=b;i++)
{
for(j=1;j<=n-i+1;j++)
{
if(j+i-1<=n)
{
st=j;
dr=j+i-1;
suma=s[dr]-s[st-1];
if(suma%k==0)
{
T++;
}
}
}
}
fout<<T;
return 0;
}