summaryrefslogtreecommitdiff
path: root/python/problems/functions/divisors_sum
diff options
context:
space:
mode:
authorMartin Možina <martin.mozina@fri.uni-lj.si>2015-12-28 10:59:12 +0100
committerMartin Možina <martin.mozina@fri.uni-lj.si>2015-12-28 10:59:12 +0100
commit7e3c3602f1c1619fc1666bc2a21179530a99f3f1 (patch)
tree9e9daa3f800357a6d5bbcc0f6262bb5d850ae33f /python/problems/functions/divisors_sum
parent165c7165bb2184c9c9e0576a074ba4f29052bf8f (diff)
Added basic plans to three problems.
Diffstat (limited to 'python/problems/functions/divisors_sum')
-rw-r--r--python/problems/functions/divisors_sum/sl.py4
1 files changed, 3 insertions, 1 deletions
diff --git a/python/problems/functions/divisors_sum/sl.py b/python/problems/functions/divisors_sum/sl.py
index 31cd369..f06b1dd 100644
--- a/python/problems/functions/divisors_sum/sl.py
+++ b/python/problems/functions/divisors_sum/sl.py
@@ -13,7 +13,9 @@ description = '''\
Napiši funkcijo <code>divisors_sum(n)</code>, ki vrne vsoto vseh deliteljev števila, ki ga vnese uporabnik.
</p>'''
-plan = []
+plan = ['''\
+<p>Ideja je ista kot pri izpisu vseh deliteljev. Tu števil ne
+izpisujemo, temveč jih prištevamo vsoti in vsoto na koncu vrnemo.</p>''']
hint = {
'final_hint': ['''\