← All problemsSign in

Digit Removal

CodeChefRating 1754Open on judge ↗

You are given an integer $N$ and a digit $D$. Find the minimum non-negetive integer you should add to $N$ such that the final value of $N$ does not contain the digit $D$. ### Input - The first line contains $T$ denoting the number of test cases. Then the test cases follow. - Each test case contains two integers $N$ and $D$ on a single line denoting the original number and the digit you need to av

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

Sign in to chat with the tutor and save your progress.

Sign in to start