poj 2406 Power Strings

Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 46017   Accepted: 19237 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. Source Waterloo local 2002.07.01

提示

题意：

我们定义一个字符串S，存在A：A^n=S，给出一个字符串求出其中n为最大的值。例如：abcd=abcd^1，aaaa=a^4....

思路：

类似poj1961，利用KMP，求出循环节的长度，值得注意的是如果字符串长度不能被循环节长度整除，则输出1。

示例程序

Source Code

Problem: 2406		Code Length: 606B
Memory: 5284K		Time: 125MS
Language: GCC		Result: Accepted
#include <stdio.h>
#include <string.h>
int next[1000001];
char a[1000001];
void getnext(int n)
{
    int i=0,i1=-1;
    next[i]=i1;
    while(i<n)
    {
        if(i1==-1||a[i]==a[i1])
        {
            i++;
            i1++;
            next[i]=i1;
        }
        else
        {
            i1=next[i1];
        }
    }
    if(n%(i-i1)==0)
    {
        printf("%d\n",n/(i-i1));
    }
    else
    {
        printf("1\n");
    }
}
int main()
{
    int n,i,i1,max;
    scanf("%s",a);
    while(a[0]!='.')
    {
        max=1;
        getnext(strlen(a));
        scanf("%s",a);
    }
    return 0;
}