poj-Power Strings -2406

最新推荐文章于 2022-07-21 20:55:14 发布

灰色头像XXOO

最新推荐文章于 2022-07-21 20:55:14 发布

阅读量451

点赞数

分类专栏： KMP

本文链接：https://blog.csdn.net/u011497404/article/details/9618369

版权

KMP 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

最小循环节问题，给出字符串如果有几个完成的循环节，就输出，否则输出1.

Power Strings

Time Limit : 6000/3000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 24 Accepted Submission(s) : 10

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

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

char s[1000001];
int next[1000001];

int main(void)
{
    int i,j,len,n;
    while(scanf("%s",s),s[0]!='.'){
        len=strlen(s);
        i=0,j=-1;
        next[0]=-1;
        while(i<len){
            if(j==-1||s[i]==s[j]){
                i++,j++;
                next[i]=j;


            }
            else j=next[j];
        }

        if(len%(i=len-next[len])==0)
            n=len/i;
        else n=1;
        printf("%d\n",n);
    }
    return 0;
}