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

From EOJ Wiki
Jump to navigation Jump to search
 
(17 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
== Problem A ==
 
== Problem A ==
Unsolved.
+
Solved by yanghong. 04:24:26(-4)
  
 
== Problem B ==
 
== Problem B ==
Line 6: Line 6:
  
 
== Problem C ==
 
== Problem C ==
Solved by bingoier. 00:27:30
+
Solved by Once. 03:19:36(-2)
  
贪心选择最后一个信封柜即可
+
== Problem D ==
 +
Solved by bingoier & Once. 00:53:26(+)
  
== Problem D ==
+
线性代数推导可得结论.
Unsolved.
 
  
 
== Problem E ==
 
== Problem E ==
Line 20: Line 20:
  
 
== Problem G ==
 
== Problem G ==
Solved by Once. 00:16:43
+
Solved by Once. 01:48:41(-1)
 
 
大胆猜测答案就是出现最多的字母的出现次数。
 
  
 
== Problem H ==
 
== Problem H ==
Unsolved.
+
Solved by yanghong. 03:02:04(-3)
  
 
== Problem I ==
 
== Problem I ==

Latest revision as of 08:53, 4 November 2020

Problem A

Solved by yanghong. 04:24:26(-4)

Problem B

Unsolved.

Problem C

Solved by Once. 03:19:36(-2)

Problem D

Solved by bingoier & Once. 00:53:26(+)

线性代数推导可得结论.

Problem E

Unsolved.

Problem F

Unsolved.

Problem G

Solved by Once. 01:48:41(-1)

Problem H

Solved by yanghong. 03:02:04(-3)

Problem I

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

Problem J

Unsolved.

Problem K

Unsolved.