Pagini recente » Cod sursa (job #3292184) | Cod sursa (job #3234162) | Cod sursa (job #1398363) | Cod sursa (job #2135538) | Cod sursa (job #1584000)
#include <fstream>
#include<cstring>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
char s[1000001]; int l;
bool bla (int i,int j,int k)
{
int u;
for(u=j;u<=k;u++) if(s[u]!=s[u-i]) return false;
return true;
}
int mergi (int i)
{
int j,maxim=0,o=i;
for(j=i;j<=l;j+=i)
{
if(bla(i,j,j+i-1)) o+=i; else break; if(o>maxim) maxim=o;
}
return maxim;
}
int main()
{
int i,n,j,k,maxim;
f>>n;
for(j=1;j<=n;j++)
{
f>>s; maxim=0;
l=strlen(s);
for(i=l/2;i>=1;i--)
{
k=mergi(i); if(k>maxim) maxim=k;
}
g<<maxim<<"\n";
}
f.close();
g.close();
return 0;
}