Pagini recente » Cod sursa (job #2815711) | Cod sursa (job #2177301) | Cod sursa (job #3228598) | Cod sursa (job #239886) | Cod sursa (job #3278359)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
const int NMAX=1e6+5;
int n,pi[NMAX],ans;
string s;
int main()
{
int t;
fin>>t;
while(t--)
{
ans=0;
fin>>s;
n=s.size();
int j=0;
for(int i=1; i<n; i++)
{
while(j>0&&s[i]!=s[j])
j=pi[j-1];
if (s[i]==s[j])
j++;
pi[i]=j;
if (j&&(i+1)%(i+1-j)==0)
ans=i+1;
}
fout<<ans<<'\n';
}
return 0;
}