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

# | User | Rating |
---|---|---|

1 | tourist | 4009 |

2 | jiangly | 3839 |

3 | Radewoosh | 3646 |

4 | jqdai0815 | 3620 |

4 | Benq | 3620 |

6 | orzdevinwang | 3612 |

7 | Geothermal | 3569 |

8 | ecnerwala | 3494 |

9 | Um_nik | 3396 |

10 | gamegame | 3386 |

# | User | Contrib. |
---|---|---|

1 | maomao90 | 164 |

2 | Um_nik | 163 |

3 | -is-this-fft- | 159 |

4 | atcoder_official | 158 |

4 | cry | 158 |

6 | awoo | 156 |

7 | nor | 155 |

8 | adamant | 154 |

9 | TheScrasse | 153 |

10 | Dominater069 | 152 |

The permutation that minimizes the sum of floor(p[i]/i)

Revision en2, by yariss, 2024-04-30 23:12:34

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

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/10/2024 01:57:35 (l1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|