Pagini recente » Cod sursa (job #2425057) | Cod sursa (job #742900) | Cod sursa (job #1964665) | Cod sursa (job #1952188) | Cod sursa (job #2930222)
#include <fstream>
using namespace std;
ifstream cin("prefix.in");
ofstream cout("prefix.out");
int main()
{
int t;
cin>>t;
while(t--)
{
string s,s1="",s2="";
int cnt1=1,maxx=0,k=0;
cin>>s;
s1+=s[0];
s2+=s[0];
for(int i=1; i<s.size(); i++)
{
if(s[i]==s1[k])
k++;
else
{
k=0;
cnt1=1;
s1=s2;
if(s[i]==s1[k])
k++;
else
{
s1+=s[i];
}
}
if(k==s1.size())
{
cnt1++;
if(cnt1>1)
maxx=max(maxx,cnt1*k);
k=0;
}
s2+=s[i];
}
s1.clear();
s2.clear();
cout<<maxx<<'\n';
}
return 0;
}