import java.util.Scanner;

public class P1217_PrimePalindromes {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		long a = sc.nextLong();
		long b = sc.nextLong();

		a1: for (long begin = a; begin <= b; begin++) {
			for (int i = 2; i <= Math.sqrt(begin); i++) {
				if (begin % 2 == 0) {
					continue a1;
				}
				if (begin % i == 0) {
					continue a1;
				}
			}
			StringBuffer s = new StringBuffer();
			s.append(begin);
			if (s.toString().equals(reverse(s))) {
				System.out.println(s);
			}
		}

		sc.close();

	}

	public static String reverse(StringBuffer str) {
		return new StringBuffer(str).reverse().toString();

	}
}

4个AC，其余TLE

问下这里，有使用java的大佬吗，这里有什么可以其他优化的地方，或者有什么其他更好的代码吗