summaryrefslogtreecommitdiff
path: root/python/problems/comprehensions/sumsquares_palindrome/sl.py
diff options
context:
space:
mode:
authorMartin Možina <martin.mozina@fri.uni-lj.si>2016-09-27 16:38:23 +0200
committerMartin Možina <martin.mozina@fri.uni-lj.si>2016-09-27 16:38:23 +0200
commitfc34673e84ea9bc823e8530c7564f0caa6a99000 (patch)
tree71f45925be60c9fde7a438a4835c53ee261e2ad9 /python/problems/comprehensions/sumsquares_palindrome/sl.py
parent01eb98c7a5e86325e1243f0d0f4e111a18d1e535 (diff)
Added exercises with list comprehensions.
Diffstat (limited to 'python/problems/comprehensions/sumsquares_palindrome/sl.py')
-rw-r--r--python/problems/comprehensions/sumsquares_palindrome/sl.py36
1 files changed, 36 insertions, 0 deletions
diff --git a/python/problems/comprehensions/sumsquares_palindrome/sl.py b/python/problems/comprehensions/sumsquares_palindrome/sl.py
new file mode 100644
index 0000000..bf855f5
--- /dev/null
+++ b/python/problems/comprehensions/sumsquares_palindrome/sl.py
@@ -0,0 +1,36 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+id = 20702
+name = 'Vsota kvadratov palindromskih števil'
+
+description = '''\
+<p>
+Napišite funkcijo <code>ss_palindrome(n)</code>, ki izračuna in vrne vsoto vseh
+palindromskih števil manjših do števila <code>n</code>. Če je <code>n=1000</code>,
+potem: </p>
+<p>1<sup>2</sup> + 2<sup>2</sup> + ... +
+323<sup>2</sup> + 333<sup>2</sup> + 343<sup>2</sup> + ... + 999<sup>2</sup> = ?</p>
+'''
+
+plan = []
+
+hint = {
+ 'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+
+ 'no_comprehension': ['''\
+<p>Program je sicer pravilen, vendar ne vsebuje izpeljanih seznamov ali
+generatorjev...
+</p>
+'''],
+
+ 'has_loop': ['''\
+<p>Program je sicer pravilen, vendar vsebuje zanko.
+</p>
+'''],
+
+}