| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 130077 | 毛靖平 | 寻找绝对素数 | C++ | Wrong Answer | 2 MS | 260 KB | 615 | 2025-09-07 15:33:46 |
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int sum(int x){ int s=1; for(int i=2;i<=sqrt(x);i++){ if(x%i==0){ return 0; } } return 1; } int v(int x){ int m=x; int n=0; while(m>0){ n=n*10+m%10; m=m/10; } return n; } int main(){ int n,c=0,m,k; cin>>m>>n; for(int j=m;j<=n;j++){ k=v(j); if(sum(j)&&sum(k)){ if(sum==0){ cout<<j; c++; } else{ cout<<","<<k; } } } if(c==0){ cout<<"No"; } return 0; }
------Input------
1000 10999
------Answer-----
1009,1021,1031,1033,1061,1069,1091,1097,1103,1109,1151,1153,1181,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1279,1283,1301,1321,1381,1399,1409,1429,1439,1453,1471,1487,1499,1511,1523,1559,1583,1597,1601,1619,1657,1669,1723,1733,1741,1753,1789,1811,1831,1847,1867,1879,1901,1913,1933,1949,1979,3011,3019,3023,3049,3067,3083,3089,3109,3121,3163,3169,3191,3203,3221,3251,3257,3271,3299,3301,3319,3343,3347,3359,3371,3373,3389,3391,3407,3433,3463,3467,3469,3511,3527,3541,3571,3583,3613,3643,3697,
------Your output-----
,9001,1201,1301,3301,1601,9601,1901,7901,3011,9011,1511,3511,1811,3911,1021,3121,7121,3221,9221,1321,7321,9421,9521,9721,3821,1031,1231,1831,9931,9041,9241,9341,3541,1741,7841,9941,1151,3251,9551,3851,7951,1061,9161,7561,9661,3271,3371,1471,3571,9871,1181,1381,7481,7681,9781,1091,3191,3391,9491,9791,1103,9103,3203,9403,7603,3803,9803,9013,1213,3613,9613,1913,3023,1223,1523,7523,1723,9923,1033,9133,3433,7433,9533,1733,3733,9833,1933,7043,3343,3643,7643,9643,1153,7253,1453,1753,3853,3163,3463,7963