2018 China Collegiate Programming Contest Final (CCPC-Final 2018)

Problem A

Solved by Xiejiadong. 00:12 (+1)

温暖的排序签到。

+1 是因为煞笔了。

Problem B

Solved by Kilo_5723. 04:20 (+)

Problem C

Unsolved.

Problem D

Unsolved.

Problem E

Unsolved.

Problem F

Unsolved.

Problem G

Solved by Xiejiadong && Weaver_zhu. 00:33 (+1)

题意：求一个 $n\times m$ 的矩阵里面能选出多少对矩形，满足前一个被后一个包含的关系。

题解：观察一维线段被包含的情况，显然答案为 $\left ( _{n+1}^{4} \right )$，那么二维的情况就是乘起来。

Problem H

Unsolved.

Problem I

Solved by Kilo_5723. 03:01 (+1)

Problem J

Unsolved.

Problem K

Solved by Weaver_zhu. 03:53 (+10)

Problem L

Solved by Xiejiadong. 03:10 (+2)