Given n, how can we construct a permutation p of size n, such that the sum of p[i]/i is minimized?
→ Pay attention
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 164 |
| 2 | Um_nik | 163 |
| 3 | cry | 159 |
| 3 | atcoder_official | 159 |
| 5 | adamant | 157 |
| 5 | awoo | 157 |
| 5 | -is-this-fft- | 157 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
The permutation that minimizes the sum of floor(p[i]/i)
Revision en1, by yariss, 2024-04-30 23:11:29
History
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/16/2024 05:22:19 (f1).
Desktop version, switch to mobile version.
Supported by
