C++ number of divisors function with memoization?
I know you can get the number of divisors by taking advantage of prime factorization but I am not sure how it's actually pulled off. Would appreciate any advice for a fast algorithm
C++ number of divisors function with memoization?
===

I know you can get the number of divisors by taking advantage of prime factorization but I am not sure how it's actually pulled off. Would appreciate any advice for a fast algorithm