Pagini recente » Cod sursa (job #2428186) | Cod sursa (job #1323762) | Cod sursa (job #1940108) | Cod sursa (job #192706) | Cod sursa (job #1328480)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <map>
#include <vector>
#define punct pair<int,int>
#define eps 0.0000000000001
#define MOD 1000000007
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int v[500001];
int fv[100001],i,j,n,m,A,B,k,x,mod;
long long int rasp;
int main()
{
/*ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
ifstream cin(".in");
ofstream cout(".out");
#endif*/
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)
{
++fv[v[i-A]];
if (i>B)
--fv[v[i-B+1]];
rasp+=fv[v[i]];
}
g<<rasp;
return 0;
}