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
# | User | Rating |
---|---|---|
1 | Benq | 3813 |
2 | tourist | 3768 |
3 | maroonrk | 3570 |
4 | Radewoosh | 3535 |
5 | fantasy | 3526 |
6 | jiangly | 3523 |
7 | Um_nik | 3522 |
8 | orzdevinwang | 3441 |
9 | cnnfls_csy | 3427 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | awoo | 180 |
2 | -is-this-fft- | 179 |
3 | nor | 169 |
4 | Um_nik | 168 |
5 | SecondThread | 164 |
6 | adamant | 163 |
7 | maroonrk | 162 |
8 | kostka | 161 |
9 | YouKn0wWho | 158 |
10 | errorgorn | 155 |
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) |
Name |
---|