Problem 1689 · Medium

Partitioning Into Minimum Number Of Deci-Binary Numbers

Find the fewest deci-binary numbers, each made of digits zero and one, whose sum is n. The visual stacks rows of zero-and-one digits and the maximum digit sets the row count.

Open the interactive visualisation