Cod sursa(job #1398450)
| Utilizator | Data | 24 martie 2015 11:10:00 | |
|---|---|---|---|
| Problema | Divk | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <cstdio>
using namespace std;
int n, k, a, b, v[500010], cnt[100010], i, s, x;
int main(){
freopen("divk.in", "r", stdin);
freopen("divk.out", "w", stdout);
scanf("%d %d %d %d", &n, &k, &a, &b);
for(i=1; i<=n; i++)
{
scanf("%d", &x);
v[i]=(v[i-1]+x)%k;
}
for(i=1; i<a; i++)
cnt[ v[i] ]++;
for(i=a; i<=b; i++)
{
s+=cnt[ v[i] ];
cnt[ v[i] ]++;
}
for(i=b+1; i<=n; i++)
{
cnt[ v[i-b] ]--;
s+=cnt[ v[i] ];
cnt[ v[i] ]++;
}
printf("%d\n", s);
return 0;
}
