OTTFF的博客

Seek the Name, Seek the Fame Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 14394   Accepted: 7186 Description The little cat is so famous, that many coup

Blue Jeans Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 14291   Accepted: 6361 Description The Genographic Project is a research partnership between IBM

Number Sequence Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18002    Accepted Submission(s): 7874 Problem Description Given tw

Oulipo Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8752    Accepted Submission(s): 3534 Problem Description The French author G

Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 40456   Accepted: 16833 Description Given two strings a and b we define a*b to be their conca

这个题目问一个串的所有可能的重复单元长度 及重复的次数 枚举串匹配好像并不能过这个题目的数据 这个题目其实要对KMP的next数组有一定的理解 123123123这样的串会在next数组形成怎样的形式其实是解决这个题目的关键 #include #include using namespace std; const int MN=1e6+5; char s1[MN]; int