2020-2021:teams:mian:nowcoder_training:2020_multi-university_training_contest_7
2020牛客暑期多校训练营（第七场）
Results
Summary
- Solved 4 out of 10 problems
- Rank 56 / 1140 in official records
- Solved 6 out of 10 afterwards
| # | Who | = | Penalty | A | B | C | D | E | F | G | H | I | J | Dirt |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 7 | 大吉大利，今晚吃 mian(); | 4 | 246 | + 01:03 | -4 | +1 00:07 | +1 00:37 | + 01:39 | 33% 2/6 |
Member Distribution
| Solved | A | B | C | D | E | F | G | H | I | J |
|---|---|---|---|---|---|---|---|---|---|---|
| Pantw | √ | √ | √ | |||||||
| Withinlover | O | |||||||||
| Gary | √ | O |
(√ for solved, O for upsolved, - for tried but not solved)
Solutions
A
B
C
D
本来想写 py，后来想一想直接猜只有 $n=1$ 和 $n=24$ 这两个解，就直接过了
E
F
G
H
这个题就是求
$$\sum\limits_{k=1}^{n}\left(2\lfloor\cfrac{n}{k}\rfloor+\left[n\bmod{k}\neq 0\right]\right)$$
直接数论分块即可。
I
J
直接按题意模拟即可。
Comments
ptw:
2020-2021/teams/mian/nowcoder_training/2020_multi-university_training_contest_7.1596282834.txt.gz · 最后更改: 2020/08/01 19:53 由 grapelemonade
