Cod sursa(job #2515474)
Utilizator | Ciocoiu Vlad vlad082002 | Data | 28 decembrie 2019 17:33:20 |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int n, k, a, b, x, s[500010], v[100010];
long long res;
void citire() {
fin >> n >> k >>a >> b;
for(int i = 1; i <= n; i++) {
fin >> x;
s[i] = (s[i-1]+x)%k;
}
}
void solve() {
for(int i = 1; i <= n; i++) {
if(i > b)
v[s[i-b-1]]--;
if(i+1 > a)
v[s[i-a]]++;
res += v[s[i]];
}
fout << res;
}
int main() {
citire();
solve();
}