Basically the title. The problem statement can be found here. No idea how to solve it efficiently.
# | 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 |
3 | awoo | 162 |
4 | nor | 153 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 150 |
8 | Petr | 145 |
9 | atcoder_official | 144 |
9 | pajenegod | 144 |
smallest K such that number of arrangements of prime factors of K equals N?
Basically the title. The problem statement can be found here. No idea how to solve it efficiently.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en6 |
![]() |
pabloskimg | 2018-10-29 20:56:46 | 125 | ||
en5 |
![]() |
pabloskimg | 2018-10-29 20:46:41 | 4 | Tiny change: 'r)!}{k_1! + ... + k_r!} < 2' -> 'r)!}{k_1! * ... * k_r!} < 2' | |
en4 |
![]() |
pabloskimg | 2018-10-29 20:45:40 | 605 | Tiny change: '_r$ ($k_i >= k_j$ for ' -> '_r$ ($k_i \geq k_j$ for ' | |
en3 |
![]() |
pabloskimg | 2018-10-28 19:15:30 | 30 | Tiny change: 'ficiently.' -> 'ficiently.\n\nUPDATE: why the downvotes?' | |
en2 |
![]() |
pabloskimg | 2018-10-27 17:43:02 | 1 | ||
en1 |
![]() |
pabloskimg | 2018-10-27 17:41:36 | 227 | Initial revision (published) |
Name |
---|