Passionate LCM

CodeChefOpen on judge ↗

Siddharth is so much passionate about the number 3. So he wants to find 3 integers such that their sum should be n and their LCM should be less than equal to half of their sum. You need to help him find those numbers. Here LCM is the least common multiple of numbers. We can show that answer always exists for given constraints. ### Input The first line contains a single integer $t$ - the numb

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