HDU 1358 KMP

 3
aaa
12
aabaabaabaab
0 

 Test case #1
2 2
3 3

Test case #2
2 2
6 2
9 3
12 4 

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
#define maxn 100005
#define inf 0x3f3f3f3f
int f[maxn];
char t[maxn],p[maxn];
int n;
void getfail(){
   f[0]=f[1]=0;
   for(int i=1;i<n;i++){
    int j=f[i];
    while(j&&p[i]!=p[j])j=f[j];
    f[i+1]=p[i]==p[j]?j+1:0;
   }
}
int main()
{
    int t=0;
    freopen("in.txt","r",stdin);
   while(~scanf("%d",&n)&&n){
    scanf("%s",p);
    getfail();
    /*
    for(int i=0;i<=n;i++){
        cout<<f[i]<<" ";
    }
    cout<<endl;
    */
    printf("Test case #%d\n",++t);
    for(int i=2;i<=n;i++){
        if(f[i]>0&&i%(i-f[i])==0)
        printf("%d %d\n",i,i/(i-f[i]));
    }
   }
}

HDU 1358 KMP

原文：http://blog.csdn.net/u013497977/article/details/44574975