Pagini recente » Cod sursa (job #3297633) | Cod sursa (job #2500802) | Cod sursa (job #736247) | Cod sursa (job #1250660) | Cod sursa (job #2538316)
#include <vector>
#include <string>
#include <fstream>
using namespace std;
ifstream cin("prefix.in");
ofstream cout("prefix.out");
int main(){
long long t;
cin>>t;
while(t--){
string s;
cin>>s;
vector<int> pi(s.size(), 0);
for(size_t x = 1, p = 0;x<s.size();x++){
if(s[x] == s[p]){
p++;
pi[x] = p;
}else{
if(p && (s[x] != s[p]))
p = pi[p - 1];
if(s[x] == s[p])
p++;
pi[x] = p;
}
}
for(long long x = s.size();x>=2;x--){
if(pi[x - 1] && !(x % (x - pi[x - 1]))){
cout<<x<<'\n';
goto cnt;
}
}
cout<<"0\n";
cnt:continue;
}
return 0;
}