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