Pagini recente » Cod sursa (job #2410910) | Cod sursa (job #1934276) | Cod sursa (job #792063) | Cod sursa (job #1725750) | Cod sursa (job #2559264)
#include<fstream>
#include<string.h>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
char s[1000001];
int pi[1000001];
int main()
{
int n,i,now,t,j,x=0;
in>>t;
for(j=1;j<=t;j++)
{
in>>s+1;
n=strlen(s+1);
for(i=2;i<=n;i++)
{
now=pi[i-1];
while(now>0&&s[now+1]!=s[i])
now=pi[now];
if(s[now+1]==s[i])
now++;
pi[i]=now;
if(pi[i]!=0&&i%(i-pi[i])==0)
x=i;
}
out<<x<<'\n';
}
return 0;
}