Dustin Number

CodeChefOpen on judge ↗

Dustin loves playing with numbers. He designed a problem which he asks you to solve. The problem is as follows. You will be given a number $N$. You can perform any of the following two operations any number of times in any order. $Operation 1$: You can reverse the whole number. $Operation 2$: You can move the last digit of the number to first position. For example, let N=123 then after applyi

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