kmp算法
l清风明月
我是一个心怀梦想的青年人
展开
-
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14103 Accepted: 7016DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Bytela原创 2015-08-07 20:19:06 · 472 阅读 · 0 评论 -
Oulipo
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7203 Accepted Submission(s): 2869Problem DescriptionThe French author Georges Perec原创 2015-08-07 11:21:32 · 516 阅读 · 0 评论 -
Power Strings
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 37439 Accepted: 15467DescriptionGiven two strings a and b we define a*b to be their concatenation. For example,原创 2015-08-07 15:56:28 · 758 阅读 · 0 评论 -
Binary String Matching
时间限制:3000 ms | 内存限制:65535 KB难度:3描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a substring of B? For原创 2015-10-23 16:34:47 · 249 阅读 · 0 评论