need help in counting divisors about cses-problems HOT 5 CLOSED

@pritam047, there is a formula that if a number n can be written as n = A^x * B^y * C^z where A, B, C, ... are prime numbers and x, y, z are positive integers, then number of distinct divisors can be = (x + 1) * (y + 1) * (z + 1).

now, in the given problem finding prime divisors in O(n^1/2) might exceed time limit, so try Sieve Of Eratosthenes Algorithm for this.

from cses-problems.

Can I know the range of input?

from cses-problems.

@kartavyashankar it's given in the question..the link to the problem is provided in comments

from cses-problems.

@belikesayantan thanks..will try it out

from cses-problems.

Thanks,Sieve of Eratosthenes helped!

from cses-problems.