Cod sursa(job #1489285)
Utilizator | Lucian Trepteanu LucianT | Data | 20 septembrie 2015 22:03:35 |
---|---|---|---|
Problema | Divk | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <cstdio>
#define maxN 500005
using namespace std;
int n,i,k,a,b,v[maxN],s[maxN],fr[maxN];
long long rasp;
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",&v[i]),s[i]=(s[i-1]+v[i])%k;
if(i>=a) fr[s[i-a]]++;
if(i>b) fr[s[i-b-1]]--;
rasp+=fr[s[i]];
}
printf("%d",rasp);
return 0;
}