Pagini recente » Cod sursa (job #2937358) | Cod sursa (job #1923291) | Cod sursa (job #878224) | Cod sursa (job #2163831) | Cod sursa (job #2500389)
#include <fstream>
using namespace std;
char v[1000001];
int prefix[1000001];
int main()
{
ifstream cin("prefix.in");
ofstream cout("prefix.out");
int t,i,j,k;
cin>>t>>ws;
for(i=0;i<t;i++)
{
cin.getline(v+1,1000001);
prefix[1]=0; k=0;
for(j=2;v[j];++j)
{
while(k>0 && v[j]!=v[k+1])
k=prefix[k];
if(v[j]==v[k+1])
++k;
prefix[j]=k;
}
j--;
while(j>0&&!(prefix[j]!=0&&j%(j-prefix[j])==0))--j;
cout<<j<<endl;
}
return 0;
}