Pagini recente » Cod sursa (job #1633650) | Cod sursa (job #853218) | Cod sursa (job #2635539) | Cod sursa (job #2000258) | Cod sursa (job #2106263)
#include<cstdio>
#include<cstring>
#include<fstream>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int t,l,q,i,n,j,poz,k,urmator[1000009];
char s[1000009];
void prefix()
{
k=0;
urmator[1]=0;
t=strlen(s);
for(q=2;q<=t;++q)
{
while(k>0&&s[q]!=s[k+1])
k=urmator[k];
if(s[q]==s[k+1])
k++;
urmator[q]=k;
}
}
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>s+1;
s[0]='*';
k=0;
poz=0;
prefix();
l=strlen(s);
for(j=1;j<=l;++j)
if(urmator[j]&&j%(j-urmator[j])==0)
poz=j;
g<<poz<<'\n';
}
return 0;
}