循环节的变种 类似POJ 1961
#include <cstdio>
#include <cstring>
using namespace std;
const int MAX_N = 1000100;
const int MAX_M = 10010;
#define sci(num) scanf("%d",&num)
char
str[MAX_N];
int nxt[MAX_N];
int lents;
void kmp_pre(
char
* t) {
nxt[0] = -1;
for (int i = 0,k = -1;i < lents;) {
if (k == -1 || t[i] == t[k]) {
nxt[++i] = ++k;
} else {
k = nxt[k];
}
}
}
int main() {
while ( ~scanf("%s",str)) {
if (str[0] == '.') break;
lents = strlen(str);
kmp_pre(str);
int ans = 1;
if (lents % (lents - nxt[lents]) == 0) {
ans = lents / (lents - nxt[lents]);
}
printf("%d\n",ans);
}
return 0;
}