Pagini recente » Cod sursa (job #1009635) | Cod sursa (job #2531712) | Cod sursa (job #1709154) | Cod sursa (job #1175830) | Cod sursa (job #1301685)
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1000010;
int t,n,pi[N];
char a[N];
int solve(char a[],int n)
{
int p = 0,ans = 0;
for (int i=2;i<=n;++i)
{
while ( p>0 && a[i] != a[p+1] )
p = pi[p];
if ( a[i] == a[p+1] )
p++;
pi[i] = p;
if ( i % (i-p) == 0 )
if ( p > 0 )
ans = i;
}
return ans;
}
int main()
{
freopen("prefix.in","r",stdin);
freopen("prefix.out","w",stdout);
scanf("%d\n",&t);
while ( t-- )
{
scanf("%s",a+1);
n = strlen(a+1);
printf("%d\n",solve(a,n));
}
}