Cod sursa(job #2216208)
| Utilizator | Data | 25 iunie 2018 21:26:48 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
char a[2000100],x;
int i,n,m,k,j,nr,q,t,Max;
int p[2000100];
int main()
{
in>>t;
for(q=1;q<=t;q++)
{
Max=0;
in>>(a+1);
n=strlen(a+1);
j=0;
i=2;
p[1]=0;
while(i<=n)
{
while(a[i]!=a[j+1]&&j>0) j=p[j];
if(a[i]==a[j+1])
j++;
p[i]=j;
i++;
}
for(i=1;i<=n;i++)
{
if(i%(i-p[i])==0&&p[i]>0)
if(i>Max) Max=i;
}
out<<Max<<'\n';
}
return 0;
}
