可逆素數

#include<iostream>#include<cmath>using namespace std;int main(){int i,j,k=0,m,n;bool prime1,prime2;cout<<"萬以內的可逆素數有："<<endl;cout<<2;for(i=3;i<=10000;i++){prime1=true;for(j=2;j<=sqrt(i);j++){if(i%j==0){prime1=false;break;}}if(prime1){            m=i;n=0;while(m>0){n=n*10+m%10;m=m/10;}prime2=true;for(j=2;j<=sqrt(n);j++){if(n%j==0){prime2=false;break;}}    if(prime2){  k++;if(k%10!=0)cout<<"\t"<<i;elsecout<<endl<<i;}}}cout<<endl;    return 0;}