| rank | solved | A | B | C | D | E | F | G | H | I | J | K | L | M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 4 | 8 | O | O | . | . | Ø | O | O | O | . | O | . | O | . |
A
Solved by Henry.
转化为凑出最小补集，贪心暴搜。
B
Solved by Forsaken.
大数分解 Trick + 筛。
E
UpSolved by Forsaken.
炸精度了。
F
Solved by Henry.
签到。
G
Solved by Henry.
求个凸包。
H
Solved by Henry.
从 $n-1$ 个东西选 $n$ 个凑成一个 $2n-2$ 的背包，每个物品重量是 $[1,n-1]$。
每个先必选一个，然后跑完全背包。
J
Solved by XLor.
建个字典树。
L
Solved by XLor.