poj2406（kmp next数组）

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 using namespace std;
 5 
 6 const int maxn = 1000005;
 7 
 8 int next[maxn];
 9 
10 void get(char *s) {
11     int l = strlen(s);
12     int j = 0, k = -1;
13     next[0] = -1;
14     while(j < l) {
15         if(k == -1 || s[j] == s[k]) {
16             next[++j] = ++k;
17         } else {
18             k = next[k];
19         }
20     }
21 }
22 char s[maxn];
23 
24 int main() {
25     while(gets(s) ) {
26         if(strcmp(s,".") == 0) {
27             break;
28         }
29         get(s);
30         int ans = 1;
31         int l = strlen(s);
32         if(l % (l - next[l]) == 0) {
33             ans = l / (l - next[l]);
34         }
35         printf("%d\n", ans);
36     }
37 }