How we can break 'n' into 'k' parts such that their LCM is maximum? OR Find max(LCM(A1, A2, ..., Ak)) such that A1 + A2 + ... + Ak = n and 2 <= k <= n. Original Problem Link: http://acm.timus.ru/problem.aspx?space=1&num=1807
Maximize LCM
How we can break 'n' into 'k' parts such that their LCM is maximum? OR Find max(LCM(A1, A2, ..., Ak)) such that A1 + A2 + ... + Ak = n and 2 <= k <= n. Original Problem Link: http://acm.timus.ru/problem.aspx?space=1&num=1807
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
fsociety00 | 2018-12-01 17:27:50 | 122 | Tiny change: 'al to 2)? OR\nFind ' -> 'al to 2)? OR\nFind ' | |
| en1 |
|
fsociety00 | 2018-12-01 17:09:33 | 238 | Initial revision (published) |
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
