Rev 16116 | Go to most recent revision | Details | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 2071 | zjchen | 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>本练习目前的状况</h4></center> <p> |
||
| 7 | |||
| 8 | !if $tolerance<=0 |
||
| 9 | 为得到最高分, 你应该在 $m_minsteps 步内解决问题. |
||
| 10 | !else |
||
| 11 | 本练习可在 $m_minsteps 步内解决, |
||
| 12 | 但在目前状况下你可以做到 $[$m_minsteps+$tolerance] 步仍能得到最高分. |
||
| 13 | !endif |
||
| 14 | !if $status=waiting |
||
| 15 | 现在你是第 $currstep 步. |
||
| 16 | !else |
||
| 17 | 你在第 $[$currstep-1] 步后完成了. |
||
| 18 | !endif |
||
| 19 | <p> |
||
| 20 | |||
| 21 | !if $casecnt>1 |
||
| 22 | !if $casecnt>2 |
||
| 23 | 你还有 $[$casecnt-1] 种情况待处理. 目前的情况: <p> |
||
| 24 | \($caseid). |
||
| 25 | !else |
||
| 26 | 这是你要处理的最后一种情况: \($caseid). |
||
| 27 | !endif |
||
| 28 | <p> |
||
| 29 | !endif |
||
| 30 | |||
| 31 | !if $goalcnt>0 |
||
| 32 | 仍然要证: <ol> |
||
| 33 | !for i=1 to $goalcnt |
||
| 34 | !set l=!line $i of $m_goal |
||
| 35 | <li>\($l). |
||
| 36 | !next i |
||
| 37 | </ol> <p> |
||
| 38 | !else |
||
| 39 | !if $equivcnt>0 |
||
| 40 | 变换的对象: <ol> |
||
| 41 | !for i=1 to $equivcnt |
||
| 42 | !set l=!line $i of $m_equivalence |
||
| 43 | <li>\($l). |
||
| 44 | !next i |
||
| 45 | </ol> <p> |
||
| 46 | !endif |
||
| 47 | !endif |
||
| 48 | |||
| 49 | !if $contextcnt>0 |
||
| 50 | 可用的假设: <ol> |
||
| 51 | !for i=1 to $contextcnt |
||
| 52 | !set l=!line $i of $m_context |
||
| 53 | <li>\($l). |
||
| 54 | !next i |
||
| 55 | </ol> <p> |
||
| 56 | !endif |
||
| 57 |