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.
题意: 假设s可以由t重复n次拼成,即s=tttt……tt,我们称为s=t^n。先给定一个字符串s,求最大的幂次n使得存在t满足s=t^n。
分析: 最小循环节模板题,复习一下。当s串可以由最小循环节拼成时答案为最小循环节段数,否则答案为1。
具体代码如下:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
char s[1000005];
int _next[1000005];
signed main()
{
while(~scanf("%s", s+1))
{
if(!strcmp(s+1, "."))
break;
int len = strlen(s+1);
for(int i = 2, j = 0; i <= len; i++)
{
while(j && s[j+1] != s[i])
j = _next[j];
if(s[j+1] == s[i])
j++;
_next[i] = j;
}
int loop = len-_next[len], ans = 1;
if(len % loop == 0)
ans = len/loop;
printf("%d\n", ans);
}
return 0;
}