Power Strings

Power Strings

Time Limit: 1000MS Memory limit: 65536K

题目描述

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).

输入

  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.

输出

  For each s you should print the largest n such that s = a^n for some string a.

示例输入

abcd
aaaa
ababab
.

示例输出

1
4
3

提示

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

计算一个字符串是由一个字串复制多少次组成，同样是KMP的灵活运用。关键是KMP中字符串next值的计算过程以及每个值的意义。

如果一个字符串重复的出现，则next值在第二个循环节开始即从1开始不断的增长，其实是公差为1的等差数列。在next值计算完成后从后往前便利，遇到的第一个为0的元素即使最小字符串的最后一个元素，为了防止出现abcabcab（其next值为：-1，0，0，1，2，3，4，5），当找到第一个0对应的元素“c”时，即便条件成立，但前面的“abc”却不是最小子串，因为最后面的字符是“ab”而不是“abc”，所以一个最小循环串的长度一定要可以被整条串的长度整除才行。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

char st[1000009];
int next[1000009];
int main()
{
    int i,j,l;
    while(~scanf("%s",st))
    {
        if(st[0] == '.' && st[1] == '\0')
            break;
        l = strlen(st);
        i = 0;j = -1;next[0] = -1;
        while(i<l)
        {
            if(j == -1 || st[i] == st[j])
            {
                i++;
                j++;
                next[i] = j;
            }
            else
                j = next[j];
        }
        i = i - j;
        if(l % i == 0)
            i = l / i;
        printf("%d\n",i);
    }
    return 0;
}