DIV2  Divisors 2
Let N be a positive integer and d(N) be the number of positive divisors of N including 1 and N. Your task is to compute all N in [1,10^6] for which d(N)>3 and if M divides N then d(M) divides d(N) too.
Input
None.
Output
To make the problem less output related write out only every 108th of them, one per line.
Example
Output: 267 511 753 ... 999579 999781 999977
hide comments
Sunny:
20160811 19:15:22
I tried running a loop from square root of a number to its half, counting 2 for each factor and storing the factors and so on as well as storing d(N) for all values starting from 1 to 1000000. I am getting a TLE. 

Piyush Kumar:
20160714 14:15:23
For people confused about M, M divides N, so M is a divisor of N. 

nami20:
20160608 00:06:49
can anybody explain what is M? Last edit: 20160608 00:07:14 

tanim_kuet:
20151212 21:24:12
What is M? 

Sayak Haldar:
20150123 18:04:00
this problem is awesome...:) 

Francky:
20141114 17:52:49
Note for archive : this problem was on Pyramid before this day, now on cube. EB don't have hands on those changes. 

Bharath Reddy:
20140914 14:17:24
Clever problem. Easy to implement... 

যোবায়ের:
20110908 20:24:25
M divides N ==> N % M = 0 

~!(*(@*!@^&:
20110908 20:24:25
M divides N <=> M mod N = 0 or N mod M = 0?

Added by:  czylabsonasa 
Date:  20050524 
Time limit:  1s 
Source limit:  3333B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Folklore 