Cod sursa(job #2107496)
Utilizator | VasileOctavian OctavianVasile | Data | 17 ianuarie 2018 12:28:38 |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin ("divk.in");
ofstream fout ("divk.out");
int x, n, k, a, b, i, j;
int s[500001];
long long sol, f1[500001], f2[500001];
int main()
{
fin >> n >> k >> a >> b;
for (i = 1; i <= n; i++)
{
fin >> x;
s[i] = (s[i-1]+x)%k;
if (i >= a)
f1[s[i-a]]++;
if (i > b)
f2[s[i-b-1]]++;
sol += f1[s[i]] - f2[s[i]];
}
fout << sol;
return 0;
}