Sereja and Number Division 2

CodeChefRating 3723Open on judge ↗

Sereja has an integer number A that doesn't contain zeroes in its decimal form. Also he has N integers B[1], B[2], ..., B[N]. Let us first define function f for a number A as follows. . Now he has to reorder the digits of A such that f(A) is minimum. Please help him in finding most optimal A. Input - First line contain a single integer T denoting number of test cases. Then T tests fol

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