poj 2406 Power Strings (kmp)

最新推荐文章于 2023-06-30 19:30:28 发布

不为自己找借口

最新推荐文章于 2023-06-30 19:30:28 发布

阅读量223

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/m15738518751/article/details/47344755

版权

数据结构专栏收录该内容

9 篇文章 0 订阅

订阅专栏

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

#include<stdio.h>
#include<string.h>
const int max=1e6+1;
char str[max];
int p[max];
int i,j,len;
void getp(int l)
{
	i=0;j=-1;
	p[i]=j;
	while(i<l)
	{
		if(j==-1||str[j]==str[i])
		{
			i++,j++;
			p[i]=j;
		}
		else j=p[j];
	}
}
int main()
{
	while(scanf("%s",&str))
	{
		if(strcmp(str,".")==0)
		break;
		len=strlen(str);
		getp(len);
		/*for(i=0;i<len;i++)
		printf("%d ",p[i]);
		printf("\n");*/
		if (len % (len - p[len]) == 0)  
        printf("%d\n", len / (len - p[len]));  
        else  
        puts("1");
	}
	return 0;
}