Pagini recente » Cod sursa (job #1882335) | Cod sursa (job #2127560) | Cod sursa (job #2260795) | Cod sursa (job #1108094) | Cod sursa (job #1672867)
Utilizator |
bobelus bob bob123 |
Data |
3 aprilie 2016 10:53:17 |
Problema |
Divk |
Scor |
30 |
Compilator |
cpp |
Status |
done |
Runda |
oni_5 |
Marime |
0.45 kb |
#include <cstdio>
using namespace std;
int n,k,a,b,x,i,j,nr;
long long s[500003];
int main()
{
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
scanf("%d", &n);
scanf("%d%d%d", &k,&a,&b);
for(i=1;i<=n;++i){
scanf("%d", &x);
s[i]=s[i-1]+(long long)x;
}
for(j=a;j<=b;++j)
for(i=j;i<=n;++i)
if((s[i]-s[i-j])%k==0)++nr;
printf("%d", nr);
return 0;
}