Return of Bowser

CodeChefOpen on judge ↗

$Bowser$ has kidnapped the princess again and now $Mario$ is on his way to save the princess from the castle of $Bowser$. However $Bowser$ has adapted his defenses now and has given a set of q difficult puzzles for $Mario$ to solve. It is as follows: Given a number $N$ consisting of digits $0...$9,$A...$Z,$a...$z , where $A=$10,$B=$11,...$Z=$35,$a=$36,$b=$37 .. and so on. Now for each of the q

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