DIV  Divisors
Let N be a positive integer. In theory it is easy to decide if d(N) (the number of positive divisors of N including 1 and N) is prime or not. Your task is just a little bit harder: compute all N in [1,10^6] for which d(N)=p*q where p and q distinct primes.
Input
There is no input for this problem.
Output
To make the problem less io related write out only every 9th of them, one per line.
Output: 50 99 162 ... 999524 999728 999927
hide comments
iceelement:
20170607 13:04:09
A/C in third attempt, funny thing is I had gotten to 1.5 seconds by using a heavily optimized but incorrect implementation. Got it to 0.4 with the correct logic. Hint : Corollary of Prime Sieve. 

ashu121:
20170327 00:12:06
AC in one go!!


holmesherlock:
20161225 20:47:31
thanks @mohitgupta07 

prasoonbatham:
20160916 19:01:27
SPOJ really doesn't like java... the same code give tle in java but runs in c :(


Anuj Arora:
20160904 18:37:41
Phewww...........one mistake cost me multiple SIGFPE .....and 3 hours 

mohitgupta07:
20160511 00:11:10
to Solve this ques..try for classical problem NDIV too :P :P u need to then just tweak ur algo to get answer for this one..nd whosoever r confused..


minhthai:
20160227 09:35:17
a must do! 

Aditya Kumar:
20150523 09:39:58
Really enjoyed


Swapnil Borse:
20141231 15:11:22
phew... took time but accepted in first go.. :)


Francky:
20141114 17:53:06
Note for archive : this problem was on Pyramid before this day, now on cube. EB don't have hands on those changes. 
Added by:  czylabsonasa 
Date:  20050516 
Time limit:  0.705s 
Source limit:  3333B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Folklore. 