summaryrefslogtreecommitdiff
path: root/python/problems/functions
diff options
context:
space:
mode:
authorTimotej Lazar <timotej.lazar@fri.uni-lj.si>2015-12-14 21:08:07 +0100
committerTimotej Lazar <timotej.lazar@fri.uni-lj.si>2015-12-14 21:08:07 +0100
commit8869415c08615f8aa2d4f8adbb598d8d436f3e5c (patch)
treef8efd2430f7220dd13c3d8e6905f2a0553ab8cc0 /python/problems/functions
parent0aa5a6d59744727f8f486f35f1501aab87e4c529 (diff)
Remove empty plan messages from Python problems
Diffstat (limited to 'python/problems/functions')
-rw-r--r--python/problems/functions/divisors/sl.py6
-rw-r--r--python/problems/functions/divisors_sum/sl.py6
-rw-r--r--python/problems/functions/friendly_numbers/sl.py6
-rw-r--r--python/problems/functions/palindrome/sl.py6
-rw-r--r--python/problems/functions/palindromic_numbers/sl.py6
-rw-r--r--python/problems/functions/perfect_numbers/sl.py6
-rw-r--r--python/problems/functions/prime_numbers/sl.py6
7 files changed, 7 insertions, 35 deletions
diff --git a/python/problems/functions/divisors/sl.py b/python/problems/functions/divisors/sl.py
index 76b0917..f0e25c4 100644
--- a/python/problems/functions/divisors/sl.py
+++ b/python/problems/functions/divisors/sl.py
@@ -12,11 +12,7 @@ description = '''\
<p>
Napiši funkcijo <code>divisors(n)</code>, ki izpiše vse delitelje števila (brez samega sebe), ki ga vnese uporabnik.</p>'''
-plan = ['''\
-<p></p>
-''',
- '''\
-<p></p>''']
+plan = []
hint = {
'final_hint': ['''\
diff --git a/python/problems/functions/divisors_sum/sl.py b/python/problems/functions/divisors_sum/sl.py
index 47b8719..31cd369 100644
--- a/python/problems/functions/divisors_sum/sl.py
+++ b/python/problems/functions/divisors_sum/sl.py
@@ -13,11 +13,7 @@ description = '''\
Napiši funkcijo <code>divisors_sum(n)</code>, ki vrne vsoto vseh deliteljev števila, ki ga vnese uporabnik.
</p>'''
-plan = ['''\
-<p></p>
-''',
- '''\
-<p></p>''']
+plan = []
hint = {
'final_hint': ['''\
diff --git a/python/problems/functions/friendly_numbers/sl.py b/python/problems/functions/friendly_numbers/sl.py
index 51d47ae..dd15e0d 100644
--- a/python/problems/functions/friendly_numbers/sl.py
+++ b/python/problems/functions/friendly_numbers/sl.py
@@ -23,11 +23,7 @@ None
</p>
<p> Uporabite funkcijo za vsoto deliteljev!</p>'''
-plan = ['''\
-<p></p>
-''',
- '''\
-<p></p>''']
+plan = []
hint = {
'final_hint': ['''\
diff --git a/python/problems/functions/palindrome/sl.py b/python/problems/functions/palindrome/sl.py
index e005057..9b064dd 100644
--- a/python/problems/functions/palindrome/sl.py
+++ b/python/problems/functions/palindrome/sl.py
@@ -19,11 +19,7 @@ False
</pre>
</p>'''
-plan = ['''\
-<p></p>
-''',
- '''\
-<p></p>''']
+plan = []
hint = {
'final_hint': ['''\
diff --git a/python/problems/functions/palindromic_numbers/sl.py b/python/problems/functions/palindromic_numbers/sl.py
index 8d64bab..db9a062 100644
--- a/python/problems/functions/palindromic_numbers/sl.py
+++ b/python/problems/functions/palindromic_numbers/sl.py
@@ -17,11 +17,7 @@ ki ga lahko dobimo kot produkt dveh tromestnih števil.
Vir: Project Euler, <a href="http://projecteuler.net/index.php?section=problems&id=4">Problem 4</a>.
</p>'''
-plan = ['''\
-<p></p>
-''',
- '''\
-<p></p>''']
+plan = []
hint = {
'final_hint': ['''\
diff --git a/python/problems/functions/perfect_numbers/sl.py b/python/problems/functions/perfect_numbers/sl.py
index a354a17..156b41d 100644
--- a/python/problems/functions/perfect_numbers/sl.py
+++ b/python/problems/functions/perfect_numbers/sl.py
@@ -16,11 +16,7 @@ Primer popolnega števila je 28, saj so njegovi delitelji 1, 2, 4, 7, 14, njihov
</p>
<p> Uporabite funkcijo za vsoto deliteljev!</p>'''
-plan = ['''\
-<p></p>
-''',
- '''\
-<p></p>''']
+plan = []
hint = {
'final_hint': ['''\
diff --git a/python/problems/functions/prime_numbers/sl.py b/python/problems/functions/prime_numbers/sl.py
index f6c6b24..a224696 100644
--- a/python/problems/functions/prime_numbers/sl.py
+++ b/python/problems/functions/prime_numbers/sl.py
@@ -13,11 +13,7 @@ description = '''\
Napišite funkcijo <code>prime(n)</code>, ki izpiše vsa praštevila manjša od <code>n</code>.
</p>'''
-plan = ['''\
-<p></p>
-''',
- '''\
-<p></p>''']
+plan = []
hint = {
'final_hint': ['''\