擅长:python、mysql、java
<p>使用<a href="https://stackoverflow.com/questions/2211990/how-to-implement-an-efficient-infinite-generator-of-prime-numbers-in-python/10733621#10733621">indefinite primes generator</a>并在其上加上一个itertools过滤器,只保留回文素数,然后使用<code>islice(filtered_primes,n)</code>获得{<cd2>}第一个这样的素数:</p>
<pre><code>from itertools import *
def palindPrimes(n):
k = 0
for p in islice( filterfalse( lambda x: str(x) != str(x)[::-1],
postponed_sieve()), n):
## adjust the alignment and print it, then
k += 1
if k == 10:
k = 0
## print a newline to start a new line
</code></pre>