yariss's blog

The permutation that minimizes the sum of floor(p[i]/i)
By yariss, history, 3 weeks 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

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by yariss (previous revision, new revision, compare).

→ Reply
»
3 weeks ago, # |
← Rev. 2   Vote: I like it +11 Vote: I do not like it

It is actually a problem from IMO(A3) link

→ Reply