Pagini recente » Cod sursa (job #3334298) | Cod sursa (job #2665022) | Cod sursa (job #2295515) | Cod sursa (job #925827) | Cod sursa (job #3314676)
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int sp[500001];
int fr[100001];
int main()
{
int n, k, a, b;
int64_t rez = 0;
fin >> n >> k >> a >> b;
for (int i = 1; i <= n; ++i)
{
int x;
fin >> x;
sp[i] = (sp[i - 1] + x) % k;
if (i - a >= 0)
++fr[sp[i - a]];
if (i - b - 1 >= 0)
--fr[sp[i - b - 1]];
rez += fr[sp[i]];
}
fout << rez;
return 0;
}