Permutation and GCD Set
### Read problems statements in [Russian](https://www.codechef.com/download/translated/COOK133/russian/PGCDS.pdf). We define the *GCD set* of an array $A$ of length $N$ as the set containing the GCD of all prefixes of $A$. More formally, the GCD set $G$ of $A$ contains the values $\gcd([A_1]), \gcd([A_1, A_2]), \gcd([A_1, A_2, A_3]), \ldots, \gcd([A_1, A_2, \ldots, A_n])$, where $\gcd(B)$ is the
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.
Sign in to chat with the tutor and save your progress.
Sign in to start