Cod sursa(job #1129533)
Utilizator | Data | 27 februarie 2014 22:58:52 | |
---|---|---|---|
Problema | Divk | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,v[500001],a,b,i,x,q[500001],j,nr;
long long s;
int main()
{
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
f>>x;
s=x+v[i-1];
v[i]=s%k;
}
for(i=1;i<=n;i++)
{
if (i>=a)
++q[v[i-a]];
if (i>b)
--q[v[i-b-1]];
nr+=q[v[i]];
}
g<<nr;
f.close();
g.close();
}