Searching 0 and 1 in si?

Question

Programming

It is necessary to go through all possible combinations of 0 and 1, for example, we enter the number 2, the output is
0 0,
0 1,
1 0,
1 1
, and so on for any number

Answer 1

Normal loop, from zero to 2 to the power of the specified number (not including the upper bound), in increments of one. The desired combinations of zeros and ones are binary representations of the cycle counter.

Answer 2

We enter n
Run the loop i from 0 to 2 ⁿ - 1
In the loop, each i is output in binary representation.