G - Power Strings（KMP最小循环节出现的次数）

Given two strings a and b we define a*b to be their concatenation. For example, if a = “abc” and b = “def” then a*b = “abcdef”. If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = “” (the empty string) and a^(n+1) = a*(a^n).
Input
Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
Output
For each s you should print the largest n such that s = a^n for some string a.
Sample Input

abcd
aaaa
ababab
.

Sample Output

1
4
3

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000009;
char pattern[maxn];
int nnext[maxn];
void getnext()
{
   int patternLen = strlen(pattern);
   int j = -1,  i = 0;
   nnext[0] = -1;
   while(i<patternLen)
   {
     if(j==-1||pattern[i]==pattern[j])
     {
       i++;
       j++;
       nnext[i] = j;
     }
     else
     {
       j = nnext[j];
     }
   }
}
int main()
{
  while(~scanf("%s", pattern))
  {
   if(strcmp(pattern, ".")==0)
   break;
   getnext();
   int patternLen = strlen(pattern);
   int length = patternLen - nnext[patternLen];//最小循环节的长度
   if(patternLen%length==0)//至少有两个
   printf("%d\n", patternLen/length);
   else
   printf("1\n");
  }
  return 0;
}