根据next数组的定义(最长公共前后缀),字符串的最小循环节为L = len - next[len]
若len % L == 0 ,则说明字符串由若干个完整的循环节构成,周期为T = len / L
否则,字符串由若干个完整的循环节和一个不完整的循环节构成,不完整的循环节长度为len % L,构成完整的循环节需要加 L - len % L 个字符
#pragma comment(linker,"/STACK:1024000000,1024000000")
#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<utility>
#include<iostream>
#include<algorithm>
#include<functional>
#include<unordered_map>
#include<unordered_set>
using namespace std;
#define ios ios::sync_with_stdio(false)
#define ll long long
#define pa pair<int,int>
#define sc(n) scanf("%d",&n)
#define ss(s) scanf("%s",s)
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define of(i,a,b) for(int i=a;i>=b;i--)
#define mem(a,b) memset(a,b,sizeof a)
#define uint unsigned int
#define vr vector<int>
#define pi acos(-1)
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll N = 1e6 + 10;
int nex[N];
char s[N];
void get_next()
{
int i = 0;
int j = -1;
int len = strlen(s);
nex[0] = -1;
while (i < len)
{
if (j == -1 || s[i] == s[j])
{
i++;
j++;
nex[i] = j;
}
else
j = nex[j];
}
}
int main()
{
scanf("%s", s);
get_next();
int len = strlen(s);
cout << "最小循环节: " << len - nex[len] << endl;
}