Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
116106 | 李禹宸 | 寻找绝对素数 | C++ | Wrong Answer | 184 MS | 272 KB | 656 | 2025-04-06 13:12:01 |
#include<bits/stdc++.h> using namespace std; int sum,y; void sum1(int a){ int m=0; for(int j=2;j<a;j++){ if(a%j==0){ m++; } }if(m==0){ sum++; if(sum>1){ cout<<","; } cout<<a%10*10+a/10; } } int main(){ int x,n=0,top=0,k; cin>>x>>y; if(x==1){ x++; } for(int i=x;i<=y;i++){ for(int j=2;j<i;j++){ if(i%j==0){ n++; } } if(n==0 && i>=10){ k=i; while(k!=0){ top=(top*10)+(k%10); k/=10; } sum1(top); top=0; } if(n==0 && i<10){ sum++; if(sum>1){ cout<<","; } cout<<i; } n=0; } if(sum==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-----
910,130,140,340,170,970,200,800,311,911,161,361,191,401,112,322,722,332,932,142,742,952,962,982,392,113,133,193,1003,914,934,944,364,184,794,1004,125,335,965,395,805,116,926,766,976,337,347,157,367,997,128,148,758,778,988,119,329,349,959,989,140,940,350,970,790,410,1010,931,151,391,991,221,332,152,182,782,202,1022,133,943,373,773,983,203,403,1013,223,734,364,394,794,994,145,755,175,205,415,346,376,826,947,367,797,338,158,188,388,1018,149,749,959,790,410,820,191,841,851,461,772,982,992,422,862,19