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
|
# 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 = 233
group = 'functions'
number = 12
visible = True
solution = '''\
def divisors_sum(n):
s = 0
for i in range(1, n):
if n % i == 0:
s += i
return s
def friendly_number(n):
s = divisors_sum(n)
if n == divisors_sum(s):
return s
'''
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
|
