2020 ICPC Xiaomi Invitational Second Round Online Contest

From EOJ Wiki
Revision as of 13:57, 3 November 2020 by Once (talk | contribs) (→‎Problem H)
Jump to navigation Jump to search

Problem A

Unsolved.

Problem B

Unsolved.

Problem C

Solved by bingoier. 00:27:30

贪心选择最后一个信封柜即可

Problem D

Unsolved.

Problem E

Unsolved.

Problem F

Unsolved.

Problem G

Solved by Once. 00:16:43

大胆猜测答案就是出现最多的字母的出现次数。

Problem H

03:02:04(-3)

Problem I

Solved by bingoier & Once. 00:51:30(+3)

Problem J

Unsolved.

Problem K

Unsolved.

Retrieved from "http://acm.ecnu.edu.cn/wiki/index.php?title=2020_ICPC_Xiaomi_Invitational_Second_Round_Online_Contest&oldid=5589"