Cod sursa(job #2286553)
Utilizator | Data | 20 noiembrie 2018 14:35:13 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
const std :: string programName = "divk";
std :: ifstream f(programName + ".in");
std :: ofstream g(programName + ".out");
const int NMAX = 5E5;
int main(void) {
int N, K, A, B, dp[NMAX + 5], cnt = 0;
f >> N >> K >> A >> B;
for (int i = 1; i <= N; ++i) {
int nr;
f >> nr;
dp[i] = nr + dp[i - 1];
}
for (int i = 1; i <= N; ++i) {
for (int j = A; j <= B and i - j >= 0; ++j) {
int s = dp[i] - dp[i - j];
if (not(s % K))
++cnt;
}
}
g << cnt;
return 0x0;
}