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
|
# coding=utf-8
from operator import itemgetter
import prolog.engine
import server.problems
id = 112
number = 19
visible = False
facts = None
solution = '''\
conc112([], L, L).
conc112([H|T], L2, [H|L]) :-
conc112(T, L2, L).
rev112([], []).
rev112([H|T], R):-
rev112(T, R1),
conc112(R1, [H], R).
palindrome(L) :-
rev112(L, L).
'''
test_cases = [
('palindrome([])',
[{}]),
('palindrome([a, b, e, A, B, C])',
[{'A': 'e', 'B': 'b', 'C': 'a'}]),
('palindrome([b, e, X])',
[{'X': 'b'}]),
]
def test(code, aux_code):
n_correct = 0
engine_id = None
try:
engine_id, output = prolog.engine.create(code=code+aux_code, timeout=1.0)
if engine_id is not None and 'error' not in map(itemgetter(0), output):
# Engine successfully created, and no syntax error in program.
for query, answers in test_cases:
if prolog.engine.check_answers(engine_id, query=query, answers=answers, timeout=1.0):
n_correct += 1
except socket.timeout:
pass
finally:
if engine_id:
prolog.engine.destroy(engine_id)
hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}]
return n_correct, len(test_cases), hints
def hint(code, aux_code):
# TODO
return []
|
