KMP
文章平均质量分 80
bingsanchun
这个作者很懒,什么都没留下…
展开
-
HDU1711——Number Sequence
Problem DescriptionGiven 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 make a[K] = b原创 2013-08-17 18:09:34 · 1120 阅读 · 0 评论 -
HDU2594——Simpsons’ Hidden Talents
Problem DescriptionHomer: 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原创 2013-08-20 00:59:58 · 2027 阅读 · 5 评论 -
HDU1686——Oulipo
Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pa原创 2013-08-19 18:01:55 · 884 阅读 · 0 评论