1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
# coding=utf-8
from python.util import has_token_sequence, string_almost_equal
from server.hints import Hint, HintSequence
id = 187
group = 'introduction'
number = 2
visible = True
solution = '''\
from math import *
g = 9.8
kot = float(input("Vnesi kot (v stopinjah): "))
v = float(input("Vnesi hitrost (v m/s): "))
kot_rad = kot * 2 * pi / 360
razdalja = v ** 2 * sin(2 * kot_rad) / g
print("Kroglo bo odneslo", razdalja, "metrov.")
'''
hint_type = {
'plan': Hint('plan'),
'eval_expression': Hint('eval_expression'),
'sin_error': HintSequence('sin_error', 4),
'name_error': HintSequence('name_error', 4),
'unsupported_operand': HintSequence('unsupported_operand', 4),
'error': HintSequence('error', 2),
'radians': HintSequence('radians', 3),
'printing': Hint('printing'),
'betterg': Hint('betterg'),
}
import re
numeric_const_pattern = r"""
[-+]? # optional sign
(?:
(?: \d* \. \d+ ) # .1 .12 .123 etc 9.1 etc 98.1 etc
|
(?: \d+ \.? ) # 1. 12. 123. etc 1 12 123 etc
)
# followed by optional exponent part if desired
(?: [Ee] [+-]? \d+ ) ?
"""
rx = re.compile(numeric_const_pattern, re.VERBOSE)
def contains_negative(s):
""" Returns whether the string contains negative value or not.
"""
vals = rx.findall(s)
for v in vals:
if float(v) < 0:
return True
return False
def test(python, code):
# List of inputs: (expression to eval, stdin).
test_in = [
(None, '45\n100\n'),
(None, '44\n100\n'),
(None, '46\n100\n'),
(None, '0\n100\n'),
(None, '90\n100\n'),
(None, '32\n747\n'),
(None, '45\n10\n'),
(None, '40\n10\n'),
(None, '10\n10\n'),
(None, '80\n10\n'),
(None, '80\n20\n'),
(None, '80\n0\n')
]
test_out = [
'1020.4',
'1019.79',
'1019.79',
'0.0',
'0.0',
'51177.06',
'10.20',
'10.05',
'3.49',
'3.49',
'13.94',
'0'
]
# List of outputs: (expression result, stdout, stderr, exception).
answers = python(code=code, inputs=test_in, timeout=1.0)
outputs = [ans[1] for ans in answers]
n_correct = 0
for output, correct in zip(outputs, test_out):
if string_almost_equal(output, float(correct)):
n_correct += 1
passed = n_correct == len(test_in)
hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_in)}}]
return passed, hints
def hint(python, code):
# run one test first to see if there are any exceptions
test_in = [(None, '5\n10\n')]
answer = python(code=code, inputs=test_in, timeout=1.0)
exc = answer[0][3]
# if have an exception!
if exc:
if 'sin' in exc and 'NameError' in exc:
return [{'id':'sin_error', 'args': {'message': exc}}]
elif 'NameError' in exc:
return [{'id':'name_error', 'args': {'message': exc}}]
elif 'unsupported operand' in exc:
return [{'id':'unsupported_operand', 'args': {'message': exc}}]
elif 'TypeError' in exc:
return [{'id':'type_error', 'args': {'message': exc}}]
else:
return [{'id':'error', 'args': {'message': exc}}]
# show plan if student is lost
# a) empty progam
# b) there is not input (we can do it here, since we have no input hint)
if not code or (not has_token_sequence(code, ['input'])):
return [{'id': 'plan'}]
# if sinus is not in code, we need to teach students where they can get it
# use math functions.
if (not has_token_sequence(code, ['sin'])):
return [{'id' : 'eval_expression'}]
# student is not using print function
if not has_token_sequence(code, ['print']):
return [{'id' : 'printing'}]
# if result is negative, student did not translate to radians
if contains_negative(answer[0][1]):
return [{'id': 'radians'}]
# using g=10
if string_almost_equal(answer[0][1], 1.736, prec=2):
return [{'id': 'betterg'}]
return None
|
