Pagini recente » Istoria paginii runda/preoji_11-12 | Cod sursa (job #2954209) | Cod sursa (job #2464911) | Istoria paginii runda/aaaaaa/clasament | Cod sursa (job #733589)
Cod sursa(job #733589)
#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
char c[1000001];
int v[1000001],n;
void prefix()
{
int i,q;
q=0;
v[1]=0;
for(i=2;i<=n;i++) {
while((q)&&(c[i]!=c[q+1]))
q=v[q];
if(c[i]==c[q+1])
q++;
v[i]=q;
}
}
int main ()
{
int t,i,j,max;
ifstream f("prefix.in");
ofstream g("prefix.out");
f>>t;
for(i=1;i<=t;i++) {
f>>c;
n=strlen(c)-1;
for(j=n;j>=0;j--)
c[j+1]=c[j];
c[0]=' ';
n++;
prefix();
max=0;
for(j=1;j<=n;j++)
if((v[j])&&(j%(j-v[j])==0))
max=j;
g<<max<<'\n';
}
f.close();
g.close();
return 0;
}