KMP

Problem Description

CC always becomes very depressed atthe end of this month, he has checked his credit card yesterday, without anysurprise, there are only 99.9 yuan left. he is too distressed and thinkingabout how to tide over the last days. Being inspired by the entrepreneurialspirit of "HDU CakeMan", he wants to sell some little things to makemoney. Of course, this is not an easy task.

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

Now CC has brought in some ordinary bracelet chains, he wants to buy minimumnumber of pearls to make CharmBracelets so that he can save more money. but whenremaking the bracelet, he can only add color pearls to the left end and rightend 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 asingle integer T ( 0 < T <= 100 ) which means the number of test cases.
Each test case contains only one line describe the original ordinary chain tobe remade. Each character in the string stands for one pearl and there are 26kinds of pearls being described by 'a' ~'z' characters. The length of thestring Len: ( 3 <= Len <= 100000 ).

Output

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

Sample Input

3

aaa

abca

abcde

Sample Output

0

2

5

 

给出一个字符串求出形成周期串最少需要多少颗珠子

其实还是周期串的思路，求出周期，然后判断缺少的珠子数就可以了

#include<stdio.h>#include<string.h>int lena,lenb;char a[1000010];int next[1000010];void get_next(){int i=1,j=0;next[0]=0;while(i<lena){if(j==0 && a[i]!=a[j]){next[i]=0;i++;}else if(j>0 && a[i]!=a[j])j=next[j-1];else{next[i]=j+1;i++;j++;}}int s=0,k,q;k=lena-next[lena-1];if(lena%k!=0)q=lena/k+1;elseq=lena/k;s=q*k-lena;if(next[lena-1]==0)printf("%d\n",lena);elseprintf("%d\n",s);}int main() {int t;scanf("%d",&t);while(t--){scanf("%s",a);lena=strlen(a);get_next();}return 0;}