Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
90889 | 梁敖铭 | 寻找绝对素数 | C++ | Wrong Answer | 28 MS | 272 KB | 606 | 2024-09-18 20:41:05 |
#include<iostream> using namespace std; bool judge(int n)//判断素数 { for (int i = 2;i <= n - 1;i++) if (n % i == 0)return false; return true; } int Opp(int m) //求逆序数opp { int opp=0; while (m) { opp = opp * 10 + m% 10; m /= 10;} return opp; } void prim(int m, int n) { int q=0;//q记录已输出的个数 for (;m <= n;m++) { if(judge(m)&&judge(Opp(m))) { cout << m << " ";q++; if (q % 10 == 0) cout << endl; //每输出十个数换行 } } } int main() { int m, n; cin >> m >> n; prim(m, n); 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-----
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 3