题目如下:
思路:
1.转换的进制数用字符串储存;
2.检查是否回文。
代码如下:
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
char m[30] = {'0', '1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J'};
//进制转换存入字符串中
string Switch(int x, int n)
{
string s = "";
while(x)
{
s += m[x%n];
x /= n;
}
reverse(s.begin(), s.end());//需要翻转
return s;
}
//检验是否与为回文
bool HuiWen(string s)
{
int i = 0;
int j = s.size()-1;
while(i <j)
{
if(s[i] != s[j]) return false;
i++, j--;
}
return true;
}
int main()
{
int n;
cin >> n;
for(int i = 1; i <= 300; i++)
{
string num = Switch(i, n);
string Pnum = Switch(i*i, n);
if(HuiWen(Pnum)) cout << num <<" "<< Pnum << endl;
}
return 0;
}