Pagini recente » Cod sursa (job #796827) | Cod sursa (job #1336680) | Cod sursa (job #1200864) | Cod sursa (job #893313) | Cod sursa (job #2068627)
#include <cstdio>
#include <cstring>
using namespace std;
char s[1000005];
int n, pre[1000005];
void buildPre() {
int len = 0, i = 1;
while(i < n) {
if(s[len] == s[i]) {
pre[i] = pre[i - 1] + 1;
++ i;
++ len;
} else {
if(len == 0) {
pre[i] = 0;
++ i;
} else {
len = pre[len - 1];
}
}
}
}
int main() {
freopen("prefix.in", "r", stdin);
freopen("prefix.out" , "w", stdout);
int t;
scanf("%d\n", &t);
while(t --) {
gets(s);
n = strlen(s);
buildPre();
int rasp = 0;
for(int p = n / 2; p >= 1; -- p) {
int apar = 0, poz = p + p - 1;
while(poz < n && pre[poz] == (apar + 1) * p) {
++ apar;
poz += p;
}
if(apar > 0 && rasp < (apar + 1) * p) {
rasp = (apar + 1) * p;
}
}
printf("%d\n", rasp);
}
return 0;
}