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 9-th of them, one per line.
Output: 50 99 162 ... 999524 999728 999927
hide comments
|
rohith_kumar15:
2024-08-03 12:54:37
learn how to do prime decomposition of a number(finding prime divisors of a number) in logarithmic time and do this.
|
|
samun_49:
2023-08-20 23:24:43
Really fun problem. Tested my Sieve and Prime Decomposition knowledge. AC in one go. |
|
princemishra:
2020-10-22 16:43:21
I have successfully printed the values but still getting the wrong answer. Can someone help!!! |
|
skyfullofstars:
2020-07-15 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:
2020-07-12 20:26:18
Fun problem!
|
|
scolar_fuad:
2019-07-21 17:37:22
AC in one hit .... Nice one
|
|
shubhamrautela:
2018-10-07 18:29:55
is there anyone from india practicing for ICPC? |
|
s_a_k_s_h_a_m:
2018-06-11 22:34:41
consider 32,243.... also as numbers whose no of divisor is represented by p*q
|
|
nishant_26:
2018-01-16 15:39:24
east! AC in one go
|
|
dunjen_master:
2017-12-30 20:15:04
requires a lot of optimization |
| Added by: | czylabsonasa |
| Date: | 2005-05-16 |
| Time limit: | 0.705s |
| Source limit: | 3333B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
| Resource: | Folklore. |
RSS