Given n, how can we construct a permutation p of size n, such that the sum of floor(p[i]/i) is minimized?
The permutation that minimizes the sum of floor(p[i]/i)
Given n, how can we construct a permutation p of size n, such that the sum of floor(p[i]/i) is minimized?