Maximize LCM

Правка en1, от fsociety00, 2018-12-01 17:09:33

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

Теги #number theory, #dynamic-programming

История

 
 
 
 
Правки
 
 
  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)