2018-2019 Southeastern European Regional Programming Contest (SEERC 2018)

From EOJ Wiki
Revision as of 10:38, 31 October 2018 by Ultmaster (talk | contribs) (Created page with "== Problem A == Unsolved. (-5) 题意:问有多少种方法将一个数拆成两个回文数。 题解:写了个暴力 T 飞。 == Problem B == Solved by ultmaster. 0...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem A

Unsolved. (-5)

题意:问有多少种方法将一个数拆成两个回文数。

题解:写了个暴力 T 飞。

Problem B

Solved by ultmaster. 01:32 (+)

Problem C

Solved by zerol. 00:53 (+)

Problem E

Solved by ultmaster. 00:36 (+)

Problem F

Solved by zerol & kblack. 03:29 (+2)

Problem G

Solved by kblack. 01:21 (+)

Problem I

Solved by kblack. 00:47 (+1)