
Since it is O(poly(log n)), it is O(n^epsilon) for all epsilon > 0.
Is it too much to ask a general question for an interval [a, b]?
Given [a, b], what is the maximum number of divisors that a number in [a, b] has?
Which difficulty level do you think this problem is in a SRM: easy, medium, or hard?
Example: Input [1, 10000000] Output 448
BTW, my question in the second post is the output of [1, 1000000000]. And, so far, I only see the need of a = 1. 