Cod sursa(job #2396062)
Utilizator | Data | 3 aprilie 2019 10:41:40 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
long long v[500005], d[100005];
int main()
{
int n, k, a, b, x;
long long s = 0;
fin >> n >> k >> a >> b;
for (int i = 1; i <= n; i++)
{
fin >> x;
v[i] = v[i - 1] + x;
}
for (int i = 1; i <= n; i++)
{
d[v[i] % k]++;
if (i - b + a - 1 > 0)
d[v[i - b + a - 1] % k]--;
if (i + a - 1 > n)
break;
else
s += d[v[i + a - 1] % k];
}
fout << s << '\n';
return 0;
}