UVALive - 3026：Period

用KMP里面的next数组即可，原理就是next数组的原理

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<vector>
#define MAXN 1000000+10
#define ll long long
using namespace std;
char s[MAXN];
int n;
int nxt[MAXN];
void solve(){
    scanf("%s",s+);
    memset(nxt,,sizeof(nxt));
    nxt[]=;
    int k=;
    for(int i=;i<=n;i++){
        while(k&&s[k+]!=s[i])k=nxt[k];
        if(s[k+]==s[i])k++;
        nxt[i]=k;
        if(nxt[i]&&i%(i-nxt[i])==){
            printf("%d %d\n",i,i/(i-nxt[i]));
        }
    }
}
int main()
{
//    freopen("data.in","r",stdin);
    int T=;
    while(){
        scanf("%d",&n);
        if(!n)break;
        printf("Test case #%d\n",++T);
        solve();
        printf("\n");
    }
    return ;
}