Twice GCD Thrice LCM

CodeChefRating 3034Open on judge ↗

**This is an interactive problem.** Eren and Mikasa are playing a game. Mikasa has a sequence $A$ of $N$ positive integers. Eren needs to find the values of all elements of this sequence to win the game. Eren may ask **at most** $3\cdot N$ questions to Mikasa. Each question can be **one** of two types: - Type $1$: Eren gives Mikasa two **distinct** integers $i$ and $j$ $(1 \leq i, j \leq N)$

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