【KMP】HDU 3746

注意理解好p数组的含义！！！n - p[n]就是一个循环节的长度。x = n - p[n]，x - (p[n] % x) = 形成两个循环节增加最小字符个数

#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <time.h>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <cstdlib>
#include <limits.h>
#include <string.h>
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

#define LL long long
#define MIN INT_MIN
#define MAX INT_MAX
#define PI acos(-1.0)
#define FRE freopen("input.txt","r",stdin)
#define FF freopen("output.txt","w",stdout)
#define N 100005
#define MOD 10007
char str[N];
int p[N];
int n;
void gao() {
    int i,j = 0;
    p[1] = 0;
    for (i = 2; i <= n; i++) {
        while (j > 0 && str[i] != str[j+1]) {
            j =p[j];
        }
        if (str[i] == str[j+1]) j++;
        p[i] = j;
    }
    int x = n - p[n];
    if (n % x == 0 && p[n]) {
        puts("0");
    } else {
        printf("%d\n",x - (p[n] % x));
    }
}
int main () {
    int t;
    scanf("%d",&t);
    while (t--) {
        int i;
        scanf("%s",str+1);
        n = strlen(str+1);
        gao();
    }
    return 0;
}