KMP之求最大周期数

http://acmore.net:8080/contest/view.action?cid=11#problem/C
C - KMP
Time Limit:3000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit


Status
Description
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
Hint
题意：就是求出最大周期数：
思路：这里运用了KMP算法，模式串自我匹配的原理计算的（详细的内容可以参考《数据结构》（C语言版））

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <iostream>
using namespace std;
const int maxn=1000000+10;
char w[maxn];
int p[maxn];
int m;
void kmp()
 {


           p[0]=-1;
           int j=-1;
          int i=0;
   while(w[i]!='\0')
  {
           if(j==-1||w[i]==w[j])
            {
                      i++;
                      j++;
                      p[i]=j;
            }
            else
            j=p[j];
  }
 }
 int main()
 {
           int ans;
           while(scanf("%s",w)!=EOF)
           {
           if(w[0]=='.')
           break;
           m=strlen(w);
          kmp();
          ans=m-p[m];
           if(m%ans)
            printf("1\n");
           else
           printf("%d\n",m/ans);
           }
           return 0;
 }