字符串--KMP
Xiao-wei1998
学生
展开
-
HDU 2203
传送门 :亲和串人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。 亲和串的定义是这样的:给定两个字符串s1和s2,如果能通过s1循环移位,使s2包含在s1中,那么我们就说s2 是s1的亲和串...原创 2018-01-20 19:50:23 · 212 阅读 · 0 评论 -
HDU 3336
传送门 :Count the stringIt is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. F...转载 2018-01-20 19:08:07 · 406 阅读 · 0 评论 -
POJ 2406
传送门 : Power StringGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, expone...原创 2018-01-20 14:45:57 · 149 阅读 · 0 评论 -
HDU 1711
传送门 :Number Sequence Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which m...原创 2018-01-19 19:28:27 · 157 阅读 · 0 评论