POJ 2406 Power Strings (kmp求循环节)

题目链接：点击打开链接

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K

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.

题目大意：给你一串字符串，问最多由几个相同的字符串组成，输出相同字符串的个数，其实就是求循环节，直接kmp

#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
char st[1000100];
int next[1001000];
void getnext(char st[],int m)
{
    int j = 0 ,k = -1;
    next[0] = -1;
    while (j < m)
    {
        if (k == -1 || st[j] == st[k] )
        {
            ++j;
            ++k;
            next[j] = k;
        }
        else 
        {
            k = next[k];
        }
        //printf("%d\n",next[j]);
    }
}
int main()
{
    while (~scanf("%s",st))
    {
        if (st[0] == '.')
            break;
        int len = strlen(st);
        getnext(st,len);
        if(len == 1) 
        {
             printf("1\n");  
             continue;
        }
        if ( len % (len - next[len]) == 0)
            printf("%d\n",len / (len - next[len]) );
        else 
        {
            printf("1\n");
        }
    }
    return 0;
}