Difference between revisions of "2020 China Collegiate Programming Contest Qinhuangdao Site"

From EOJ Wiki
Jump to navigation Jump to search
(Created page with "== Problem A == Unsolved. == Problem B == Solved by yanghong. 04:34 (+) == Problem C == Solved by bingoier. 00:35 (+) 质因数分解后发现答案为每一个质数的...")
 
Line 1: Line 1:
 
== Problem A ==
 
== Problem A ==
  
Unsolved.
+
Solved by . 00:18 (+1)
  
 
== Problem B ==
 
== Problem B ==
  
Solved by yanghong. 04:34 (+)
+
Unsolved.
  
 
== Problem C ==
 
== Problem C ==
  
Solved by bingoier. 00:35 (+)
+
Unsolved.
 
 
质因数分解后发现答案为每一个质数的指数 $k,((k+2)*(k+1)/2$ 的乘积之和
 
  
 
== Problem D ==
 
== Problem D ==
Line 19: Line 17:
 
== Problem E ==
 
== Problem E ==
  
Solved by bingoier. 01:17 (+1)
+
Solved by . 02:09 (+2)
  
模拟题,将时间转化为秒数可以简便运算
 
  
 
== Problem F ==
 
== Problem F ==
  
Solved by yanghong. 01:06 (+)
+
Solved by yanghong. 00:38 (+)
 +
 
  
 
== Problem G ==
 
== Problem G ==
  
Unsolved.
+
Solved by yanghong. 00:23 (+3)
  
 
== Problem H ==
 
== Problem H ==
  
Solved by Once. 03:08 (+2)
 
  
大概可以猜测一下,一个积木盘只有绕一圈之后才会出现一个轮换。所以我们就暴力把原来的积木标号之后转一圈,得到所有轮换,求出轮换的最小公倍数就是答案。然而模数不是素数,所以答案需要处理出所有的质因子后暴力相乘。
+
Unsolved.
 
 
不过还有一个结论感觉很对但是不会证明,就是经过一个轮换之后积木形状相同。
 
  
时间复杂度 $O(n^2)$。
 
  
 
== Problem I ==
 
== Problem I ==
Line 47: Line 41:
 
== Problem J ==
 
== Problem J ==
  
Solved by bingoier. 00:07 (+)
+
Unsolved.
 +
 
 +
== Problem K ==
  
签到,将题面上的代码复制过来即可
+
Solved by yanghong. 01:36 (+3)
 +
 
 +
 
 +
== Problem L ==
 +
 
 +
Unsolved.

Revision as of 12:09, 3 November 2020

Problem A

Solved by . 00:18 (+1)

Problem B

Unsolved.

Problem C

Unsolved.

Problem D

Unsolved.

Problem E

Solved by . 02:09 (+2)


Problem F

Solved by yanghong. 00:38 (+)


Problem G

Solved by yanghong. 00:23 (+3)

Problem H

Unsolved.


Problem I

Unsolved.

Problem J

Unsolved.

Problem K

Solved by yanghong. 01:36 (+3)


Problem L

Unsolved.