Cod sursa(job #69580)
Utilizator | Florian MOGA moga_florian | Data | 3 iulie 2007 16:17:00 |
---|---|---|---|
Problema | Prefix | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
using namespace std;
using namespace std;
#include<fstream>
char s[1000004];
int pi[1000004];
int main()
{
ifstream fin("prefix.in");
ofstream fout("prefix.out");
int T,i,k,t;
fin>>T;
for(t=1;t<=T;t++)
{
fin>>s;
k=0;
pi[1]=0;
for(i=1;s[i];i++)
{
while( k>0 && s[k]!=s[i] )
k=pi[k-1];
if(s[k] == s[i])
k++;
pi[i]=k;
}
int sol=0;
for(i=0;s[i];i++)
if(pi[i]>0 && (i+1)%(i+1-pi[i])==0)
sol=i+1;
fout<<sol<<"\n";
}
fin.close();
fout.close();
return 0;
}