Not that Digit

CodeChefOpen on judge ↗

Majin wants to label his N (1 If the towers are labeled with the smallest set of N positive integers that don't have the digit L, what is the largest number that Majin will label the tower as ? Input The first line has an integer 't' (1 Each test case containse two space-separated integers on a single line: N and L Output A single integer that is the largest number a tower can have. Example

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