Hello! What is the fastest way to calc the number of divisors of n! , s.t 1 <= n <= 1e8. I've stucked at this point while solving this problem EasyFact
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Number of divisors of factorial
Hello! What is the fastest way to calc the number of divisors of n! , s.t 1 <= n <= 1e8. 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 |
---|