$7\mathrm{.}6\mathrm{.}2$: Recursive exploration of all possibilities.

$3828283774112932947$

Jump to level $1$

Strings are read from input and stored in list names$\_$to$\_$pick. The recursive function order$\_$names$()$ explores all possible

arrangements of the names in names$\_$to$\_$pick. In order$\_$names$().$ write the base case to output each element in list picked$\_$names

if the size of list remain$\_$names is $0.$ Output a space after each element. Keep the output of the explored combination in one line.

Click here for example

def order$\_$names$($remain$\_$names, picked$\_$names$)$:

else:

for i$,$ val in enumerate$($remain$\_$names$)$:

new$\_$remain $=$ remain$\_$names $[$:$i]+$remain names $i+1$:

new$\_$picked $=$ picked$\_$names $+[val]$

order$\_$names$($new$\_$remain, new$\_$picked$)$

names to pick $=[]$

picks $=[1]$

for token in input$().$ split$()$:

names to pick.append $($token$)$

print$(\text{'}$Al $\frac{?}{\text{b}\text{a}\text{r}}(1)$ possible arrangements:$\text{'})$

order$\_$names $($names$\_$to$\_$pick, picks$)$