Pagini recente » Cod sursa (job #2428001) | Cod sursa (job #1366765) | Cod sursa (job #1825383) | Cod sursa (job #1645907) | Cod sursa (job #1468301)
#include <fstream>
#include <cstring>
#define Xp 1000013
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int t,k,i,lung,P[Xp];
char a[Xp];
int main()
{
f>>t;
while(t--)
{
f>>(a+1);
lung=strlen(a+1);
P[1]=k=0;
for(i=2;i<=lung;++i)
{
while(k&&a[k+1]!=a[i]) k=P[k];
if(a[k+1]==a[i]) ++k;
P[i]=k;
}
for(i=lung;i;--i) if(P[i]&&i%(i-P[i])==0) {g<<i<<'\n'; break;}
if(!i) g<<0<<'\n';
}
return 0;
}