Maximum Difference

CodeChefOpen on judge ↗

100 POINTS Anubhav chooses two N-digit integers with equal sums of digits. He wants to do it so that difference between them is maximal. Help Anubhav to make a choice. Input The first line contains T, the number of test cases. Each of the next t lines has an integer N. Output For each test case- Output a single integer in a new line — the maximal difference between N-digit numbers with equal

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