A - Déjà Vu(思维)

https://codeforces.com/contest/1504/problem/A

---

思路：

发现全a的不行，剩下的放开头/结尾一定可以构造出一个。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=3e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      cin>>(str+1);
      LL n=strlen(str+1);
      bool flag=0;
      for(LL i=1;i<=n;i++){
         if(str[i]!='a') flag=1;
      }
      if(flag==0){
        cout<<"NO"<<"\n";
      }
      else{
        str[0]='a';
        bool flag1=0;
        for(LL i=0,j=n;i<=j;i++,j--){
            if(str[i]!=str[j]){
                flag1=1;break;
            }
        }
        if(flag1){
            cout<<"YES"<<"\n";
            for(LL i=0;i<=n;i++){
                cout<<str[i];
            }
            cout<<"\n";
        }
        else{
            bool flag2=0;
            str[n+1]='a';
            for(LL i=1,j=n+1;i<=j;i++,j--){
                if(str[i]!=str[j]){
                    flag2=1;
                    break;
                }
            }
            if(flag2){
                cout<<"YES"<<"\n";
                for(LL i=1;i<=n+1;i++){
                    cout<<str[i];
                }
                cout<<"\n";
            }
            else cout<<"NO"<<"\n";
        }
      }
   }
   return 0;
}