Minimum Number

CodeChefOpen on judge ↗

Walter White gave Pinkman an integer number $x$. Pinkman isn't good at numbers but he loves inverting digits in them. Inverting digit $t$ means replacing it with digit $9 - t$. Help Pinkman to transform the initial number $x$ to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero. ###Input

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