Euler 87

euler87.py

#!/usr/bin/env python

from libeuler import primes

if __name__ == '__main__':
    p = primes(7100)
    res = set()
    for s in p:
        for c in p:
            for q in p:
                n = s*s + c*c*c + q*q*q*q
                if n < 50000000:
                    res.add(n)
    print len(res)