Pagini recente » Cod sursa (job #2274657) | Cod sursa (job #1134180) | Cod sursa (job #2718942) | Cod sursa (job #720430) | Cod sursa (job #2092225)
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
ifstream si("prefix.in");
ofstream so("prefix.out");
string r,s;
int pr[1000005];
int main()
{
int q;
si>>q;
while(q--)
{
si>>r;
s=" ";
s+=r;
int n=s.size();
int p=0;
for(int i=2;i<=n;++i)
{
while(p&&s[p+1]!=s[i])
p=pr[p];
if(s[p+1]==s[i])
p++;
pr[i]=p;
}
int i;
for(i=n;i;--i)
if(pr[i]&&i%(i-pr[i])==0)
{
break;
}
so<<i<<'\n';
}
return 0;
}