Cod sursa(job #1007157)
Utilizator | Data | 8 octombrie 2013 13:50:45 | |
---|---|---|---|
Problema | Prefix | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <cstdio>
#include <cstring>
#define N 1000001
using namespace std;
char a[N];
int pi[N];
int main()
{
freopen("prefix.in", "r", stdin);
freopen("prefix.out", "w", stdout);
int n, t, i, k, sol;
scanf("%d\n", &t);
a[0]='0';
while(t--)
{
gets(a+1);
n=strlen(a)-1;
pi[1]=0;
k=sol=0;
for(i=2;i<=n;i++)
{
while(k&&a[k+1]!=a[i]) k=pi[k];
if(a[k+1]==a[i]) k++;
pi[i]=k;
if(pi[i]&&i%(i-pi[i])==0) sol=i;
}
printf("%d\n", sol);
}
}