Pagini recente » Cod sursa (job #919996) | Cod sursa (job #1818223) | runda/suceavaftw | Cod sursa (job #1101314) | Cod sursa (job #844935)
Cod sursa(job #844935)
#include<fstream>
#include<cstring>
using namespace std;
int T,n,pi[1000100];
char s[1000100];
inline int Prefix()
{
int i,k=0;
pi[1]=0;
for(i=2;i<=n;i++)
{
while(k && s[k+1]!=s[i])
k=pi[k];
if(s[k+1]==s[i])
k++;
pi[i]=k;
}
for(i=n;i>0;i--)
{
if(pi[i]>0 && i%(i-pi[i])==0)
return i;
}
return 0;
}
int main()
{
ifstream f("prefix.in");
ofstream g("prefix.out");
f>>T;
while(T--)
{
f>>(s+1);
n=strlen(s+1);
g<<Prefix()<<"\n";
}
f.close();
g.close();
return 0;
}