回文素数即一个数是回文数又是素数。
类文件:Pprimes.java
Java代码实现:
public class Pprimes {
public static void main(String[] args) {
int i = 2, sum = 0;
while (sum < 100) {
if (isPrimes(i) == true && isHuiwen(i)) {
System.out.printf("%d ", i);
sum++;
i++;
if(sum%10==0)
System.out.printf("\n");
}
else
i++;
}
}
public static boolean isPrimes(int a) { //素数的判断//
int count=0;
for (int j = 2; j <=(int)Math.sqrt(a); j++) {
if (a % j == 0)
count++;
}
if(count==0)
return true;
else
return false;
}
public static boolean isHuiwen(int b){ //回文数的判断//
int a = b,k=0;
while (a != 0) {
k = k * 10 + a % 10;
a /= 10;
}
if(k==b)
return true;
else
return false;
}
}
运行结果: