Cod sursa(job #2503541)
| Utilizator | Data | 3 decembrie 2019 13:02:54 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <iostream>
#define NMAX 500000
#define KMAX 100000
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n, k, a, b;
long long sp[NMAX+10], nr[KMAX+10], sol;
int main()
{
f >> n >> k >> a >> b;
for(int i=1; i<=n; i++)
{ long long x;
f >> x;
sp[i] = (sp[i-1] + x) % k;
if(i >= a)
{ nr[sp[i-a]]++;
if(i > b) nr[sp[i-b-1]]--;
sol += nr[sp[i]];
}
}
g << sol << '\n';
return 0;
}
