CCPC-Final 2018

Replay

ultmaster:

• 两小时就结束了。

Problem A

Solved by zerol. 00:14 (+)

Problem B

Solved by kblack. 01:31 (+)

题意：骑士站边，贡献不同，有些其实合不拢，求最大值与最小值差的最小值。

题解：先并查集求出所有联通块的站边方案，然后二分差值，把所有骑士分身两边后排序，滑动窗口划过去，判断所有联通块是否有机会全部满足。

Problem D

Unsolved. (-3)

ultmaster: 代码相当宏伟。

kblack: 不甘心！ciya.gif

Problem G

Solved by ultmaster. 00:29 (+1)

Problem H

博弈真好玩。

Problem I

Solved by zerol. 01:51 (+)

Problem K

Solved by kblack. 00:29 (+1)

题意：破解 RSA，离散数学期中考试题。

题解：暴力破出 $n=pq$，求个幂，指数是 $2^{30}+3$ 对 $\phi(n) = (p-1)(q-1)$ 的逆元。

Problem L

Solved by ultmaster. 00:55 (+)