Pagini recente » Cod sursa (job #1515412) | Cod sursa (job #2193712)
#include <fstream>
#include <cstring>
using namespace std;
ifstream cin ("prefix.in");
ofstream cout ("prefix.out");
const int nmax = 1000000;
int t, n;
char pat[1 + nmax];
int lps[1 + nmax];
int main() {
cin >> t;
for(; t; t--) {
cin >> (pat + 1);
n = strlen(pat + 1);
int i = 0, j = 2;
lps[1] = 0;
while(j <= n) {
if(pat[i + 1] == pat[j]) {
i++;
lps[j] = i;
j++;
} else {
if(i)
i = lps[i];
else {
lps[j] = 0;
j++;
}
}
}
i = n;
while(i >= 1 && (i % (i - lps[i]) || lps[i] == 0))
i--;
cout << i << "\n";
}
return 0;
}