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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3885 |
3 | jqdai0815 | 3682 |
4 | Benq | 3580 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3506 |
7 | ecnerwala | 3505 |
8 | Radewoosh | 3457 |
9 | Kevin114514 | 3377 |
10 | gamegame | 3374 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 170 |
2 | Um_nik | 162 |
3 | atcoder_official | 161 |
4 | maomao90 | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | Dominater069 | 156 |
8 | adamant | 154 |
9 | luogu_official | 153 |
10 | awoo | 152 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|