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
skyfullofstars:
20200715 16:26:29
I'm finding num of divisors for each number using prime factorization method and then making a check of O(1).


Shubham Jadhav:
20200712 20:26:18
Fun problem!


scolar_fuad:
20190721 17:37:22
AC in one hit .... Nice one


shubhamrautela:
20181007 18:29:55
is there anyone from india practicing for ICPC? 

s_a_k_s_h_a_m:
20180611 22:34:41
consider 32,243.... also as numbers whose no of divisor is represented by p*q


nishant_26:
20180116 15:39:24
east! AC in one go


dunjen_master:
20171230 20:15:04
requires a lot of optimization 

viratian_070:
20170624 20:33:11
easy one... 

kp:
20170619 16:11:22
Removed from todo list after 2 years 10 days. phew 

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. 
Added by:  czylabsonasa 
Date:  20050516 
Time limit:  0.705s 
Source limit:  3333B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Folklore. 