Pagini recente » Cod sursa (job #2630591) | Cod sursa (job #1113696) | Cod sursa (job #2122563) | Cod sursa (job #1555148) | Cod sursa (job #1495312)
#include <fstream>
#include <cstring>
#define NMAX 1000005
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int n , m , pi[NMAX] , nr , T;
char c[NMAX];
int main()
{
f >> T;
while(T--) {
f >> c + 1;
n = strlen(c + 1);
memset(pi , 0 , sizeof(pi));
pi[1] = 0;
for(int i = 2 ; i <= n ; ++i) {
int k = pi[i - 1];
while(k > 0 && c[i] != c[k + 1]) {
k = pi[k];
}
if(c[i] == c[k + 1]) {
pi[i] = k + 1;
}
else{
pi[i] = 0;
}
}
int sol = 0;
for(int i = 1 ; i <= n ; ++i) {
if(pi[i] != 0 && i % (i - pi[i]) == 0) {
sol = max(sol , i);
}
}
g << sol << '\n';
}
return 0;
}