![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
kmp
文章平均质量分 73
Just__a__rookie
这个作者很懒,什么都没留下…
展开
-
hdu 4763 Theme Section
It's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs more interesting and challe原创 2017-08-11 10:47:41 · 192 阅读 · 0 评论 -
hdu 3746 Cyclic Nacklace
hud-3746-Cyclic Nacklace CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distr原创 2017-08-11 10:11:58 · 189 阅读 · 0 评论 -
hdu 1867 kmp A + B for you again
hud-1867- A + B for you again Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and原创 2017-08-11 09:09:06 · 258 阅读 · 0 评论 -
hdu 2594 kmp Simpsons’ Hidden Talents
Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had. Marge: Yeah, what is it? Homer: Take me for example. I want to find out if I have a talent in politi原创 2017-08-11 09:00:16 · 176 阅读 · 0 评论 -
hdu 2033 亲合串
人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。 亲和串的定义是这样的:给定两个字符串s1和s2,如果能通过s1循环移位,使s2包含在s1中,那么我们就说s2 是s1的亲和串。原创 2017-08-11 08:46:21 · 247 阅读 · 0 评论 -
HDU 2594 Simpsons’ Hidden Talents
Simpsons’ Hidden Talents Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10282 Accepted Submissio原创 2017-09-21 07:38:25 · 148 阅读 · 0 评论 -
HDU 3336 Count the string
Count the string Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11389 Accepted原创 2017-09-21 18:18:29 · 139 阅读 · 0 评论