-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1504A. Deja Vu.cpp
76 lines (63 loc) · 1.19 KB
/
1504A. Deja Vu.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using str = string;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define mp make_pair
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<str>;
using vc = vector<char>;
#define sz(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define eb emplace_back
const int mod = 998244353; // 1e9 + 7;
bool is_palindrome(string s)
{
string p = s;
reverse(all(p));
if (s == p)
return true;
else
return false;
}
void solve()
{
str s;
cin >> s;
if (!is_palindrome(s + 'a'))
{
cout << "YES\n";
cout << s + 'a' << '\n';
}
else if (!is_palindrome('a' + s))
{
cout << "YES\n";
cout << 'a' + s << '\n';
}
else
cout << "NO\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tc = 1;
cin >> tc;
while (tc--)
solve();
return 0;
}