From 84f3426c937d1bb9d44ba25a71706416fbb8b85d Mon Sep 17 00:00:00 2001
From: Martin <martin@leo.fri1.uni-lj.si>
Date: Fri, 9 Oct 2015 11:17:49 +0200
Subject: Added several new problems.

They have no tests nor hints implemented.
---
 .../functions/palindromic_numbers/common.py        | 49 ++++++++++++++++++++++
 .../problems/functions/palindromic_numbers/en.py   | 16 +++++++
 .../problems/functions/palindromic_numbers/sl.py   | 31 ++++++++++++++
 3 files changed, 96 insertions(+)
 create mode 100644 python/problems/functions/palindromic_numbers/common.py
 create mode 100644 python/problems/functions/palindromic_numbers/en.py
 create mode 100644 python/problems/functions/palindromic_numbers/sl.py

(limited to 'python/problems/functions/palindromic_numbers')

diff --git a/python/problems/functions/palindromic_numbers/common.py b/python/problems/functions/palindromic_numbers/common.py
new file mode 100644
index 0000000..ba518c7
--- /dev/null
+++ b/python/problems/functions/palindromic_numbers/common.py
@@ -0,0 +1,49 @@
+# coding=utf-8
+
+import re
+from python.util import has_token_sequence, string_almost_equal, \
+    string_contains_number, get_tokens, get_numbers, get_exception_desc
+from server.hints import Hint
+
+id = 229
+group = 'functions'
+number = 8
+visible = True
+
+solution = '''\
+def palindromic_numbers():
+    xs = []
+    for i in range(100, 1000):
+        for j in range(100, 1000):
+            if str(i * j) == str(i * j)[::-1]:
+                xs.append(i * j)
+    return max(xs)
+'''
+
+hint_type = {
+    'final_hint': Hint('final_hint')
+}
+
+def test(python, code):
+    test_in = [1]
+    n_correct = 0
+
+    passed = n_correct == len(test_in)
+    tin = None
+    tout = None
+    hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_in)}}]
+    if tin:
+        hints.append({'id': 'problematic_test_case', 'args': {'testin': str(tin), 'testout': str(tout)}})
+    if passed:
+        hints.append({'id': 'final_hint'})
+    return passed, hints
+
+def hint(python, code):
+    tokens = get_tokens(code)
+
+    # run one test first to see if there are any exceptions
+    answer = python(code=code, inputs=[(None, None)], timeout=1.0)
+    exc = get_exception_desc(answer[0][3])
+    if exc: return exc
+
+    return None
diff --git a/python/problems/functions/palindromic_numbers/en.py b/python/problems/functions/palindromic_numbers/en.py
new file mode 100644
index 0000000..5f4ea76
--- /dev/null
+++ b/python/problems/functions/palindromic_numbers/en.py
@@ -0,0 +1,16 @@
+# coding=utf-8
+
+id = 229
+name = 'Palindromic numbers'
+slug = 'Palindromic numbers'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
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>
+'''],
+}
-- 
cgit v1.2.1