Rev 16114 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
20 | reyssat | 1 | !set contextcnt=!linecnt $m_context |
2 | !set goalcnt=!linecnt $m_goal |
||
3 | !set equivcnt=!linecnt $m_equivalence |
||
4 | !set casecnt=!linecnt $allcases |
||
5 | |||
6 | <p><center><h4>Current status of the exercise</h4></center> <p> |
||
7 | |||
8 | !if $tolerance<=0 |
||
9 | You should solve this exercise in $m_minsteps steps in order to have a |
||
10 | maximal score. |
||
11 | !else |
||
12 | This exercise can be solved with $m_minsteps steps, but in its current |
||
13 | status you can make up to $[$m_minsteps+$tolerance] steps and still have |
||
14 | a maximal score. |
||
15 | !endif |
||
16 | !if $status=waiting |
||
17 | You are now on the step number $currstep. |
||
18 | !else |
||
19 | You have finished at the end of $[$currstep-1] steps. |
||
20 | !endif |
||
21 | <p> |
||
22 | |||
23 | !if $casecnt>1 |
||
24 | !if $casecnt>2 |
||
25 | You still have $[$casecnt-1] cases to process. Current case: <p> |
||
26 | \($caseid). |
||
27 | !else |
||
28 | This is your last case to process: \($caseid). |
||
29 | !endif |
||
30 | <p> |
||
31 | !endif |
||
32 | |||
33 | !if $goalcnt>0 |
||
34 | Still to prove: <ol> |
||
35 | !for i=1 to $goalcnt |
||
36 | !set l=!line $i of $m_goal |
||
37 | <li>\($l). |
||
38 | !next i |
||
39 | </ol> <p> |
||
40 | !else |
||
41 | !if $equivcnt>0 |
||
42 | Objects to transform: <ol> |
||
43 | !for i=1 to $equivcnt |
||
44 | !set l=!line $i of $m_equivalence |
||
45 | <li>\($l). |
||
46 | !next i |
||
47 | </ol> <p> |
||
48 | !endif |
||
49 | !endif |
||
50 | |||
51 | !if $contextcnt>0 |
||
52 | Usable hypotheses: <ol> |
||
53 | !for i=1 to $contextcnt |
||
54 | !set l=!line $i of $m_context |
||
55 | <li>\($l). |
||
56 | !next i |
||
57 | </ol> <p> |
||
58 | !endif |
||
59 |