Pagini recente » Borderou de evaluare (job #1618384) | Borderou de evaluare (job #634319) | Borderou de evaluare (job #1576722) | Cod sursa (job #2946230) | Cod sursa (job #741494)
Cod sursa(job #741494)
#include<cstdio>
#define dim 500001
using namespace std;
long long sum[dim],rez;
int a,b,k,n;
inline void citire()
{
freopen("divk.in","r",stdin);
scanf("%d%d%d%d",&n,&k,&a,&b);
for(int i=1;i<=n;++i)
{
long s;
scanf("%ld",&s);
sum[i]=sum[i-1]+s;
}
}
inline void rezolva()
{
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
if( j-i+1>=a && j-i+1<=b && (sum[j]-sum[i-1])%k==0 )
++rez;
freopen("divk.out","w",stdout);
printf("%lld",rez);
}
int main()
{
citire();
rezolva();
}