Please subscribe to the official Codeforces channel in Telegram via the link ×

yariss's blog

By yariss, history, 3 months 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?

Full text and comments »

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