SPOJ.com - Problem DIV2

DIV2 - Divisors 2

#number-theory

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 108-th of them, one per line.

Example

Output:
267
511
753
...
999579
999781
999977

Submit solution!

hide comments

< Previous 1 2 3 Next >

	~!((@!@^&: 2011-09-08 20:24:25 M divides N <=> M mod N = 0 or N mod M = 0? >>> please use this terminus: http://mathworld.wolfram.com/Divides.html Last edit: 2011-09-21 21:29:47
	Dmitry Boltrushko: 2011-09-08 20:24:25 What is M? If for any M that divides N or for some M that divides M? Can M = 1? >>> M is a number. For each divisor M of N must hold d(M)\|d(N) also. Last edit: 2011-09-21 21:29:20

Submit solution!

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