Pagini recente » Cod sursa (job #2419875) | Cod sursa (job #1207548) | Cod sursa (job #2515997) | Cod sursa (job #2595657) | Cod sursa (job #2985210)
#include <bits/stdc++.h>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
const int N = 1e6 + 5;
int pi[N];
signed main()
{
int t;
in >> t;
while(t--)
{
string s;
in >> s;
int n = s.size();
s = s + '#';
pi[1] = 0;
for (int i = 1; i < n; i++)
{
int j = pi[i-1];
while (j > 0 && s[i] != s[j])
j = pi[j-1];
if (s[i] == s[j])
j++;
pi[i] = j;
}
int ans = 0;
for(int i = 1; i <= n - 1; i++)
{
if(pi[i] > 0 && (i + 1) % (i + 1 - pi[i]) == 0)
ans = i;
}
if(ans == 0)
out << 0 << '\n';
else out << ans + 1 << '\n';
memset(pi, 0, sizeof(pi));
}
return 0;
}