summaryrefslogtreecommitdiff
path: root/python/problems/dictionaries/family/sl.py
diff options
context:
space:
mode:
authorMartin Možina <martin.mozina@fri.uni-lj.si>2016-12-05 11:48:15 +0100
committerMartin Možina <martin.mozina@fri.uni-lj.si>2016-12-05 11:48:15 +0100
commit413bb73adaee77e8c1ab1c5721b13d9b6f756a7a (patch)
treeea922b5e9ef933cc5f97c303cadd820a19a0f80f /python/problems/dictionaries/family/sl.py
parentb9e78f3b26f3a6bc8ffd0ad2a2eeeba7184b51af (diff)
Fix some instructions.
Diffstat (limited to 'python/problems/dictionaries/family/sl.py')
-rw-r--r--python/problems/dictionaries/family/sl.py3
1 files changed, 2 insertions, 1 deletions
diff --git a/python/problems/dictionaries/family/sl.py b/python/problems/dictionaries/family/sl.py
index 2a572d3..2eaff15 100644
--- a/python/problems/dictionaries/family/sl.py
+++ b/python/problems/dictionaries/family/sl.py
@@ -33,7 +33,8 @@ Za lažje razumevanje si relacije predstavimo s sliko:
<p>
Napišite funkcijo <code>family_tree(family)</code>, ki sprejeme seznam
v katerem je spravljeno družinsko drevo in vrne slovar v katerem je za vsakega
-starša spravljen seznam vseh njegovih otrok.</p>
+starša spravljen seznam vseh njegovih otrok. Vrstni red otrok naj bo
+enak vrstnem redu otrok v začetnem seznamu. </p>
<pre>
>>> family_tree(family)
{'renee': ['rob', 'bob'],