Pagini recente » Cod sursa (job #1869421) | Cod sursa (job #2101801) | Cod sursa (job #1005766) | Cod sursa (job #2696079) | Cod sursa (job #1675435)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 7;
char s[MAXN];
int pi[MAXN];
int answer()
{
int n = strlen(s+1);
int ans = 0;
memset(pi, 0, sizeof pi);
pi[1] = 0;
for(int i = 2, q = 0; i <= n; ++i)
{
while(q && s[q + 1] != s[i])
q = pi[q];
if(s[q + 1] == s[i]) ++ q;
pi[i] = q;
if(pi[i] && i % (i - pi[i]) == 0) ans = i;
}
return ans;
}
int main()
{
freopen("prefix.in", "r", stdin);
freopen("prefix.out", "w", stdout);
int t; scanf("%d\n", &t);
while(t--)
{
gets(s+1);
printf("%d\n", answer());
}
return 0;
}