//eg:131 757像這樣是回文素?cái)?shù)
#include<iostream>
#include<iomanip> //setw(int)在本文件中
using namespace std;
bool isPrime(int number); //判斷一個(gè)數(shù)是否為素?cái)?shù)
bool palindromicPrime(int num); //判斷素?cái)?shù)是否回文
int main()
{
int count = 0;
for(int k = 2;count < 100;k++){
if(isPrime(k) && palindromicPrime(k)){
count++;
if(count % 10 == 0)
cout <<setw(6)<<k<<endl;
else
cout <<setw(6)<<k;
}
}
return 0;
}
bool isPrime(int number)
{
for(int j = 2;j < number / 2; j++)
{
if(number % j == 0)
return false;
}
return true;
}
bool palindromicPrime(int num)
{
int n = 0,count = 0,num1 = num;
while(num1 > 0){
n = n * 10 + num1 % 10;
num1 = num1 / 10;
}
if(n == num)
return true;
else
return false;
}
