KMP算法
昨日明眸
个人爱好
展开
-
HDU 2087 剪花布条(KMP算法)
剪花布条 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2016-08-18 17:00:12 · 280 阅读 · 0 评论 -
poj2752 Seek the Name, Seek the Fame (kmp)
Seek the Name, Seek the Fame Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6473 Accepted: 2991 Description The little cat is so famous, t原创 2016-08-18 17:56:33 · 221 阅读 · 0 评论 -
hdu 1358 Period 最小循环节
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 whether the prefix is a periodic string. That is,原创 2016-08-18 19:03:32 · 215 阅读 · 0 评论 -
poj2406(KMP 求循环节的个数)Power Strings --
Power Strings Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Given two strings a and b we define a*b to be their concatenation. For原创 2016-08-18 19:30:03 · 308 阅读 · 0 评论 -
Oulipo HDU杭电1686【KMP】
Oulipo Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2553 Accepted Submission(s): 986 Problem Description The French autho原创 2016-08-18 20:13:34 · 954 阅读 · 1 评论 -
HDU1867:A + B for you again【kmp】
Problem Description 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 “sdfg”, the result o原创 2016-08-18 20:15:45 · 306 阅读 · 0 评论