POJ_2406_PowerStrings

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 40456		Accepted: 16833

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

这个题目问一个串的最小重复串

重复了多少次

我用了一种比较蠢得方法，枚举了所有比一半短的字符串再跟自己匹配

但是其实这个问题用next数组的性质就可以解决了

具体的方法可以看HDU_1358的题解

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
using namespace std;

const int MN=1e6+5;
const int MM=1e4+5;

char s1[MN],s2[MN];

int main()
{
    int n;
    int f;
    int ans;
    while(1)
    {
        scanf("%s",s1);
        if(s1[0]=='.')
            break;
        n=strlen(s1);
        for(int i=1;i<=n/2+1;i++)
        {
            if(n%i)
                continue;
            for(int j=0;j<i;j++)
                s2[j]=s1[j];
            f=1;
            for(int j=i;j<n;j++)
            {
                if(s2[j%i]!=s1[j])
                {
                    f=0;
                    break;
                }
            }
            if(f)
            {
                ans=n/i;
                printf("%d\n",ans);
                break;
            }
        }
        if(!f)
            printf("1\n");
    }
    return 0;
}