Pagini recente » Monitorul de evaluare | Monitorul de evaluare | Istoria paginii utilizator/teorogaming | Monitorul de evaluare | Cod sursa (job #2056589)
#include <fstream>
#include <string.h>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
char A[1000025],B[1000025];
unsigned long long i,q,n,pi[1000025],M,N,pos[1000025],T,imax,x;
void prefix()
{
int i, q=0;
pi[1]=0;
for(i=2;i<=M;++i)
{
while(q&&A[q+1]!=A[i]) q=pi[q];
if(A[q+1]==A[i])++q;
pi[i] = q;
x=i-q;
if(q&&i%x==0) imax=i;
}
fout<<imax<<'\n';
}
int main()
{
fin>>T;
fin.get();
for(int y=1;y<=T;y++)
{
fin.getline(A,1000025);
M=strlen(A);
N=strlen(B);
for(i=M;i;--i) A[i]=A[i-1];A[0]=' ';
prefix();
}
return 0;
}