反转算法实现

#include<iostream>
using namespace std;
inline bool isPalindrome(int x) {
       unsigned long int b = 0,a = x;
        while(a>0)
        {
        b = b * 10 + a % 10; //反转算法
        a /= 10;
        }
        if(b == x){
            return true;
        }
        return false;
}
int main(){
    int n,size_tt = 1;
    cin >> n;
    if(n < 1|| n> 100000){
        return 0;
    }
    for(int c = 1; c < n;c++){
       bool a = isPalindrome(c);
       if(a){
           cout<< c<<endl;
       }
    }
}