Pagini recente » Cod sursa (job #1639941) | Cod sursa (job #2602940) | Cod sursa (job #2414156) | Cod sursa (job #1573305) | Cod sursa (job #1803987)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f ("prefix.in");
ofstream g("prefix.out");
int x,n,i,j,k,um[1000005];
char s[1000005];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>s;
x=strlen(s);
k=0;
um[1]=0;
for(j=2;j<=x;j++)
{
while(k>0&&s[k]!=s[j-1]) k=um[k];
if(s[k]==s[j-1]) k++;
um[j]=k;
}
for(j=x;j>=1;j--)
{
if(um[j]!=0&&(j%(j-um[j])==0))
{
g<<j<<'\n';
break;
}
if(j==1)g<<0<<'\n';
}
}
return 0;
}