Project Euler #37

euler37.py

from itertools import count
from itertools import islice
from math import sqrt

def truncated(n):
    l, s = [], 10
    while n / s > 0:
        l.extend([n / s, n % s])
        s *= 10
    return set(l)

def prime():
    primes = []
    for n in count(2):
        composite = 0
        for p in primes:
            if not n % p:
                composite = 1
                break
            elif p ** 2 > n:
                break
        if not composite:
            primes.append(n)
            yield n

def isprime(n):
    if n < 2:
        return 0
    for x in range(2, int(sqrt(n)) + 1):
        if n % x == 0:
            return 0
    return 1

def isprimel(l):
    for p in l:
        if not isprime(p):
            return 0
    return 1

print sum(islice((p
            for p in prime()
                if isprimel(truncated(p))
                    and p > 7), 11))