2020-2021:teams:alchemist:pku_campus_2019
差别
这里会显示出您选择的修订版和当前版本之间的差别。
| 两侧同时换到之前的修订记录 前一修订版 后一修订版 | 前一修订版 | ||
|
2020-2021:teams:alchemist:pku_campus_2019 [2020/05/08 10:53] maxdumbledore [F.Graduation] |
2020-2021:teams:alchemist:pku_campus_2019 [2020/05/08 10:54] (当前版本) maxdumbledore |
||
|---|---|---|---|
| 行 103: | 行 103: | ||
| ===== G.Go and Oreo ===== | ===== G.Go and Oreo ===== | ||
| ===== H.Homomorphism ===== | ===== H.Homomorphism ===== | ||
| - | ===== I.Chamber of Braziers ===== | ||
| ===== J.Matrix of Determinants ===== | ===== J.Matrix of Determinants ===== | ||
| ===== K.Winner Winner, Chicken Dinner! ===== | ===== K.Winner Winner, Chicken Dinner! ===== | ||
| 行 110: | 行 109: | ||
| ====== 补题 ====== | ====== 补题 ====== | ||
| - | ===== Chamber of Braziers ===== | + | ===== I. Chamber of Braziers ===== |
| 很好的一道题，在比赛时居然死想没想出来TAT | 很好的一道题，在比赛时居然死想没想出来TAT | ||
| 行 148: | 行 147: | ||
| scanf("%d", &Tt); | scanf("%d", &Tt); | ||
| srand(time(0)); | srand(time(0)); | ||
| - | for (int i = 1; i <= maxn; i++) | + | for (int i = 1; i < maxn; i++) |
| h[i] = RAND_MAX > maxn ? rand() : rand() * rand(), r[i] = r[i - 1] ^ h[i]; | h[i] = RAND_MAX > maxn ? rand() : rand() * rand(), r[i] = r[i - 1] ^ h[i]; | ||
| while (Tt--) { | while (Tt--) { | ||
2020-2021/teams/alchemist/pku_campus_2019.1588906412.txt.gz · 最后更改: 2020/05/08 10:53 由 maxdumbledore
