2406 Power Strings //暴力或者KMP

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 14024		Accepted: 5873

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.

Source

Waterloo local 2002.07.01

 

暴力。。。。。。。。

#include<stdio.h>

#include<string.h>

char s[1000001];

int l;

bool match(int len)

{

    for(int i=0;i<l;)

    {

      for(int j=0;j<len-1;j++,i++)

      if(s[i]!=s[j])  return false;

    }

    return true;

}

int main()

{

    while(scanf("%s",s)!=EOF)

    {

        if(s==".")  break;

        l=strlen(s);

        for(int i=0;i<l;i++)

        {

            if(l%(i+1)==0&&match(i+1))

            {

                printf("%d/n",l/i+1);

                break;

            }

        }

        printf("0/n");

    }

    return 0;

}

KMP，要深刻理解了KMP那个P数组的作用，这个作用可以媲美于树状数组那个，极其精妙，膜拜

#include<stdio.h>

#include<string.h>

char s[1000001];

int p[1000001],l;

void init()

{

    int j;

    p[1]=0;

    for(int i=2;i<l;i++)

    {

        j=p[i-1];

        while(j>0&&s[j+1]!=s[i])  j=p[j];

        if(s[j+1]==s[i])  j++;

        p[i]=j;

    }

}

int main()

{

    while(scanf("%s",s+1)!=EOF)

    {

        s[0]='1';

        l=strlen(s);

        if(l==2&&s[1]=='.')  break;

        init();

        l--;

        if(l%(l-p[l])==0) printf("%d/n",l/(l-p[l]));

        else  printf("1/n");

    }

    return 0;

}