← All problemsSign in

L for LCM

Omkar is at a party, he wants to eat cakes but the cake is being served in a peculiar manner. The cakes are lined up in a row, each is numbered from **1** to **N**.   There are some rules at the party: - Each member can take **2** cakes only. - Each member is given a number **K**, he can select only those cakes whose LCM is **K** and their multiplication is also **K**.   In other wor

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