Cod sursa(job #799644)
Utilizator | Alexandru Dascalu adascalu | Data | 19 octombrie 2012 17:35:40 |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
using namespace std;
#include<vector>
#include<fstream>
#define nmax 500001
vector<long long >v(nmax),niu(nmax);
int n;
int main ()
{
int x,i,a,b,k;
long long nr=0;
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
f>>x,v[i]=(v[i-1]+x)%k;
for(i=a;i<=n;i++)
{
niu[v[i-a]]++;
if(i>b)
niu[v[i-b-1]]--;
nr+=niu[v[i]];
}
g<<nr;
f.close();
g.close();
return 0;
}