Special Multiple

CodeChefOpen on judge ↗

You are given an integer N. Can you find the least positive integer X made up of only 9's and 0's, such that, X is a multiple of N? ###Update X is made up of one or more occurences of 9 and zero or more occurences of 0. ###Input: The first line contains an integer T which denotes the number of test cases. T lines follow. Each line contains the integer N for which the solution has to be found. #

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