Jon and Samedonic Numbers

CodeChefOpen on judge ↗

Jon like numbers which is formed using a same decimal digit. He calls them **Samedonic Number**. He is given a number $N$ of $D$ digits formed using at most 2 distinct decimal digits. He wants to make that number a **Samedonic Number** using the below operation any number of times. -> In one operation he can choose a **segment of same digits** and change them to a segment of any specific decima

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