Cod sursa(job #796398)
| Utilizator | Data | 11 octombrie 2012 13:30:58 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#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 fin("prefix.in");
ofstream fout("prefix.out");
fin>>T;
while(T--)
{
fin>>(s+1);
n=strlen(s+1);
fout<<Prefix()<<"\n";
}
fin.close();
fout.close();
return 0;
}
