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.
题意: 给出一个字符串 问它最多由多少相同的字串组成
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
const int maxn = 1000007;
char mapp[maxn];
int next[maxn];
int len;
//获取next[i]数组;
void getnext()
{
int i=0, j = -1;
next[0] = -1;
while(i<len)
{
if(j==-1||mapp[i]==mapp[j])
{
i++;
j++;
next[i] = j;
}
else
j = next[j];
}
}
int main()
{
int length;
while(scanf("%s", mapp)!=EOF)
{
if(mapp[0]=='.')
break;
len = strlen(mapp);
getnext();
int ans = 1;
//如果能整除,就是说该循环节可以循环到最后;如果不能整除,(说明在相同前缀后缀之间的字串中有不能与其他匹配的字符)那么最后余下的几位不在循环内;
if(len%(len-next[len])==0)
{
ans = len/(len-next[len]);
}
printf("%d\n", ans);
}
return 0;
}