Pagini recente » Cod sursa (job #2899357) | Cod sursa (job #1315741) | Cod sursa (job #2160228) | Cod sursa (job #2160543) | Cod sursa (job #1672874)
Utilizator |
bobelus bob bob123 |
Data |
3 aprilie 2016 11:03:08 |
Problema |
Divk |
Scor |
90 |
Compilator |
cpp |
Status |
done |
Runda |
oni_5 |
Marime |
0.5 kb |
#include <cstdio>
using namespace std;
int Min,n,k,a,b,x,i,j,nr;
int s[500003],f[100003];
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)%k;
if(a<=i){
++f[s[i-a]];
nr+=f[s[i]];
if(i>=b)
--f[s[i-b]];
}
}
printf("%d", nr);
return 0;
}