Basically the title. The problem statement can be found here. No idea how to solve it efficiently.
UPDATE: why the downvotes?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 163 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Find user
→ Recent actions
smallest K such that number of arrangements of prime factors of K equals N?
Revision en3, by pabloskimg, 2018-10-28 19:15:30
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/13/2026 06:15:59 (g2).
Desktop version, switch to mobile version.
Supported by
