|Hdu 3746|KMP|Cyclic Nacklace

Hdu传送门
注意一下分类讨论

/*
    hdu 3746
    KMP
    教训：
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
#define ms(i,j) memset(i, j, sizeof i);

const int MAXN = 100000 + 5; 

int n, f[MAXN]; 
char s[MAXN];

void init()
{
    scanf("%s", s); 
    n = strlen(s);
}
void solve()
{
    f[0] = f[1] = 0;
    for (int i=1;i<n;i++)
    {
        int j = f[i];
        while (j && s[i]!=s[j]) j = f[j];
        f[i+1] = (s[i]==s[j]) ? (j+1) : (0);
    }
    int xh = n - f[n];
    if (xh==n) printf("%d\n", n);
    else if (n%xh==0) printf("%d\n", 0);
    else printf("%d\n", xh*(n/xh+1)-n);
}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        init();
        solve();
    }
    return 0;
}