Difference between revisions of "2019 CCPC Qinhuangdao Onsite Contest"

From EOJ Wiki
Jump to navigation Jump to search
(Created page with "== Problem A == Solved by Kilo_5723. 01:45:25 (+) == Problem B == Unsolved. == Problem C == Unsolved. == Problem D == Solved by Xiejiadong. 00:02:50 (+) == Problem E =...")
 
Line 14: Line 14:
  
 
Solved by Xiejiadong. 00:02:50 (+)
 
Solved by Xiejiadong. 00:02:50 (+)
 +
 +
题意:判断 $\frac{1}{n}$ 是否是一个有限小数。
 +
 +
题解:显然 $n$ 只能是 $2$ 和 $5$ 的倍数。
  
 
== Problem E ==
 
== Problem E ==

Revision as of 13:39, 28 September 2019

Problem A

Solved by Kilo_5723. 01:45:25 (+)

Problem B

Unsolved.

Problem C

Unsolved.

Problem D

Solved by Xiejiadong. 00:02:50 (+)

题意:判断 $\frac{1}{n}$ 是否是一个有限小数。

题解:显然 $n$ 只能是 $2$ 和 $5$ 的倍数。

Problem E

Solved by Weaver_zhu && Kilo_5723. 03:27:20 (+)

Problem F

Solved by Xiejiadong. 02:35:01 (+5)

Problem G

Upsolved by Kilo_5723. (-3)

Problem H

Unsolved.

Problem I

Solved by Weaver_zhu. 00:49:05 (+)

Problem J

Solved by Xiejiadong. 00:44:40 (+2)

Problem K

Unsolved.

Problem L

Unsolved.