Pagini recente » Cod sursa (job #2468275) | Cod sursa (job #498353) | Cod sursa (job #830892) | Cod sursa (job #2615785) | Cod sursa (job #1809546)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
char s[100005];
int urm[100005],m;
void prefix()
{
int i,k=0;
urm[1]=0;
for(i=2;i<=m;i++)
{
while(k>0&&s[k]!=s[i-1])
k=urm[k];
if(s[k]==s[i-1])k++;
urm[i]=k;
}
}
void kmp()
{
int i,k=0;
for(i=m;i>=1;i--)
{
if(urm[i]!=0&&(i%(i-urm[i]))==0)
{
g<<i<<'\n';
break;
}
if(i==1) g<<0<<'\n';
}
}
int main()
{
int n,i;
f>>n;
for(i=1;i<=n;i++)
{f>>s;
m=strlen(s);
prefix();
kmp();
}
}