Pagini recente » Cod sursa (job #934958) | Cod sursa (job #1693924) | Cod sursa (job #2093933) | Cod sursa (job #563057) | Cod sursa (job #305134)
Cod sursa(job #305134)
#include<cstdio>
#include<string>
using namespace std;
#define MAX_N 1000006
char s[MAX_N];
int N;
int pi[MAX_N];
void solve()
{
int sol = 0;
int i, k = 0;
s[0] = '!';
N = strlen(s) - 1;
for(pi[1] = 0, i = 2 ; i<=N ; ++i)
{
while(k && s[i] != s[k+1]) k = pi[k];
if(s[i] == s[k+1]) ++k;
pi[i] = k;
if(k && i%(i-k) == 0) sol = i;
}
printf("%d\n",sol);
}
int main()
{
int T;
freopen("prefix.in","r",stdin);
freopen("prefix.out","w",stdout);
scanf("%d\n",&T);
while(T--)
{
memset(s,0,sizeof(s));
scanf("%s\n",s+1);
solve();
}
return 0;
}