summaryrefslogtreecommitdiff
path: root/python/problems/dictionaries/max_characters
diff options
context:
space:
mode:
authorMartin Možina <martin.mozina@fri.uni-lj.si>2016-08-24 15:32:22 +0200
committerMartin Možina <martin.mozina@fri.uni-lj.si>2016-08-24 15:32:22 +0200
commit12378810ee9207536bfa0c264c1bf2a2b0296171 (patch)
tree902e226e249a5369928e3fbc7e85739e14448b46 /python/problems/dictionaries/max_characters
parentc2e782122d52acea0e69f8a5a92b40bbbb7072e5 (diff)
Added several new exercises for Python (related to dictionaries and sets).
Diffstat (limited to 'python/problems/dictionaries/max_characters')
-rw-r--r--python/problems/dictionaries/max_characters/common.py72
-rw-r--r--python/problems/dictionaries/max_characters/en.py13
-rw-r--r--python/problems/dictionaries/max_characters/sl.py29
3 files changed, 114 insertions, 0 deletions
diff --git a/python/problems/dictionaries/max_characters/common.py b/python/problems/dictionaries/max_characters/common.py
new file mode 100644
index 0000000..cb0c4b6
--- /dev/null
+++ b/python/problems/dictionaries/max_characters/common.py
@@ -0,0 +1,72 @@
+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 = 20603
+number = 2
+visible = True
+
+solution = '''\
+def maxchars(words):
+ max_chars = 0
+ max_word = None
+ for w in words:
+ chars = len(set(w.lower()))
+ if chars > max_chars:
+ max_chars = chars
+ max_word = w
+ return max_word
+'''
+
+hint_type = {
+ 'final_hint': Hint('final_hint')
+}
+
+def test(python, code):
+ func_name = 'maxchars'
+ tokens = get_tokens(code)
+ if not has_token_sequence(tokens, ['def', func_name]):
+ return False, [{'id' : 'no_func_name', 'args' : {'func_name' : func_name}}]
+
+ in_out = [
+ ([], None),
+ (['RABarbara', 'izpit', 'zmagA'], 'izpit'),
+ (['RABarbara'], 'RABarbara'),
+ (['RABarbara', 'Izpit', 'izpit', 'zmagA'], 'Izpit'),
+ (['RABarbara', 'izpit', 'Izpit', 'zmagA'], 'izpit'),
+ (['Vesel', 'RABarbara', 'izpit', 'Izpit', 'zmagA'], 'Vesel'),
+ (['RABarbara', 'izpit', 'Izpit', 'zmagA', 'Vesel'], 'izpit'),
+ (['RABarbara', 'izpit', 'Izpit', 'zmagA', 'Veselica'], 'Veselica'),
+ ]
+
+ test_in = [('{0}({1})'.format(func_name, str(l[0])), None) for l in in_out]
+ test_out = [l[1] for l in in_out]
+
+ answers = python(code=code, inputs=test_in, timeout=1.0)
+ n_correct = 0
+ tin, tout = None, None
+ for i, (ans, to) in enumerate(zip(answers, test_out)):
+ n_correct += ans[0] == to
+ if ans[0] != to:
+ tin = test_in[i][0]
+ tout = to
+
+ passed = n_correct == len(test_in)
+ 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/dictionaries/max_characters/en.py b/python/problems/dictionaries/max_characters/en.py
new file mode 100644
index 0000000..e42996e
--- /dev/null
+++ b/python/problems/dictionaries/max_characters/en.py
@@ -0,0 +1,13 @@
+id = 20603
+name = 'Number of characters'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+ 'plan': '''\
+<p>(translation missing)</p>''',
+
+ 'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/dictionaries/max_characters/sl.py b/python/problems/dictionaries/max_characters/sl.py
new file mode 100644
index 0000000..835c84f
--- /dev/null
+++ b/python/problems/dictionaries/max_characters/sl.py
@@ -0,0 +1,29 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+id = 20603
+name = 'Število znakov'
+
+description = '''\
+<p>
+Napiši funkcijo <code>maxchars(words)</code>, ki kot argument prejme seznam nizov
+in kot rezultat vrne niz, ki ima največ različnih znakov. Male in velike črke
+upoštevaj kot iste znake - beseda <code>"MamA"</code> ima samo dva različna znaka.
+Če obstaja več besed z enakim številom različnih znakov, naj vrne prvo med njimi.
+Če je seznam prazen, naj funkcija vrne <code>None</code>.
+</p>
+<pre>
+>>> besede = ["RABarbara", "izpit", "zmagA"]
+>>> maxchars(besede)
+'izpit'
+'''
+
+plan = []
+
+hint = {
+ 'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+}