用KMP的next部分匹配表寻找最小的字符串周期。
#include <cstdio>
#include <cstring>
const int maxn = 1000000 + 5;
char s[maxn];
int next[maxn];
int m;
void get_next() {
int k = 0;
next[0] = 0;
for (int q = 1; q < m; q++) {
while (k > 0 && s[k] != s[q]) {
k = next[k-1];
}
if (s[k] == s[q]) {
k++;
}
next[q] = k;
}
}
int main() {
while (gets(s)) {
if (s[0] == '.') {
break;
}
m = strlen(s);
get_next();
if (m - next[m-1] < m && m % (m - next[m-1]) == 0) {
printf("%d\n", m / (m - next[m-1]));
} else {
printf("1\n");
}
}
return 0;
}