C++区间的真素数
#include <iostream>
using namespace std;
int prime(int x){
for(int i=2;i*i<=x;i++) if(x%i==0) return 0;
return 1;
}
int back(int x){
int sum=0,n;
while(x>0){
n=x%10;
sum*=10;
sum+=n;
x/=10;
}
return sum;
}
int main(){
int m,n,k=0,a;
cin>>m>>n;
for(int i=m;i<=n;i++) if(prime(i)) if(prime(back(i))) a=i;
for(int i=0;i<k;i++) cout<<a<<",";
return 0;
}
https://blog.51cto.com/u_15467636/4864000
页:
[1]