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
Number of divisors of factorial
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
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | The-Legend | 2016-10-14 10:58:37 | 34 | Tiny change: '= 1e8.\n\nI've ' -> '= 1e8.\n\nNumber of test cases <= 5000 .\n\nI've ' | ||
en2 | The-Legend | 2016-10-14 09:52:18 | 4 | |||
en1 | The-Legend | 2016-10-14 09:51:58 | 227 | Initial revision (published) |