Hello everyone. Recently I found interesting [problem](https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4361) 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?
↵
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?
