字符串的简单模拟,需要注意的是输入里面保证不会有零
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
int main() {
string str;
char s[50] = "A 3 HIL JM O 2TUVWXY51SE Z 8 ";
while (cin >> str) {
int flag1 = 0, flag2 = 0;
string tmp = str;
reverse(all(tmp));
if (tmp == str) flag1 = 1;
for (int i = sz(str) - 1; i >= 0; i--) {
tmp[sz(str) - 1 - i] = (str[i] <= 'Z' && str[i] >= 'A' ? s[str[i] - 'A'] : s[str[i] - '0' + 25]);
}
if (tmp == str) flag2 = 1;
cout << str << " -- is ";
if (!flag1 && !flag2) cout << "not a palindrome.\n";
else if (flag1 && !flag2) cout << "a regular palindrome.\n";
else if (!flag1 && flag2) cout << "a mirrored string.\n";
else cout << "a mirrored palindrome.\n";
cout << endl;
}
return 0;
}