Holt & Numbers

CodeChefOpen on judge ↗

Captain Holt’s old C.O. has yet again given him a new puzzle on their recent meeting, Holt was not able to solve his last puzzle and his old C.O. is still giving him grief over it. The new puzzle is much easier than the last one, he has been tasked to find the number of pairs ($X$,$Y$) of positive integers less than or equal to $M$ such that the first digit of $Y$ is equal to the last digit of $X

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