Cod sursa(job #1397263)
| Utilizator | Data | 23 martie 2015 13:08:02 | |
|---|---|---|---|
| Problema | Divk | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<cstdio>
using namespace std;
int ans,i,s[500001],k,a,b,n,x,rest[100002];
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);
s[i]=s[i-1]+x;
s[i]%=k;
if(i>=a&&i<=b)
{
rest[s[i]]++;
}
}
for(i=0;i+a<=n;i++)
{
x=s[i];
ans+=rest[x];
rest[s[i+a]]--;
if(i+b<n)
{
++rest[s[i+b+1]];
}
}
printf("%d\n",ans);
return 0;
}
