回文素数（优化解法）

import java.util.Scanner;
/**
*输入a,b，输出在a到b之间(a<=x<=b)的回文素数的个数
*/
public class Main{
    //回文判别法。只用数学方法做判断，针对这样的回文数效率应该是最高的方法了
    public static boolean isHuiNum(int num)
    {
        int y = num;
        int result = 0;
        while(num != 0)
        {
            result = result*10 + num%10;
            num /= 10;
        }
        return y==result;
    }
    //素数判别法。先将偶数过滤，再用输入数对3到输入数的平方根取余
    public static boolean isSuNum(int num)
    {
        if(num < 2 || num%2 == 0)
        {
            return false;
        }
        for(int i=3;i<=Math.sqrt(num);i+=2)
        {
            if(num%i == 0)
            {
                return false;
            }
        }
        return true;
    }
    
    
    
    public static void main(String[] args)
    {
        int count = 0;
        int min = 0;
        int max = 0;
        Scanner scanner = new Scanner(System.in);
        while(scanner.hasNext())
        {
            min = scanner.nextInt();
            max = scanner.nextInt();
           for(int i = min;i<=max;i++)
          {
            if(isHuiNum(i))
            {
                if(isSuNum(i))
                {
                    count++;
                }
            }
            
           }
           System.out.println(count);
        }               
    }   
}