39 lines
719 B
C++
39 lines
719 B
C++
|
|
#include <bits/stdc++.h>
|
|||
|
|
using namespace std;
|
|||
|
|
|
|||
|
|
//<2F>ж<EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD>Dz<EFBFBD><C7B2>ǻ<EFBFBD><C7BB>Ĵ<EFBFBD>
|
|||
|
|
bool isHuiWen(string s){
|
|||
|
|
if(s.size()<2) return false;
|
|||
|
|
for(int i=0;i<s.size()/2;i++)
|
|||
|
|
if(s[i]!=s[s.size()-1-i]) return false;
|
|||
|
|
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
int main(){
|
|||
|
|
int T;
|
|||
|
|
cin>>T;
|
|||
|
|
|
|||
|
|
while(T--){
|
|||
|
|
string s;
|
|||
|
|
cin>>s;
|
|||
|
|
|
|||
|
|
int flag=0;
|
|||
|
|
//ö<>ٵ<EFBFBD>һ<EFBFBD><D2BB><EFBFBD>Ӵ<EFBFBD><D3B4>Ľ<EFBFBD>βλ<CEB2><CEBB>
|
|||
|
|
for(int i=0;i<s.size();i++){
|
|||
|
|
string s1,s2;
|
|||
|
|
for(int j=0;j<=i;j++) s1+=s[j];//ƴ<>ӵ<EFBFBD>һ<EFBFBD><D2BB><EFBFBD>Ӵ<EFBFBD>
|
|||
|
|
for(int j=i+1;j<s.size();j++) s2+=s[j];//ƴ<>ӵڶ<D3B5><DAB6><EFBFBD><EFBFBD>Ӵ<EFBFBD>
|
|||
|
|
//cout<<"s1="<<s1<<",s2="<<s2<<endl;
|
|||
|
|
if(isHuiWen(s1) && isHuiWen(s2)){
|
|||
|
|
cout<<"Yes"<<endl;
|
|||
|
|
flag=1;
|
|||
|
|
break;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
if(flag==0) cout<<"No"<<endl;
|
|||
|
|
}
|
|||
|
|
return 0;
|
|||
|
|
}
|
|||
|
|
|