Pagini recente » Cod sursa (job #334302) | Cod sursa (job #1951390) | Cod sursa (job #982676) | Cod sursa (job #1517667) | Cod sursa (job #3222272)
#include <bits/stdc++.h>
using namespace std;
const string TASK("prefix");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout
const int N = 1000005;
char s[N];
int z[N];
void solve()
{
cin >> s;
int n = strlen(s);
for(int i = 0; i < n; ++i)z[i] = 0;
int l = 0, r = 0;
for(int i = 1; i < n; ++i)
{
if(i < r)z[i] = min(r - i, z[i - l]);
while(i + z[i] < n && s[i + z[i]] == s[z[i]])++ z[i];
if(i + z[i] > r)
{
l = i;
r = i + z[i];
}
}
int ans = 0;
for(int i = 1; i < n; ++i)
if(z[i] >= i)
ans = max(ans, i + z[i] - z[i] % i);
cout << ans << '\n';
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
while(t --)
solve();
return 0;
}