2020-2021:teams:mian:nowcoder_training:2020_multi-university_training_contest_8
差别
这里会显示出您选择的修订版和当前版本之间的差别。
| 两侧同时换到之前的修订记录 前一修订版 后一修订版 | 前一修订版 | ||
|
2020-2021:teams:mian:nowcoder_training:2020_multi-university_training_contest_8 [2020/08/03 23:08] gary |
2020-2021:teams:mian:nowcoder_training:2020_multi-university_training_contest_8 [2020/08/04 21:48] (当前版本) grapelemonade [G] |
||
|---|---|---|---|
| 行 28: | 行 28: | ||
| | Pantw | | | | | O | | √ | | | | | | | Pantw | | | | | O | | √ | | | | | | ||
| | Withinlover | | | | | O | | | | √ | | √ | | | Withinlover | | | | | O | | | | √ | | √ | | ||
| - | | Gary | | | | | | | | | | | √ | | + | | Gary | O | | | | | | | | | | √ | |
| (√ for solved, O for upsolved, - for tried but not solved) | (√ for solved, O for upsolved, - for tried but not solved) | ||
| 行 97: | 行 97: | ||
| $\qquad\mathtt{for}\;\;j\;\;\mathtt{from}\;\;i+1\;\;\mathtt{to}\;\;n$\\ | $\qquad\mathtt{for}\;\;j\;\;\mathtt{from}\;\;i+1\;\;\mathtt{to}\;\;n$\\ | ||
| $\qquad\qquad\mathtt{if}\;\;can[id[i]][id[j]]\cap card\neq\varnothing$\\ | $\qquad\qquad\mathtt{if}\;\;can[id[i]][id[j]]\cap card\neq\varnothing$\\ | ||
| - | $\qquad\qquad\qquad\mathtt{output}(k, i, j)\qquad\qquad\qquad//\;\;k\in can[id[i]][id[j]]\cap card$\\ | + | $\qquad\qquad\qquad\mathtt{output}(k, i, j)\qquad\qquad\qquad//\;\;id[k]\in can[id[i]][id[j]]\cap card$\\ |
| $\qquad\qquad\qquad\mathtt{return}$\\ | $\qquad\qquad\qquad\mathtt{return}$\\ | ||
| $\qquad\qquad\mathtt{end\;if}$\\ | $\qquad\qquad\mathtt{end\;if}$\\ | ||
2020-2021/teams/mian/nowcoder_training/2020_multi-university_training_contest_8.1596467322.txt.gz · 最后更改: 2020/08/03 23:08 由 gary
