Cod sursa(job #1721652)
| Utilizator | Data | 26 iunie 2016 11:52:12 | |
|---|---|---|---|
| Problema | Divk | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <stdio.h>
#include <iostream>
using namespace std;
int n,k,a,b,frecv[100005];
long long int sum[100005];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%d%d%d%d",&n,&k,&a,&b);
long long int rasp=0;
for(int i=1;i<=n;i++) {
scanf("%d",&sum[i]);
sum[i]+=sum[i-1];
if(i>=a)
frecv[sum[i-a]%k]++;
if(i>b)
frecv[sum[i-b-1]%k]--;
rasp+=frecv[sum[i]%k];
}
printf("%lld",rasp);
return 0;
}
