diff options
Diffstat (limited to 'python/problems/dictionaries/successors/sl.py')
-rw-r--r-- | python/problems/dictionaries/successors/sl.py | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/python/problems/dictionaries/successors/sl.py b/python/problems/dictionaries/successors/sl.py new file mode 100644 index 0000000..e92e2d7 --- /dev/null +++ b/python/problems/dictionaries/successors/sl.py @@ -0,0 +1,35 @@ +import server +mod = server.problems.load_language('python', 'sl') + + +id = 20609 +name = 'Nasledniki (družinsko drevo 4)' + +description = '''\ +<p> +Napišite funkcijo <code>successors(tree, name)</code>, +ki vrne seznam vseh naslednikov osebe. +</p> + +<p> +Družinsko drevo <code>tree</code> je slovar, kjer ključi predstavljajo imena +staršev, vrednosti pa so njihovi otroci. Primer: +<pre> +>>> tree = {'renee': ['rob', 'bob'], 'ken': ['suzan'], 'rob': ['jim'], + 'sid': ['rob', 'bob'], ... , 'bob': ['mary', 'tom', 'judy']} +>>> successors(tree, 'tom') +['ken', 'suzan'] +>>> successors(tree, 'sid') +['rob', 'bob', 'jim', 'mary', 'tom', 'judy', 'ken', 'suzan'] +</pre> +</p> +''' + +plan = [] + +hint = { + 'final_hint': ['''\ +<p>Program je pravilen! <br> +</p> +'''], +} |