yariss's blog

The permutation that minimizes the sum of floor(p[i]/i)
By yariss, history, 2 years ago, In English

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

  • Vote: I like it
  • +11
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
2 years ago, hide # |
← Rev. 2  
Vote: I like it +11 Vote: I do not like it

It is actually a problem from IMO(A3) link

→ Reply