HS08PAUL - A conjecture of Paul Erdős
In number theory there is a very deep unsolved conjecture of the Hungarian Paul Erdős (1913-1996), that there exist infinitely many primes of the form x2+1, where x is an integer. However, a weaker form of this conjecture has been proved: there are infinitely many primes of the form x2+y4. You don't need to prove this, it is only your task to find the number of (positive) primes not larger than n which are of the form x2+y4 (where x and y are integers).
An integer T, denoting the number of testcases (T≤10000). Each of the T following lines contains a positive integer n, where n<10000000.
Output the answer for each n.
Input: 4 1 2 10 9999999 Output: 0 1 2 13175
@gerrob (= problemsetter): After automatic change to Cube cluster, my old Python solution (using psyco) now has the top rank. I appreciate that automatized runtime recalculation without a real rejudge, so that old psyco using AC Python solutions do not change to NZEC/TLE.
Great problem!!! Loved solving it. :)
(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
my compressed precomputation fit on 4096B of source limit ;-) Great Problem, thanks.