Pagini recente » Cod sursa (job #1642817) | Cod sursa (job #927385) | Cod sursa (job #872510) | Cod sursa (job #1590536) | Cod sursa (job #927397)
Cod sursa(job #927397)
#include<cstdio>
#include<fstream>
using namespace std;
#define MAX 1000005
int T , pi[MAX] , q , best[MAX];
char s[MAX];
bool ok[MAX];
int main()
{
ifstream f("prefix.in");
ofstream g("prefix.out");
f>>T;
for(int i = 1 ; i <= T ; ++i )
{
f>>(s+1);
pi[0] = pi[1] = 0;
q = 0;
for(int i = 2 ; s[i] ; ++i )
{
while(s[i]!=s[q+1] && q)
q = pi[q];
if(s[i] == s[q+1])
q++;
pi[i] = q;
}
int maxx = 0;
for(int i = 1 ; s[i] ; ++i )
if(pi[i] && pi[i]%(i-pi[i])==0)
maxx = i;
g<<maxx<<"\n";
}
f.close();
g.close();
return 0;
}