From 12378810ee9207536bfa0c264c1bf2a2b0296171 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Martin=20Mo=C5=BEina?= <martin.mozina@fri.uni-lj.si>
Date: Wed, 24 Aug 2016 15:32:22 +0200
Subject: Added several new exercises for Python (related to dictionaries and
 sets).

---
 python/problems/dictionaries/successors/sl.py | 35 +++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 python/problems/dictionaries/successors/sl.py

(limited to 'python/problems/dictionaries/successors/sl.py')

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>
+'''],
+}
-- 
cgit v1.2.1