Minimum Pair

CodeChefOpen on judge ↗

Rushik is interested in the properties of LCM. $LCM(x, y)$ is defined as the smallest number divisible by both $x$ and $y$. He has a question on LCMs and he wants you to find a solution. You are given two integers $l$ and $r$. Find two integers $x$ and $y$ such that $l \leq x \lt y \leq r$ and $l \leq x + y \leq r$ and $(x * y) / LCM(x, y)$ is *minimum possible.* If there are multiple solutions

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