POJ2406(Power Strings)

Power Strings

Description

Given two strings a and b we define ab to be their concatenation. For example, if a = “abc” and b = “def” then ab = “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

思路

给定一个字符串问这个字符串能不能由若干个相同的子串组成。KMP的next数组用法，先找出循环节的长度，如果整个字符串是循环节长度的整数倍那么答案就是循环节的个数，否则答案就是1。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1000005;
char s[maxn];
int num[maxn];
void get_next(int n)
{
	memset(num,-1,sizeof(num));
	int i = 0,j = -1;
	while(i < n){
		if(j == -1 || s[i] == s[j]){
			i++;j++;
			num[i] = j;
		}
		else{
			j = num[j];
		}
	}
}
int main()
{
	while(~scanf("%s",s)){
		if(!strcmp(s,"."))	break;
		int n = strlen(s);
		get_next(n);
		int ans = n-num[n];
		if(n%ans == 0){
			ans = n/ans;
		}
		else{
			ans = 1;
		}
		printf("%d\n",ans);
	}
	return 0;
} 

愿你走出半生，归来仍是少年~