
KMP
文章平均质量分 79
ACM_Ted
正在加油的火箭。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
【KMP】 hdu3613 Best Reward
Best Reward http://acm.hdu.edu.cn/showproblem.php?pid=3613 Problem Description After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with hono原创 2012-08-02 15:55:33 · 1496 阅读 · 0 评论 -
【KMP】 hdu3374 String Problem
String Problem http://acm.hdu.edu.cn/showproblem.php?pid=3374 Problem Description Give you a string with length N, you can generate N strings by left shifts. For example let consider the原创 2012-08-01 23:05:38 · 1177 阅读 · 1 评论 -
【KMP】 poj2406 Power Strings
Power Strings http://poj.org/problem?id=2406 Description Given 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原创 2012-08-02 00:05:59 · 689 阅读 · 0 评论 -
【KMP】 hdu3746 Cyclic Nacklace
Cyclic Nacklace http://acm.hdu.edu.cn/showproblem.php?pid=3746 Problem Description CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, wit原创 2012-08-02 00:23:35 · 749 阅读 · 0 评论 -
【KMP】 poj1961 Period
Period http://poj.org/problem?id=1961 Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whe原创 2012-08-02 09:32:33 · 599 阅读 · 0 评论 -
【KMP】 poj2752 Seek the Name, Seek the Fame
Seek the Name, Seek the Fame http://poj.org/problem?id=2752 Description The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give原创 2012-08-02 09:53:08 · 632 阅读 · 0 评论 -
【KMP】 poj3461 Oulipo
Oulipo http://poj.org/problem?id=3461 Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group.原创 2012-08-02 10:20:03 · 577 阅读 · 0 评论 -
【KMP】 hdu1867 A + B for you again
A + B for you again http://acm.hdu.edu.cn/showproblem.php?pid=1867 Problem Description Generally speaking, there are a lot of problems about strings processing. Now you encounter another su原创 2012-08-02 10:41:50 · 1913 阅读 · 0 评论 -
【KMP】 hdu3336 Count the string
Count the string http://acm.hdu.edu.cn/showproblem.php?pid=3336 Problem Description It is well known that AekdyCoin is good at string problems as well as number theory problems. When give原创 2012-08-02 11:28:05 · 1638 阅读 · 0 评论 -
【KMP】 hdu2594 Simpsons’ Hidden Talents
Simpsons’ Hidden Talents http://acm.hdu.edu.cn/showproblem.php?pid=2594 Problem Description Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.原创 2012-08-02 13:02:19 · 1360 阅读 · 0 评论 -
【KMP】 hdu4300 Clairewd’s message
Clairewd’s message http://acm.hdu.edu.cn/showproblem.php?pid=4300 Problem Description Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important m原创 2012-08-02 17:11:19 · 1641 阅读 · 2 评论