From 7217e23268eb28b2e6e745b74f697b4a1581658c Mon Sep 17 00:00:00 2001
From: Timotej Lazar
Napiši funkcijo divisors(n)
, ki izpiše vse delitelje števila (brez samega sebe), ki ga vnese uporabnik.divisors_sum(n)
, ki vrne vsoto vseh deliteljev števila, ki ga vnese uporabnik.
Uporabite funkcijo za vsoto deliteljev!
''' -plan = ['''\ - -''', - '''\ -'''] +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 ''' -plan = ['''\ - -''', - '''\ -'''] +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, Problem 4. ''' -plan = ['''\ - -''', - '''\ -'''] +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, njihovUporabite funkcijo za vsoto deliteljev!
''' -plan = ['''\ - -''', - '''\ -'''] +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 funkcijoprime(n)
, ki izpiše vsa praštevila manjša od n
.
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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 s
vsebuje le male črke angleške besed
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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 True
in za drugega False
.
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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 largest_sublist
, ki vrne podseznam z največjo vso
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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 [7, 4, 0, 10, 4]
, saj je,
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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 [f(x_1), f(x_2), ..., f(x_n)]
.
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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 mrange(start, factor, length)
, ki vrne seznam, k
'''
-plan = ['''\
-
-''',
- '''\
-''']
+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.
'''
-plan = ['''\
-
-''',
- '''\
-''']
+plan = []
hint = {
'final_hint': ['''\
--
cgit v1.2.1