diff options
author | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2015-12-14 21:08:07 +0100 |
---|---|---|
committer | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2015-12-14 21:08:07 +0100 |
commit | 8869415c08615f8aa2d4f8adbb598d8d436f3e5c (patch) | |
tree | f8efd2430f7220dd13c3d8e6905f2a0553ab8cc0 /python/problems | |
parent | 0aa5a6d59744727f8f486f35f1501aab87e4c529 (diff) |
Remove empty plan messages from Python problems
Diffstat (limited to 'python/problems')
16 files changed, 16 insertions, 80 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': ['''\ diff --git a/python/problems/functions_and_modules/all/sl.py b/python/problems/functions_and_modules/all/sl.py index f71fa4b..e224811 100644 --- a/python/problems/functions_and_modules/all/sl.py +++ b/python/problems/functions_and_modules/all/sl.py @@ -26,11 +26,7 @@ True </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/any/sl.py b/python/problems/functions_and_modules/any/sl.py index f32e50e..ab1aacf 100644 --- a/python/problems/functions_and_modules/any/sl.py +++ b/python/problems/functions_and_modules/any/sl.py @@ -20,11 +20,7 @@ False </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/caesar_cipher/sl.py b/python/problems/functions_and_modules/caesar_cipher/sl.py index ea4d9c8..bedf403 100644 --- a/python/problems/functions_and_modules/caesar_cipher/sl.py +++ b/python/problems/functions_and_modules/caesar_cipher/sl.py @@ -21,11 +21,7 @@ Predpostavite lahko, da niz <code>s</code> vsebuje le male črke angleške besed </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/dominoes/sl.py b/python/problems/functions_and_modules/dominoes/sl.py index 41cb860..cfcee24 100644 --- a/python/problems/functions_and_modules/dominoes/sl.py +++ b/python/problems/functions_and_modules/dominoes/sl.py @@ -15,11 +15,7 @@ Vrsta domin je podana s seznamom parov (terk), na primer ki prejme takšen seznam in pove, ali so domine pravilno zložene. Za prvi seznam mora vrniti <code>True</code> in za drugega <code>False</code>. </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/largest_sublist/sl.py b/python/problems/functions_and_modules/largest_sublist/sl.py index b550ce2..c3582f0 100644 --- a/python/problems/functions_and_modules/largest_sublist/sl.py +++ b/python/problems/functions_and_modules/largest_sublist/sl.py @@ -19,11 +19,7 @@ Napiši funkcijo <code>largest_sublist</code>, ki vrne podseznam z največjo vso </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/lists_sum/sl.py b/python/problems/functions_and_modules/lists_sum/sl.py index 4baa002..88ac541 100644 --- a/python/problems/functions_and_modules/lists_sum/sl.py +++ b/python/problems/functions_and_modules/lists_sum/sl.py @@ -21,11 +21,7 @@ Za gornji seznam naj funkcija vrne seznam <code>[7, 4, 0, 10, 4]</code>, saj je, </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/map/sl.py b/python/problems/functions_and_modules/map/sl.py index 18c47fb..6695b30 100644 --- a/python/problems/functions_and_modules/map/sl.py +++ b/python/problems/functions_and_modules/map/sl.py @@ -20,11 +20,7 @@ in vrne nov seznam <code>[f(x_1), f(x_2), ..., f(x_n)]</code>. </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/multiplicative_range/sl.py b/python/problems/functions_and_modules/multiplicative_range/sl.py index 8bd4bd0..bb02a84 100644 --- a/python/problems/functions_and_modules/multiplicative_range/sl.py +++ b/python/problems/functions_and_modules/multiplicative_range/sl.py @@ -18,11 +18,7 @@ Napišite funkcijo <code>mrange(start, factor, length)</code>, ki vrne seznam, k </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ diff --git a/python/problems/functions_and_modules/suspicious_words/sl.py b/python/problems/functions_and_modules/suspicious_words/sl.py index 3bf2c7b..1aa3bdf 100644 --- a/python/problems/functions_and_modules/suspicious_words/sl.py +++ b/python/problems/functions_and_modules/suspicious_words/sl.py @@ -18,11 +18,7 @@ Beseda je sumljiva, če vsebuje tako črko u kot črko a. </pre> </p>''' -plan = ['''\ -<p></p> -''', - '''\ -<p></p>'''] +plan = [] hint = { 'final_hint': ['''\ |