Difference between revisions of "2020 ICPC Xiaomi Invitational Second Round Online Contest"

From EOJ Wiki
Jump to navigation Jump to search
Line 17: Line 17:
  
 
== Problem F ==
 
== Problem F ==
Solved by Once. 04:43:11(+4)
+
Unsolved.
 
 
把所有边界点带入后方的连续函数验证连续性即可。
 
 
 
取消同步要人命。
 
  
 
== Problem G ==
 
== Problem G ==

Revision as of 13:55, 3 November 2020

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

Unsolved.

Problem I

Unsolved.

Problem J

Unsolved.

Problem K

Unsolved.