#include <iostream>
using namespace std;
bool isPrime(int num) {
if (num < 2)
return false;
for (int i = 2; i * i <= num; i++) {
if (num % i == 0)
return false;
}
return true;
}
int main() {
for (int i = 100; i < 1000; i++) {
if (isPrime(i)) {
int num = i % 10 * 100 + i / 10 % 10 * 10 + i / 100;
if (isPrime(num))
printf("%d\n",i);
}
}
return 0;
}
SWUSTOJ 1174: 绝对素数
最新推荐文章于 2024-07-08 22:12:26 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)