From 12378810ee9207536bfa0c264c1bf2a2b0296171 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Martin=20Mo=C5=BEina?=
Date: Wed, 24 Aug 2016 15:32:22 +0200
Subject: Added several new exercises for Python (related to dictionaries and
sets).
---
.../dictionaries/following_words/common.py | 70 ++++++++++++++++++++++
python/problems/dictionaries/following_words/en.py | 13 ++++
python/problems/dictionaries/following_words/sl.py | 36 +++++++++++
3 files changed, 119 insertions(+)
create mode 100644 python/problems/dictionaries/following_words/common.py
create mode 100644 python/problems/dictionaries/following_words/en.py
create mode 100644 python/problems/dictionaries/following_words/sl.py
(limited to 'python/problems/dictionaries/following_words')
diff --git a/python/problems/dictionaries/following_words/common.py b/python/problems/dictionaries/following_words/common.py
new file mode 100644
index 0000000..501cfd2
--- /dev/null
+++ b/python/problems/dictionaries/following_words/common.py
@@ -0,0 +1,70 @@
+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 = 20610
+number = 11
+visible = True
+
+solution = '''\
+import collections
+
+def following_words(txt):
+ words = txt.split()
+ freq = collections.defaultdict(list)
+ for word, next_word in zip(words, words[1:]):
+ freq[word].append(next_word)
+ return freq
+'''
+
+hint_type = {
+ 'final_hint': Hint('final_hint')
+}
+
+def test(python, code):
+ func_name = 'following_words'
+ 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 = [
+ ('in in in in', {'in': ['in', 'in', 'in']}),
+ ('in to in ono in to smo mi', {'smo': ['mi'], 'to': ['in', 'smo'],
+ 'ono': ['in'], 'in': ['to', 'ono', 'to']}),
+ ('danes je lep dan danes sije sonce',
+ {'lep': ['dan'], 'je': ['lep'], 'dan': ['danes'],
+ 'danes': ['je', 'sije'], 'sije': ['sonce']}),
+ ]
+
+ test_in = [(func_name+'("%s")'%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)):
+ corr = dict(ans[0]) == to
+ n_correct += corr
+ if not corr:
+ 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/following_words/en.py b/python/problems/dictionaries/following_words/en.py
new file mode 100644
index 0000000..44de7c2
--- /dev/null
+++ b/python/problems/dictionaries/following_words/en.py
@@ -0,0 +1,13 @@
+id = 20610
+name = 'Following words'
+
+description = '''\
+(translation missing)
'''
+
+hint = {
+ 'plan': '''\
+(translation missing)
''',
+
+ 'no_input_call': '''\
+(translation missing)
''',
+}
diff --git a/python/problems/dictionaries/following_words/sl.py b/python/problems/dictionaries/following_words/sl.py
new file mode 100644
index 0000000..b9d6740
--- /dev/null
+++ b/python/problems/dictionaries/following_words/sl.py
@@ -0,0 +1,36 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+id = 20610
+name = 'Sledeče besede'
+
+description = '''\
+
+Napišite funkcijo following_words(txt)
, ki za vsako besedo b
+v nizu txt
zgradi seznam besed, ki v tekstu nastopijo za
+besedo b
. Nekaj primerov:
+
+>>> following_words('in in in in')
+{'in': ['in', 'in', 'in']}
+
+V besedilu se pojavi samo beseda in
; beseda in
se pojavi
+na treh mestih za in
.
+
+>>> following_words('in to in ono in to smo mi')
+{'smo': ['mi'], 'to': ['in', 'smo'], 'ono': ['in'], 'in': ['to', 'ono', 'to']}
+
+Za besedo smo
se pojavi samo beseda mi
, medtem ko se
+recimo za besedo to
pojavita tako beseda smo
kot
+tudi beseda in
.
+
+'''
+
+plan = []
+
+hint = {
+ 'final_hint': ['''\
+Program je pravilen!
+
+'''],
+}
--
cgit v1.2.1