Interesting task from UVa online judge

Revision en1, by unbelievable, 2022-05-02 22:39:26

Hello everyone. Recently I found interesting problem from UVA online judge.

Short statement. There is an array $$$a$$$ of size $$$n$$$. You are given pairwise product of elements of $$$a$$$ ($$$n \cdot (n-1)/2$$$) products in total). You should find lexicographically minimal array $$$a$$$. $$$n < 200$$$.

Does anyone has ideas how to solve such problem?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English unbelievable 2022-05-02 22:40:29 0 (published)
ru4 Russian unbelievable 2022-05-02 22:40:01 31 Мелкая правка: 'жно найти массив $a' -> 'жно найти лексикографаически минимальный массив $a' (опубликовано)
en1 English unbelievable 2022-05-02 22:39:26 477 Initial revision for English translation (saved to drafts)
ru3 Russian unbelievable 2022-05-02 22:36:51 2 Мелкая правка: ' 200$. \nУ кого-т' -> ' 200$. \n\nУ кого-т'
ru2 Russian unbelievable 2022-05-02 22:36:32 21
ru1 Russian unbelievable 2022-05-02 22:35:21 422 Первая редакция (сохранено в черновиках)