#include <iostream> #include <cmath> using namespace std; // 判断素数函数 bool isPrime(int num) { if (num <= 1) return false; for (int i = 2; i <= sqrt(num); ++i) { if (num % i == 0) return false; } return true; } // 判断回文数函数 bool isPalindrome(int num) { int original = num, reversed = 0; while (num > 0) { reversed = reversed * 10 + num % 10; num /= 10; } return original == reversed; } int main() { for (int i = 100; i <= 999; ++i) { if (isPrime(i) && isPalindrome(i)) { cout << i << endl; } } return 0; }