Cod sursa(job #1129549)
Utilizator | Data | 27 februarie 2014 23:04:41 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
long long v[500001],r[500001];
int n,m,a,b,i,x;
long long s;
int main()
{
f>>n>>m>>a>>b;
for (i=1;i<=n;i++)
{
f>>x;
v[i]=(v[i-1]+x)%m;
if (i>=a)
++r[v[i-a]];
if (i>b)
--r[v[i-b-1]];
s+=r[v[i]];
}
g<<s;
f.close();
g.close();
}