Pagini recente » Cod sursa (job #1583338) | Istoria paginii runda/forest_sprint_two_thousand_eleven/clasament | Cod sursa (job #1500849) | Cod sursa (job #984592) | Cod sursa (job #1141569)
#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();
}