HS08PAUL  A conjecture of Paul Erdős
In number theory there is a very deep unsolved conjecture of the Hungarian Paul Erdős (19131996), that there exist infinitely many primes of the form x^{2}+1, where x is an integer. However, a weaker form of this conjecture has been proved: there are infinitely many primes of the form x^{2}+y^{4}. 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 x^{2}+y^{4} (where x and y are integers).
Input
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
Output the answer for each n.
Example
Input: 4 1 2 10 9999999 Output: 0 1 2 13175
hide comments
talha_76:
20210701 01:50:10
I got the soln now.


anchord:
20210503 08:41:19
got it at last :3 

worrywart_ind:
20210418 19:34:04
For hint: try to figure out all the possible values x^2 and x^4 are they enough to handle?? 

anchord:
20210412 06:41:32
I cannot figure out how to solve this with sieve, someone please give me a hint 

robosapien:
20200703 19:38:16
100th AC :)


rohan121_kumar:
20200529 20:39:31
easy Last edit: 20200604 09:16:39 

shivamvermadev:
20200404 12:27:44
Great Question


Shubham Jadhav:
20170511 17:37:38
Nice Problem. AC in one go :) 

Ankit:
20150802 11:14:02
good one:) 

[Lakshman]:
20150202 14:07:51
Something strange happend with my code. My last Ac took .20s today I changes my bool arr[] to vector 
Added by:  Robert Gerbicz 
Date:  20090405 
Time limit:  1s 
Source limit:  4096B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 JSMONKEY 
Resource:  High School Programming League 2008/09 