diff options
author | Martin <martin@leo.fri1.uni-lj.si> | 2015-10-09 11:17:49 +0200 |
---|---|---|
committer | Martin <martin@leo.fri1.uni-lj.si> | 2015-10-09 11:17:49 +0200 |
commit | 84f3426c937d1bb9d44ba25a71706416fbb8b85d (patch) | |
tree | 84b064c8150b6bbd3422fb2c91c6121e0a01902c /python/problems/functions/palindromic_numbers/sl.py | |
parent | 45474b5c8cefa916aeb64e1c15a79f647a86d58c (diff) |
Added several new problems.
They have no tests nor hints implemented.
Diffstat (limited to 'python/problems/functions/palindromic_numbers/sl.py')
-rw-r--r-- | python/problems/functions/palindromic_numbers/sl.py | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/python/problems/functions/palindromic_numbers/sl.py b/python/problems/functions/palindromic_numbers/sl.py new file mode 100644 index 0000000..8d64bab --- /dev/null +++ b/python/problems/functions/palindromic_numbers/sl.py @@ -0,0 +1,31 @@ +# coding=utf-8 +import server +mod = server.problems.load_language('python', 'sl') + + +id = 229 +name = 'Palindromska števila' +slug = 'Palindromska števila' + + +description = '''\ +<p> +Največje palindromsko število, ki ga lahko dobimo kot produkt dveh dvomestnih števil je <code>9009 = 91 * 99</code>. +Napišite funkcijo <code>palindromic_number()</code>, ki poišče in vrne največje palindromsko število, +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>'''] + +hint = { + 'final_hint': ['''\ +<p>Program je pravilen! <br> +</p> +'''], +} |