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