Extended Obsession

CodeChefOpen on judge ↗

$Scube$ tried whole night to make a question but he was unable to make any good question, so he decided to extend the question $"Obsession"$ asked in the previous round.In that question, you had to make the numbers using $1$ and $0$ only. Here you will be given a number $N$ and a digit $K$ and you have you find the smallest multiple of $N$ that consists only of digit $K$ and $0$. ###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