//判断回文数
bool isPalindromic(string num){
bool flag = true;
int len = num.length();
for(int i = 0; i <= len/2; i++){
if(num[i] != num[len - i - 1]){
flag = false;
}
}
return flag;
}
//将十进制数转化为X进制字符串
string trans(int num, int base){
string str;
while(num > 0){
if(num % base < 10){
str += num % base + '0';
}
else{
str += num % base - 10 + 'A';
}
num = num / base;
}
reverse(str.begin(),str.end());
return str;
}