Pagini recente » Cod sursa (job #968404) | Cod sursa (job #989710) | Cod sursa (job #948955) | Cod sursa (job #2630483) | Cod sursa (job #1180923)
#include <cstdio>
using namespace std;
long long x,i,j,k,A,B,a[500010],n,sum,sol;
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%lld%lld%lld%lld",&n,&k,&A,&B);
for(i=1;i<=n;i++)
{
scanf("%lld",&x);
a[i]=a[i-1]+x;
}
for(i=A;i<=n;i++)
{
for(j=A;j<=B&&(i-j)>=0;j++)
{
sum=a[i]-a[i-j];
if(sum%k==0)
sol++;
}
}
printf("%lld",sol);
return 0;
}