题解

#include<bits/stdc++.h>
using namespace std;

bool is_palindrome(string x)
{
    int n=x.length();
	bool ispalindrome=true;
	for (int i=0;i<n/2;i++)
	{
		if (x[i]!=x[n-i-1])
		    ispalindrome=false;
	}
	if (ispalindrome) return true;
	else return false;
}

int main()
{
    int n;
    cin >> n;
    for (int i=1;i<=n;i++)
    {
        string s;
        stringstream ss;
        ss << i;
        ss >> s;
        if (is_palindrome(s)) cout << s << endl;
    }
}