Run ID:163767

提交时间:2026-10-30 19:54:19

#include<bits/stdc++.h> using namespace std; bool isPrime(int x) { if(x < 2) return false; for(int i = 2; i <= sqrt(x); i++) { if(x % i == 0) return false; } return true; } int reverseNum(int x) { int res = 0; while(x > 0) { res = res * 10 + x % 10; x = x / 10; } return res; } int main() { int M, N; cin >> M >> N; bool first = true; for(int p = M; p <= N; p++) { if(isPrime(p) && isPrime(reverseNum(p))) { if(!first) cout << ","; cout << p; first = false; } } if(first) { cout << "No"; } return 0; }