WrenchvChloe

CodeChefOpen on judge ↗

Problem description Wrench and Chloe decided to determine which one of them is better at math. Wrench claimed that for any positive integer n he can represent fraction 2n as a sum of three distinct positive fractions in form (1/m). Help Wrench with that, i.e for a given n find three distinct positive integers x, y and z such that: (2/n) = (1/x) + (1/y) + (1/z). Because Chloe can't check Wrenc

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