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
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3870 |
| 2 | Benq | 3618 |
| 3 | Miracle03 | 3453 |
| 4 | peehs_moorhsum | 3430 |
| 5 | Radewoosh | 3418 |
| 6 | Petr | 3408 |
| 7 | maroonrk | 3387 |
| 8 | sunset | 3338 |
| 9 | ko_osaga | 3334 |
| 9 | jiangly | 3334 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | YouKn0wWho | 214 |
| 2 | 1-gon | 203 |
| 3 | Um_nik | 195 |
| 4 | Errichto | 181 |
| 5 | awoo | 180 |
| 6 | tourist | 176 |
| 6 | sus | 176 |
| 8 | antontrygubO_o | 173 |
| 9 | maroonrk | 170 |
| 10 | -is-this-fft- | 168 |
→ Find user
→ Recent actions
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2021 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/07/2021 15:54:38 (g2).
Desktop version, switch to mobile version.
Supported by
