#include <iostream> #include <vector> #include <algorithm> using namespace std; // 判断素数函数 bool isPrime(int num) { if (num <= 1) return false; for (int i = 2; i * i <= num; ++i) { if (num % i == 0) return false; } return true; } // 生成二位绝对素数列表 vector<int> generateAbsolutePrimes() { vector<int> primes; for (int i = 10; i <= 99; ++i) { if (isPrime(i)) { int swapped = (i % 10) * 10 + i / 10; if (isPrime(swapped)) { primes.push_back(i); } } } return primes; } int main() { vector<int> primes = generateAbsolutePrimes(); sort(primes.begin(), primes.end()); for (int prime : primes) { cout << prime << endl; } return 0; }