提交时间:2025-12-09 10:43:33

运行 ID: 75659

#include <iostream> using namespace std; bool isPalindrome(int n) { int original = n; int reversed = 0; // 反转数字 while (n > 0) { reversed = reversed * 10 + n % 10; n = n / 10; } // 比较反转后的数字与原数字 return original == reversed; } int main() { for (int i = 0; i <= 256; ++i) { int square = i * i; if (isPalindrome(square)) { cout << i << endl; } } return 0; }