POJ 2406 Power Strings
摘要:
白书上看过这道题,枚举即可,530MS左右,这道题分类是 KMP ,可能是用 next 数组。# include <stdio.h># include <string.h>char s[1000005];int check(int i, int t);int solve(int len);int main(){ int len; while (1) { scanf("%s", s); len = strlen(s); if (len == 1 && s[0] == '.') break; else... 阅读全文
posted @ 2012-05-11 11:13 getgoing 阅读(169) 评论(0) 推荐(0) 编辑