total descendants:: total children::0 |
na to nepotrebujes lambdu :) def fm(x): return [[x[0]]+y for y in fm(x[1:])] + fm(x[1:]) if x else [[]]len som to tam tak nejak zo zotrvacnosti... |
There are currently 10189 K available in get 1 🦆 for 5 🐘 get 1 🐘 for 1 🦆 |
|||||||||||||||||||||||||