← All problemsSign in

K-Subarrays

CodeChefRating 1663Open on judge ↗

You are given an array $A$ of $N$ **positive** integers. Let $G$ be the [gcd](https://en.wikipedia.org/wiki/Greatest_common_divisor) of all the numbers in the array $A$. You have to find if there exist $K$ **non-empty**, **non-intersecting** subarrays of $A$ for which the [arithmetic mean](https://en.wikipedia.org/wiki/Arithmetic_mean) of the gcd of those $K$ subarrays equals $G$. Formally, le

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start