Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream cin("divk.in");
- ofstream cout("divk.out");
- long long n, k, a, b, v[500001], p[500001], sol;
- int main()
- {
- cin >> n >> k >> a >> b;
- for (int i = 1; i <= n; ++i)
- cin >> v[i], p[i] = p[i - 1] + v[i];
- for (int i = 1; i <= n - a + 1; ++i)
- {
- for (int j = a; j <= b; ++j)
- {
- if (i + j - 1 <= n)
- {
- if ((p[i + j - 1] - p[i - 1]) % k == 0)
- ++sol;
- }
- }
- }
- cout << sol;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement