Cod sursa(job #946306)
| Utilizator | Data | 4 mai 2013 11:54:39 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<stdio.h>
int v[500002],s[500002];
long long m[500002];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
int n,k,a,b,i;
long long sol=0;
scanf("%d%d%d%d",&n,&k,&a,&b);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
for(i=1;i<=n;i++)
{
s[i]=s[i-1]+v[i];
s[i]=s[i]%k;
}
for(i=1;i<=n;i++)
{
if(i-a>=0)
m[s[i-a]]++;
if(i-b>0)
m[s[i-b-1]]--;
sol+=m[s[i]];
}
printf("%lld\n",sol);
return 0;
}
