Hello!↵
↵
What is the fastest way to calc the number of divisors of n! , s.t 1 <= n <= 1e8.↵
↵
Number of test cases <= 5000 .↵
↵
I've stucked at this point while solving this problem [EasyFact](http://www.spoj.com/problems/EASYFACT/)
↵
What is the fastest way to calc the number of divisors of n! , s.t 1 <= n <= 1e8.↵
↵
Number of test cases <= 5000 .↵
↵
I've stucked at this point while solving this problem [EasyFact](http://www.spoj.com/problems/EASYFACT/)