Power Strings
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 43751 | Accepted: 18257 |
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
用KMP算法求出next数组后,找到最后一个0的位置,这个就是最短的数结束循环的位置。然后输出 l / (endd + 1) 然后就光荣的wa了。
原因是没有考虑特殊情况,例子:ABABA,输出应该是1,但是按上面的会输出2。所以我们还要判断一下 l 是否能整除 (endd + 1) ,如果不能就输出1。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define LL long long
#define MAX 1000000
char T[MAX+11];
int next[MAX+11];
void makeNext()
{
next[0] = 0;
int l = strlen(T);
int endd = 0;
int k = 0;
for (int i = 1 ; i < l ; i++)
{
while (k > 0 && T[i] != T[k])
k = next[k-1];
if (T[k] == T[i])
k++;
next[i] = k;
if (next[i] == 0)
endd = i;
}
printf ("%d\n",(l % (endd+1) == 0) ? (l / (endd+1)) : 1);
}
int main()
{
while (~scanf ("%s",T))
{
if (T[0] == '.')
break;
makeNext();
}
return 0;
}