HDU—3746—kmp（循环节2）

Cyclic Nacklace

CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to tide over the last days. Being inspired by the entrepreneurial spirit of "HDU CakeMan", he wants to sell some little things to make money. Of course, this is not an easy task. 

As Christmas is around the corner, Boys are busy in choosing christmas presents to send to their girlfriends. It is believed that chain bracelet is a good choice. However, Things are not always so simple, as is known to everyone, girl's fond of the colorful decoration to make bracelet appears vivid and lively, meanwhile they want to display their mature side as college students. after CC understands the girls demands, he intends to sell the chain bracelet called CharmBracelet. The CharmBracelet is made up with colorful pearls to show girls' lively, and the most important thing is that it must be connected by a cyclic chain which means the color of pearls are cyclic connected from the left to right. And the cyclic count must be more than one. If you connect the leftmost pearl and the rightmost pearl of such chain, you can make a CharmBracelet. Just like the pictrue below, this CharmBracelet's cycle is 9 and its cyclic count is 2: 

Now CC has brought in some ordinary bracelet chains, he wants to buy minimum number of pearls to make CharmBracelets so that he can save more money. but when remaking the bracelet, he can only add color pearls to the left end and right end of the chain, that is to say, adding to the middle is forbidden. 
CC is satisfied with his ideas and ask you for help.

Input

The first line of the input is a single integer T ( 0 < T <= 100 ) which means the number of test cases. 
Each test case contains only one line describe the original ordinary chain to be remade. Each character in the string stands for one pearl and there are 26 kinds of pearls being described by 'a' ~'z' characters. The length of the string Len: ( 3 <= Len <= 100000 ).

Output

For each case, you are required to output the minimum count of pearls added to make a CharmBracelet.

Sample Input

3
aaa
abca
abcde

Sample Output

0
2
5

题目大意就是一个字符串，让你添加最少的字符使它是一个循环节。

用kmp，用nex确定循环的情况，x = len - nex[len] 就是最小循环节的判断循环的条件（len为字符串长度）共分三种情况：

1，当 nex[len] == 0的时候，即没有重复的前后缀，直接输出len；

2，当 len % x == 0 时，即字符串本身就是循环节，可以自己思考下为什么，输出0；

3，就是部分循环的情况，输出 x - len % x 。

#include<stdio.h>
#include<string.h>
const int N = 100005;
char a[N];
int nex[N],len;

void init()
{
	nex[0] = -1;  //nex数组的建立 
	int i = 0,j = -1;
	while(i < len)
	{
		if(j == -1 || a[i] == a[j])
			nex[++i] = ++j;
		else
			j = nex[j];
	}
}

int main()
{
	int n;
	scanf("%d",&n);
	while(n--)
	{
		memset(nex,0,sizeof nex);
		scanf("%s",a);
		len = strlen(a);
		init();
		int x = len - nex[len];  //分的三种情况 
		if(!nex[len]) printf("%d\n",len);
		else if(len % x == 0) printf("%d\n",0);
		else printf("%d\n",x - len % x);
	}
	return 0;
}