1.
2.代码实现
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int s=0;
for(int i=11;i<=n;i++)
{ if(isHuiwen(i)&&isPrime(i))
s++;
}
System.out.print(s);
}
static boolean isHuiwen(int x)
{
String s=String.valueOf(x);
int a=s.length();
int b=0;
while(b<=(a/2)-1&&s.charAt(b)==s.charAt(a-b-1))
b++;//如果某个数一半之前都相等
if(b==a/2)//判断中间的数
return true;
else
return false;
}
static boolean isPrime(int x)
{ int i=2;
while((x%i!=0)&&(i<=Math.floor(Math.sqrt(x))))
i++;
if(i>Math.floor(Math.sqrt(x)))
return true;
else
return false;
}
}