Cod sursa(job #2540200)
Utilizator | Data | 6 februarie 2020 20:40:09 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
#define newline '\n'
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
///************************
const int NMAX = 5e5 + 5;
uint64_t n, k, a, b, v[NMAX], fr[NMAX], ans;
int main()
{
fin >> n >> k >> a >> b;
for (int i = 1; i <= n; i++)
{
fin >> v[i];
v[i] = (v[i - 1] + v[i]) % k;
if (i >= a)
fr[v[i]]++;
if (i > b)
fr[v[i]]--;
ans += fr[v[i - a]];
}
fout << ans - 1;
fout.close();
return 0;
}