poj2406——Power Strings（KMP循环节）

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

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

在next[n]处的值m代表前面有一个长度为m的前缀与相同长度的后缀。所以如果n%(n-next[n])==0说明有一个长度为n-next[n]的循环节

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <string>
#define MAXN 1000010
using namespace std;
int next[MAXN],la,lb,ans[MAXN];
char b[MAXN];
void getnext()
{
    int i=0,j=-1;
    next[0]=-1;
    while(i<lb)
    {
        if(j==-1||b[i]==b[j])
        {
            i++;
            j++;
            next[i]=j;
        }
        else
            j=next[j];
    }
}
int main()
{
    int tmp;
    while(~scanf("%s",b)&&b[0]!='.')
    {
        lb=strlen(b);
        getnext();
        if(lb%(lb-next[lb])==0)
        {
            tmp=lb-next[lb];
            printf("%d\n",lb/tmp);
        }
        else
            printf("1\n");
    }
    return 0;
}