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