Cod sursa(job #2353017)
| Utilizator | Data | 23 februarie 2019 20:04:52 | |
|---|---|---|---|
| Problema | Prefix | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
int main(){
ifstream cin("prefix.in");
ofstream cout("prefix.out");
int t;
cin>>t;
while(t--){
string s,p;
p.clear();
cin>>s;
int m=0,l=s.size()/2;
if(l){
for(int i=0;i<=l;i++){
p+=s[i];
bool c=false;
int j=0,k=i+1;
while(k<s.size()){
for(j=0;j<=i;j++){
if(p[j]!=s[k+j])break;
}
if(j!=i+1 && p[j]!=s[k+j])break;
k+=i+1;
c=true;
}
if(c)m=max(m,k);
}
cout<<m<<'\n';
}else cout<<"0\n";
}
return 0;
}
