回文素数（回文数——从左到右和从右到左是看一样的；素数——指在一个大于1的自然数中，除了1和此整数自身外，没法被其他自然数整除的数。） -Prime Palindromes（The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program

能够实现从1到10000000000的回文素数列举。效率较高，值得学习。-Can be achieved from 1-10000000000 palindromic primes enumerated. Higher efficiency, it is worth learning.

一些相关问题的c++计算。 包括算回文素数，算时间-some cpp yunsuan including huiwen sushu

判断5到20亿之间的回文质数（也称回文素数）。采用构建奇数长度回文数的方法，将计算量级缩小。-Palindromic primes judge (also called palindromic primes) 5-2000000000 between. The method of constructing odd length palindrome, and will calculate the magnitude smaller.