Power Strings +poj+KMP

Power Strings

Time Limit: 3000MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

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.

解决方案：题目蛮简单的，可一个个的前缀枚举。

code:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
using namespace std;
const int maxn=1000003;
int next[maxn];
char text[maxn];
void getnext(int len){

  int i=0,j=-1;
  next[0]=-1;
  while(i<len){
    if(j==-1||text[i]==text[j]){
        i++,j++;
        next[i]=j;
    }
    else j=next[j];
  }
}
int main()
{
    while(~scanf("%s",text)){
        if(text[0]=='.') break;
        int len=strlen(text);
        stack<int>S;
        S.push(len);
        //cout<<len<<endl;
        getnext(len);
        int j,i=len;
      //  cout<<next[i]<<endl;
        while(next[i]>=1){
            S.push(next[i]);
            i=next[i];
        }
        int s;
        while(!S.empty()){
            s=S.top();
          //  cout<<s<<endl;
            S.pop();
            j=0,i=0;
            bool flag=true;
            while(i<len){
                if(text[j]==text[i]){
                    j++,i++;
                    if(j==s) j=0;
                }
                else {
                    if(j==s) {j=0;}
                    else {flag=false;break;}
                }
             //   cout<<i<<endl;

            }
           // cout<<"s:";
             if(flag) break;
 //cout<<"s:";

        }
        printf("%d\n",len/s);
    }
    return 0;
}