Difference between revisions of "2020 CCPC Online Contest"

From EOJ Wiki
Jump to navigation Jump to search
Line 4: Line 4:
 
== Problem B ==
 
== Problem B ==
 
Solved by all 02:24:09(-1)
 
Solved by all 02:24:09(-1)
 +
 
每个节点向其某个质因子连边,之后所有素数向 $2$ 连边。答案即为区间自然数和加上区间素数和,用 min25 筛出即可。
 
每个节点向其某个质因子连边,之后所有素数向 $2$ 连边。答案即为区间自然数和加上区间素数和,用 min25 筛出即可。
  

Revision as of 13:59, 23 September 2020

Problem A

Unsolved.

Problem B

Solved by all 02:24:09(-1)

每个节点向其某个质因子连边,之后所有素数向 $2$ 连边。答案即为区间自然数和加上区间素数和,用 min25 筛出即可。

Problem C

Problem D

Problem E

Problem F

Problem G

Problem H

Problem I

Problem J

Problem K

Problem L

Problem M