| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 87085 | 丁俊杰 | 寻找绝对素数 | Python3 | Wrong Answer | 224 MS | 3788 KB | 485 | 2024-08-03 14:44:05 |
def reverse_prime(x,y): results=[] for i in range(x,y+1): a=str(i)[::-1] b=int(a) flag=True for j in range(2,i): if i%j==0 or b%j==0: flag=False break else: results.append(i) return results x,y=map(int,input().split()) t=reverse_prime(x,y) print(",".join(map(str,t)) if t else "No") ## 如果t不为空,打印绝对素数列表,否则打印'No'
------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,1213,1217,1223,1229,1231,1237,1249,1259,1279,1283,1381,1399,1409,1429,1439,1453,1471,1487,1499,1523,1559,1583,1597,1619,1657,1669,1723,1733,1753,1789,1847,1867,1879,1913,1933,1949,1979,3019,3023,3049,3067,3083,3089,3109,3163,3169,3257,3299,3319,3343,3347,3359,3373,3389,3407,3463,3467,3469,3527,3583,3697,3719,3767,3889,3917,3929,7027,7057,7177,7187,7219,7229,7297,7349,7457,7459,7529,7577,7589,7649,7687,7699,7879,7949,9029,9349,