Cod sursa(job #1178782)
| Utilizator | Data | 27 aprilie 2014 11:22:09 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int d[500005];
long long r[100001];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
long long n,k,a,b,nr=0,x,i,j;
scanf("%lld%lld%lld%lld",&n,&k,&a,&b);
for(i=1;i<=n;i++)
{
scanf("%lld",&x);
d[i]=(d[i-1]+x)%k;
}
for(i=1;i<=n;i++)
{
if (i>=a) r[d[i-a]]++;
if (i>b) r[d[i-b-1]]--;
nr=nr+r[d[i]];
}
printf("%lld",nr);
return 0;
}
