Basically the title. The problem statement can be found here. No idea how to solve it efficiently.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 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 |
---|