# POJ 2406 Power Strings [KMP+循环节规律]

163人阅读 评论(0)

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.

AC代码：

#include <iostream>
#include <cmath>
#include<cstdio>
#include <cstring>
#include <algorithm>
#define N 10000005
using namespace std ;
char a[N] ;
int len , n , next[N];
void kkk()
{
int i , j ;
i = 0;
j = next[0] = -1;
while(i < len)
{
while(j!=-1&&a[i]!=a[j])
j = next[j];
next[++i] = ++j;
}
}

int main()
{
while(scanf("%s",a))
{
if(a[0]=='.') break;
len = strlen(a);
memset(next,0,sizeof(next));
kkk();
int ans ;
if(len%(len-next[len])==0) ans = len/(len-next[len]);
else ans = 1;
cout<<ans<<endl;
}
return 0 ;
}


0
0

个人资料
• 访问：112278次
• 积分：4336
• 等级：
• 排名：第8280名
• 原创：332篇
• 转载：3篇
• 译文：1篇
• 评论：11条
最新评论