|poj 1961|KMP|Period

poj传送门

/*    poj 1961    教训：    1、kmp求循环节是n-f[n] */#include<cstdio>#include<cstring>#include<algorithm>#include<vector>using namespace std;#define ms(i,j) memset(i, j, sizeof i);const int MAXN = 1000000 + 5;int n, kase = 0;char s[MAXN];int f[MAXN];void init(){    scanf("%s", 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);    }    printf("Test case #%d\n", kase);    for (int i=1;i<=n;i++)    {        int xh = i - f[i];        if (i != xh && i % xh == 0)            printf("%d %d\n", i, i/xh);    }    printf("\n");}int main(){    while (scanf("%d", &n)==1&&n)    {        kase++;        init();        solve();    }    return 0;}