2020-2021:teams:alchemist:2020_nowcoder_multiuniversity_4
| 两侧同时换到之前的修订记录 前一修订版 后一修订版 | 前一修订版 | ||
|
2020-2021:teams:alchemist:2020_nowcoder_multiuniversity_4 [2020/07/22 16:54] mountvoom [D. Dividing Strings] |
2020-2021:teams:alchemist:2020_nowcoder_multiuniversity_4 [2020/07/24 11:23] (当前版本) hardict [lpy] |
||
|---|---|---|---|
| 行 11: | 行 11: | ||
| ===== lpy ===== | ===== lpy ===== | ||
| + | |||
| + | 比较函数必须得返回一个准确大小关系，如果关键字全相同可能会炸内存(递归栈) | ||
| + | |||
| + | 字符串方面还得加强 | ||
| ===== xsy ===== | ===== xsy ===== | ||
| 行 84: | 行 88: | ||
| by MountVoom | by MountVoom | ||
| + | |||
| + | ===== H. Harder Gcd Problem ===== | ||
| + | |||
| + | 据说是原题,$1 \sim n$取二元组$(a,b),gcd(a,b)>1$,使数量最多 | ||
| + | |||
| + | 首先每个数只与有哪些素因子有关，用贪心的思想，易想到较大的素因子应该优先匹配，素因子越少的数优先匹配 | ||
| + | |||
| + | 从后向前枚举每个素因子$p$，然后把$p|x$且没匹配的数放一起 | ||
| + | |||
| + | 按素因子个数与从大到小第一个不同的素因子大小排序，然后贪心取即可 | ||
| + | |||
| + | by Hardict | ||
| + | |||
| ====== 补题 ====== | ====== 补题 ====== | ||
2020-2021/teams/alchemist/2020_nowcoder_multiuniversity_4.1595408094.txt.gz · 最后更改: 2020/07/22 16:54 由 mountvoom
