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 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 154 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | pajenegod | 144 |
9 | orz | 144 |
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 |
---|