Difference between revisions of "2018 ACM-ICPC Xuzhou Regional Onsite"

From EOJ Wiki
Jump to navigation Jump to search
Line 12: Line 12:
  
 
T 飞了。
 
T 飞了。
 +
 +
题意:求一个字符串 S 中的非空子串 T 的数量,满足不存在 TP 是 S 的子串且 TP 和 PT 完全一致。
 +
 +
题解(伪):
  
 
== Problem G ==
 
== Problem G ==

Revision as of 07:40, 28 October 2018

Replay

Problem A

Solved by kblack. 00:50 (+3)

此处省略一万字。

Problem F

Unsolved. (-11)

T 飞了。

题意:求一个字符串 S 中的非空子串 T 的数量,满足不存在 TP 是 S 的子串且 TP 和 PT 完全一致。

题解(伪):

Problem G

Solved by zerol. 01:14 (+)

Problem H

Solved by kblack. 03:05 (+2)

Problem M

Solved by kblack & ultmaster. 02:17 (+1)