Facing a lot of difficulty in solving this problem from a long time. Problem Link-SAS002. Naive approach **O(sqrt(n))** clearly times out. How to solve this problem in given time limit and what is the intended time complexity of the algorithm? Thought about finding number of divisors in **O(n^(1/3))** and using that, after some research.Is that correct approach?

Yes, it seems to be the correct approach. This blog describes how to count number of divisors of a a number in

O(N^{1 / 3}) and this gives a proof that product of all divisors of N isN^{d / 2}where d is the number of divisors of N.Thanks for your reply. I will try to solve it out.

Nice problem! Thanks for sharing.