# Euler 87 drill

using Primes

function main(n::Int64 = 50, verbose::Bool = false)
    P1 = primes(floor(Int64, sqrt(n)))
    P2 = primes(floor(Int64, n^(1/3)))
    P3 = primes(floor(Int64, n^0.25))
    c = 0

    for p1 in P1
        for p2 in P2
            for p3 in P3
                z = p1^2 + p2^3 + p3^4

                if z <= n
                    c += 1
                    if verbose; println(z, " = ", p1, "^2 + ", p2, "^3 + ", p3, "^4"); end
                end
            end
        end
    end

    println("")
    return c
end