how to find pth factor of number n; example- n= 12 ,p= 3 factor of 12={1,2,3,4,6,12}; ans= 3;
constraints; n<=10^15; got tle in O(sqrt(n)); pls help
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
how to find pth factor of number n; example- n= 12 ,p= 3 factor of 12={1,2,3,4,6,12}; ans= 3;
constraints; n<=10^15; got tle in O(sqrt(n)); pls help
Name |
---|
o(sqrt(n)) is the most optimal approach ig.
Pollard's Rho (assuming that we are detecting primes with Miller-Rabin) gives an estimated time complexity of $$$O(n^\frac{1}{4})$$$.
I think I've done a problem that's the same as this; it passed TL in O(sqrt(n)).
Edit: the problem is 762A - k-th divisor, my submission 148662965