Cod sursa(job #1827985)
Utilizator | Data | 12 decembrie 2016 17:34:11 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int a,b,n,k,x,i;
long long ans,w[500005],v[500005];
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1; i<=n; i++)
{
f>>x;
w[i]=(w[i-1]+x)%k;
if(i>=a)
v[w[i-a]]++;
if(i>b)
v[w[i-b-1]]--;
ans+=1LL*v[w[i]];
}
g<<ans<<"\n";
f.close(); g.close();
return 0;
}