141. 周期 - AcWing题库
循环节:前缀和后缀相等的情况下, 前缀 - 后缀的 前缀的那部分
#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#define x first
#define int long long
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<char,int> PCI;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N=2e7+10,INF = 1e9 ,mod = 1e9 + 7 ;
const double eps = 1e-7;
int n,m;
char p[N];
int ne[N];
void get()
{
for(int i=2,j=0;i<=n; i++ )
{
while(j && p[i] !=p[j + 1]) j = ne[j] ;
if(p[i] == p[j + 1]) j ++ ;
ne[i] = j;
}
}
void solve()
{
int T =1;
while(cin >> n , n)
{
cin >> p + 1;
get();
cout << "Test case #"<<T ++ << endl;
for(int i=1;i<=n; i++ )
{
int t = i - ne[i];
if(i/ t > 1 && i %t == 0 )
cout << i << " " << i /t<<endl;
}
cout << endl;
}
}
signed main()
{
// freopen("1.txt","r",stdin);
ios
LL T=1;
// cin>>T;
while(T -- )
{
solve();
}
return 0;
}