Lexicographically Largest

CodeChefRating 2151Open on judge ↗

You are given a positive integer $M$ and an array $A \ (1\leq A_i \leq M)$ consisting of $N$ positive integers. Find the **lexicographically largest** array $B$ such that: - $|B|=N$; - $1 \leq B_i \leq M$ for all $1 \leq i \leq N$; - $A_i = \gcd(B_1, B_2, \ldots, B_i)$, where $\gcd$ denotes the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor). Note that the input

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