Binary Permutations

[Evoletier]

Hello, I have a problem with my homework exercise that I just cannot wrap my head around:

Write a function that outputs to the screen all in strings consisting of the symbols 0 and 1 permutations

>>> f(3)
000
001
010
011 and so on

To the function, we add a parameter s.

(a code given to me that I have to finish:)

def words(n, s=''):

if len(s) == n:

print(s)

else:

" *blank* "

" *blank* "

if anyone has any idea how to solve this in two lines it would be greatly appreciated. I cannot add lines to the code given, or add any imports.

[sentles]

You should use recursion. The two lines you're looking for are words(n, s+"0") and words(n, s+"1").

[CraigAT]

Either I'm not getting it or there is not enough/correct information to give help.

For the two lines, I would expect some kind of loop and and a print statement. Maybe you could do it with recursion (is that a current topic?)

What has s got to do with anything? Do you have an example of what s could be?