Cod sursa(job #1778358)
Utilizator | Data | 13 octombrie 2016 18:43:37 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int a,b,n,k,x;
long long ans,s[500010],v[500010];
int main()
{
f>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
f>>x;
s[i]=(s[i-1]+x)%k;
if(i>=a)
v[s[i-a]]++;
if(i>b)
v[s[i-b-1]]--;
ans+=1LL*v[s[i]];
}
g<<ans<<"\n";
return 0;
}