Cod sursa(job #3314673)
| Utilizator | Data | 10 octombrie 2025 17:39:27 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int64_t 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;
}