POJ 2406 (KMP)

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 21079		Accepted: 8853

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. 

和1961几乎一模一样，改了下1961的代码交上去就A了

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

#define maxn 1000010

int next[maxn],f[maxn],k = 0;
char st[maxn];

void get_next(char *s)
{

int i=0,j=-1,len=strlen(s);
next[0]=-1;
while(i<len)
  {
        if(j==-1||s[i]==s[j])
   {
    i++;
    j++;
      next[i]=j;
   }
   else
    j=next[j];
  }
}


int work()
{
    int i,len,t;
    scanf("%s",st);
    len = strlen(st);
    if (st[0] == '.' && len == 1) return 0;
    get_next(st);
    for(i = 1;i <= len;i++) f[i] = 1;
    for(i = 2;i <= len;i++) {
      if (next[i] && (next[i] / f[next[i]]) == (i - next[i])) f[i] = f[next[i]]+1;
      }
    //for(i = 1;i <= len;i++) printf("%d ",next[i]);printf("\n");
    //for(i = 1;i <= len;i++) printf("%d ",f[i]);printf("\n");
    printf("%d\n",f[len]);
    return 1;
}

int main()
{
    while(work());
    return 0;
}