summaryrefslogtreecommitdiff
path: root/python/problems/lists_and_for/divisors
diff options
context:
space:
mode:
authorMartin <martin@leo.fri1.uni-lj.si>2015-10-08 12:02:43 +0200
committerMartin <martin@leo.fri1.uni-lj.si>2015-10-08 12:02:43 +0200
commit45474b5c8cefa916aeb64e1c15a79f647a86d58c (patch)
treee8df83544ed4da18f1288fee3bf0506069eab4e8 /python/problems/lists_and_for/divisors
parent1f9f6de923e4b490c42a44d660b3e32dbe11426e (diff)
Added final hints.
Diffstat (limited to 'python/problems/lists_and_for/divisors')
-rw-r--r--python/problems/lists_and_for/divisors/sl.py9
1 files changed, 5 insertions, 4 deletions
diff --git a/python/problems/lists_and_for/divisors/sl.py b/python/problems/lists_and_for/divisors/sl.py
index 5ba36e1..cddeae8 100644
--- a/python/problems/lists_and_for/divisors/sl.py
+++ b/python/problems/lists_and_for/divisors/sl.py
@@ -74,15 +74,16 @@ hint = {
'last_number': ['''\
<p>Število deli samega sebe!</p>'''],
- 'final_hint:': ['''\
+ 'final_hint': ['''\
<p>Naloga rešena!</p>
- <p>Dejansko ne potrebujemo pregledati vseh števil med <code>1</code> in </code>n-1</code>,
+ <p>Dejansko ne potrebujemo pregledati vseh števil med <code>1</code> in <code>n-1</code>,
dovolj bo če gremo do kvadratnega korena od števila <code>n</code>:</p>
<pre>
-from math import sqrt
+from math import *
+
n = int(input('Vnesi število: '))
-for i in range(1, sqrt(n)+1):
+for i in range(1, int(sqrt(n)+1)):
if n % i == 0:
print(i, n/i)
</pre>'''],