### Блог пользователя thunderstorm_t_f

Автор thunderstorm_t_f, история, 12 месяцев назад, ,

hi, i think all of divisors of n(1 to 10^18) with in 9 sec is quit immpossible. if any idea or solution.please share it :) thank you

•
• +7
•

 » 12 месяцев назад, # |   0 Iterating from 1 to sqrt(n) and using divisor pairs will give you the answer. In 9 secs, I think you can do 10^9 operations, even with the constant of the modulo operation.
 » 12 месяцев назад, # |   +5 Good day to you,well firstly you can start with "Pollard Rho" (you will also need something like miller-rabin), which could factorize the number in O(N^(1/4)) [it is somehow long coding with many possible mistakes, but the core is not that bad].As you have it, you can generate all divisors by "simple recursion" in O(#NUMBER_OF_DIVISORS) Hope I guessed rightly what you asked for ^_^Good Luck & Have nice day!!
•  » » 12 месяцев назад, # ^ |   0 thanks i got it...yeah there have some mistake.. for large number it's quite impossible there is no exact solution for this ques with 9 sec :) thank you :)
•  » » » 12 месяцев назад, # ^ |   0 Well imho there is something more exact, but this is a lesser pain ^_^Also the probability is "soo big" you can treat is as exact :)Have nice day ^_^