Pagini recente » Cod sursa (job #1362241) | Cod sursa (job #1247388) | Cod sursa (job #1773666) | Cod sursa (job #2848727) | Cod sursa (job #1362163)
#include <fstream>
#include <cstring>
using namespace std;
ifstream is("prefix.in");
ofstream os("prefix.out");
int Q, N, K;
char A[1000003];
int PI[1000003];
int Sol;
void Query()
{
is >> A+1;
N = strlen(A+1);
K = 0;
PI[1] = 0;
Sol = 0;
for ( int i = 2; i <= N; ++i )
{
while ( K > 0 && A[K+1] != A[i] )
K = PI[K];
if ( A[K+1] == A[i] )
K++;
PI[i] = K;
if ( (i % (i-K)) == 0 && K > 0)
Sol = i;
}
}
int main()
{
is >> Q;
for ( int i = 1; i <= Q; ++i )
{
Query();
os << Sol << '\n';
}
is.close();
os.close();
}