2018 Multi-University, Nowcoder Day 6

From EOJ Wiki
Jump to navigation Jump to search

Problem A

Solved by zerol. 00:34 (+)huihuihu

题意:$2^n$ 个人按完全二叉树进行比赛,每轮用掉 n 个数中的一个,大的获胜,问胜者是谁。

题解:模拟。每次胜者用掉比对方最大的更大一些的数。

Problem C

Solved by ultmaster. 01:05 (+2)

Problem D

Solved by zerol. 00:17 (+)

Problem F

Solved by zerol. 03:27 (+2)

Problem G

Solved by zerol. 03:49 (+2)

Problem I

Solved by kblack. 03:18 (+5)

Problem J

Solved by kblack. 00:29 (+2)