将所有的回文数从小到大排列,求第N
个回文数列
#include<iostream>
using namespace std;
int isPN(long num)
{
long src = num;
long tmp = 0;
while (src != 0)
{
tmp *= 10;
tmp += src % 10;
src /= 10;
}
if (tmp == num)
return 1;
return 0;
}
int main()
{
int n;
int cnt = 0;
long i = 1;
cout << "请输入数N: ";
cin >> n;
while (cnt < n)
{
if (isPN(i) == 1)
cnt++;
}
cout << "第" << n << "个回文数是" << i - 1 << endl;
return 0;
}