Pagini recente » Cod sursa (job #238561) | Cod sursa (job #2668337) | Cod sursa (job #3209674) | Cod sursa (job #1889994) | Cod sursa (job #2123028)
#include <fstream>
#include <cstring>
using namespace std;
char a[2000002];
int pi[2000002];
int main()
{
int n,m,i,j,nr,k,t;
ifstream in("prefix.in");
ofstream out("prefix.out");
in>>t;
for(j=1;j<=t;j++)
{
in>>a+1;
n=strlen(a+1);
nr=0;
k=0;
pi[1]=0;
for(i=2;i<=n;i++)
{
while(k>0&&a[i]!=a[k+1])
{
k=pi[k];
}
if(a[k+1]==a[i])
{
k++;
}
pi[i]=k;
}
for(i=n;i>0;i--)
{
if(i%(i-pi[i])==0&&pi[i]>0)
break;
}
out<<i<<"\n";
}
return 0;
}