Power Strings
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 41834 | Accepted: 17394 |
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.
确切说,这道题刚开始准备一点一点的匹配,可是那样的话肯定超时,去看了看网上,好简单的方法,可是并不理解:
#include <iostream>
#include <cstring>
#include <cstdio>
#define MAXN 1000001
using namespace std;
char s[MAXN];
int next[MAXN];
inline void get_next(int len_s)
{
int i=0,j=-1;
next[0]=-1;
while(i!=len_s)
{
if(s[i]==s[j] || j==-1) next[++i]=++j;
else j=next[j];
}
}
int main()
{
while(~scanf("%s",&s))
{
if(!strcmp(s,".")) break;
int len_s=strlen(s);
get_next(len_s);
if(len_s%(len_s-next[len_s])==0) printf("%d\n",len_s/(len_s-next[len_s]));
else printf("1\n");
}
return 0;
}