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
# | 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 | awoo | 163 |
2 | adamant | 163 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 147 |
7 | atcoder_official | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|