Cod sursa(job #1325466)
Utilizator | Data | 23 ianuarie 2015 22:50:48 | |
---|---|---|---|
Problema | Prefix | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.76 kb |
#include<fstream>
using namespace std;
int pi[1000001];
string s;
int main()
{
ifstream fin("prefix.in");
ofstream fout("prefix.out");
int t,i1;
fin>>t;
for(i1=1;i1<=t;i1++)
{
int i,r,ans=0;
fin>>s;
s="$"+s;
pi[1]=0;
int n=(int)s.size();
for(i=2;i<n;++i)
{
r=pi[i-1];
while(r!=0 && s[r+1]!=s[i])
r=pi[r];
if (s[r+1]==s[i])
pi[i]=r+1;
else
pi[i]=0;
}
for(i=n-1;i>0;--i)
if (pi[i]>0 && i%(i-pi[i])==0)
{
ans=i;
break;
}
fout<<ans<<'\n';
}
return 0;
}