All binary numbers of length n that contain k 1s#3952
Given two integers, and , your task is to generate all binary strings of length that contain exactly ones. The output should be in lexicographical order.
You will receive two integers: and , where 0 \le K \le N and 0 \le N \le 100.
Produce all binary strings of length with exactly ones, sorted in lexicographical order. The total size of the output will not exceed megabytes.
Example 1