Cod sursa(job #2095488)
| Utilizator | Data | 27 decembrie 2017 16:34:01 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include<cstdio>
using namespace std;
int s[500001],nr[100001];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
int n,k,a,b,i,x,poz=0;
long long sol=0;
scanf("%d%d%d%d",&n,&k,&a,&b);
for(i=1;i<=n;++i)
{
scanf("%d",&x);
s[i]=(s[i-1]+x)%k;
}
for(i=a;i<=n;++i)
{
nr[s[i]]++;
if(i==b+poz)
{
sol+=1LL*nr[s[poz]];
nr[s[a+poz]]--;
poz++;
}
}
while(n>=a+poz)
{
sol+=1LL*nr[s[poz]];
nr[s[a+poz]]--;
poz++;
}
printf("%lld\n",sol);
return 0;
}
